Fetching the paper…
Reading the bibliography…
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered.
Subrahmanyan Chandrasekhar, “Stochastic Problems in Physics and Astronomy,” Reviews of Modern Physics
1943
Earlier work this paper cites.
Andrew Chi-Chin Yao, “Probabilistic computations: Toward a unified measure of complexity,” Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (SFCS’77), pp. 222–227, 1977
1977
Earlier work this paper cites.
Foek T. Hioe, Joseph H. Eberly, “N-Level Coherence Vector and Higher Conservation Laws in Quantum Optics and Quantum Mechanics,” Phys. Rev. Lett
1981
Earlier work this paper cites.
Stephen Wiesner, “Conjugate coding,” SIGACT News
1983
Earlier work this paper cites.
Larry C. Grove, Clark T. Benson, “Finite Reflection Groups”, 2nd Ed., Springer, 1985
1985
Earlier work this paper cites.
Roger A. Horn, Charles R. Johnson, “Matrix Analysis,” Cambridge University Press, 1985
1985
Earlier work this paper cites.
Walter W. Rouse Ball, H.S.M. Coxeter, “Mathematical Recreations and Essays,” 13th Ed., Courier Dover Publications, 1987
1987
Earlier work this paper cites.
William K. Wootters, Brian D. Fields, “Optimal State-Determination by Mutually Unbiased Measurements,” Annals of Physics
1989
Earlier work this paper cites.
Barry D. Hughes, “Random Walks and Random Environments,” vol. 1, Clarendon Press, 1995
1995
Earlier work this paper cites.
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani, “Dense quantum coding and a lower bound for 1-way quantum automata,” Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC’99), pp. 376–383, 1999. arXiv:quant-ph/9804043v2
1999
Earlier work this paper cites.
Ashwin Nayak, “Optimal lower bounds for quantum automata and random access codes,” Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS’99), pp. 369–376, 1999. arXiv:quant-ph/9904093v3
1999
Earlier work this paper cites.
Michael A. Nielsen, Isaac L. Chuang, “Quantum Computation and Quantum Information,” Cambridge University Press, 2000
2000
Cited alongside, same era.
Hartmut Klauck, “Lower bounds for quantum communication complexity,” Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS’01), pp. 288, 2001. arXiv:quant-ph/0106160v3
2001
Cited alongside, same era.
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani, “Dense Quantum Coding and Quantum Finite Automata,” Journal of the ACM
2002
Cited alongside, same era.
Ernesto F. Galvão, “Foundations of quantum theory and quantum information applications,” PhD thesis, University of Oxford, 2002
2002
Cited alongside, same era.
Asher Peres, “Quantum Theory: Concepts and Methods,” Kluwer Academic Publishers, 2002
2002
Cited alongside, same era.
Joseph M. Renes, Robin Blume-Kohout, Andrew J. Scott, Carlton M. Caves, “Symmetric Informationally Complete Quantum Measurements,” J. Math. Phys
2004
Later among the works it cites.
Stephanie Wehner, Ronald de Wolf, “Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval,” Automata, Languages and Programming, pp. 1424–1436, 2005. arXiv:quant-ph/0403140v2
2005
Later among the works it cites.
Gen Kimura, Andrzej Kossakowski, “The Bloch-Vector Space for N-Level Systems: the Spherical-Coordinate Point of View,” Open Syst. Inf. Dyn
2005
Later among the works it cites.
Ingemar Bengtsson, Åsa Ericsson, “Mutually Unbiased Bases and the Complementarity Polytope,” Open Syst. Inf. Dyn
2005
Later among the works it cites.
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita, “ ( 4 , 1 ) (4,1) -Quantum
2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gen Kimura, “The Bloch vector for N-level systems,” Physics Letters A
2003
Cited alongside, same era.
Mark S. Byrd, Navin Khaneja, “Characterization of the Positivity of the Density Matrix in Terms of the Coherence Vector Representation,” Phys. Rev. A
2003
Cited alongside, same era.
Scott Aaronson, “Limitations of Quantum Advice and One-Way Communication,” Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC’04), pp. 320–332, 2004. arXiv:quant-ph/0402095v4
2004
Cited alongside, same era.
Iordanis Kerenidis, “Quantum Encodings and Applications to Locally Decodable Codes and Communication Complexity,” PhD thesis, University of California at Berkeley, 2004
2004
Cited alongside, same era.
Iordanis Kerenidis, Ronald de Wolf, “Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument,” J. Comput. Syst. Sci
2004
Cited alongside, same era.
Giuliano Benenti, Giulio Casati, Giuliano Strini, “Principles of Quantum Computation and Information,” vol. 1, World Scientific, 2004
2004
Cited alongside, same era.
Eric W. Weisstein, “Stirling’s Approximation,” MathWorld. http://mathworld.wolfram.com/StirlingsApproximation.html
Cited in the paper.
Later among the works it cites.
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf, “Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity,” Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC’06), pp. 594–603, 2006. arXiv:quant-ph/0511013v1
2006
Later among the works it cites.
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita, “Quantum Network Coding,” Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), pp. 610–621, 2007. arXiv:quant-ph/0601088v2
2007
Later among the works it cites.
Scott Aaronson, “The Learnability of Quantum States”, Proc. Roy. Soc. London Ser. A
2007
Later among the works it cites.
2008
Closest in time.
2008
Closest in time.