Ran Raz
- Aha.D. Aharonov, "Quantum Computation", to appear in Annual Reviews of Computational Physics, ed. Dietrich Stauffer~ World Scientific, vol VI, 1998. (Also in quant-ph/9812037).Google Scholar
- AS.N. Alon and J.H. Spencer, The Probabilistic Methods John Wiley & Sons Inc., 1992.Google Scholar
- ASTVW.A. Ambainis, L. Schulmaa, A. Ta-Shma, U. Vazirant and A. Wigderson, "The quantum communication complexity of sampling", Proc. of the 39th IEEE Syrup. Found. of Computer Science, 1998. Google ScholarDigital Library
- BBCJPW.C.H. Bennett, G. Brassaxd, C. Cr~pe~u, R. Jozsa, A. Peres, and W.K. Wootters, "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channells', Phys. Rev. Lett., 70, pp~1895-~898, 1993.Google Scholar
- BCW.H. Buhrman, R. Cleve and A. Wigderson, "Quantum vs. classical communication and computation', Proe. 30th Ann. A CM .qymp. Theor. Cornput., 1998. (Also in quant-ph/9802040). Google ScholarDigital Library
- BPMWZ.D. Bouwmeester, J-W. Pan, K. Mattle, H. Weinfurter and A. Zeilinger, "Experimental quantum teleportation", Nature, 390, pp.575-579, 1997.Google ScholarCross Ref
- BV.E. Bernstein and U. Vazirani, "Quantum complexity theory", SIAM J. of Comput., 26 (5), pp.1411- 1473, 1997. (Also in STOC 1993). Google ScholarDigital Library
- Gro.L.K. Grover, "Quantum mechanics helps in searching for a needle in a haystack", Phys. Rev. Left., 79, pp.325-328~ 1997. (Also in quant-ph/9706033 a~d ST OC 1996).Google ScholarCross Ref
- Hol.A.S. Holevo, "Bounds for the quantity of information transmitted by a quantum communication channel", Problemy Peredachi Informatsii, 9 (3) pp.3-11, 1973. English translation: Problems of Information Transmission, 9, pp.177-183, 1973.Google Scholar
- HADLMS.R.J. Hughes, D.M. Alde, P. Dyer, G.G. Luther, G.L. Morgan and M. Schauer, "Quantum cryptography'', Contemp. Phys., 36, pp.149-163, 1995.Google ScholarCross Ref
- Kre.I. Kremer, Quantum Communication~ MSc Thesis, Computer Science Department, The Hebrew University, 1995.Google Scholar
- KN.E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge University Press, 1997. Google ScholarDigital Library
- KS.B. Kalyanasundaram and G. Schnitger, "The probabitistic communication complexity of set intersection'', SIAM J. on Disc. Math., 5 (4), pp. 545- 557, 1992. (Also in Structures in complexity theory 1987). Google ScholarDigital Library
- KW.M. Kaxchmer and A. Wigderson, "Monotone circuits for connectivity require super-logarithmic depth", SIAM ,l. on Disc. Math., 3 (2), pp.255- 265, t990. (Also in STOC 1998).Google ScholarCross Ref
- MS.V.D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Norme~ Spaces, Springer-Verlag, 1986. Google ScholarDigital Library
- MWKZ.K. Mattle, H. Weinfurter, P.G. Kwiat and A. Zeilinger, ':Dense coding in experimental quantum communication", Phys. I~ev. Lett., 76, pp.4656- 46597 1996.Google ScholarCross Ref
- New.I. Newman, "Private vs. common random bits in communication complexity", Information Processing Letters, 39, pp.67-71, 1991. Google ScholarDigital Library
- Pre.J. Preskill, Lecture notes on quantum information and quantum computation~ http://www.theory, caltech.edu/people/preskitl/ph229/Google Scholar
- Razb.A.A. Razborov, "On the Distributional Complexity of Disjointness", Theoretical Computer science, 106 (2), pp.385-390, 1992. (Also in ICALP 1990). Google ScholarDigital Library
- Sho.P~W. Shot, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer", SIAM d. o.f GomputJ, 26 (5), pp. 1484- 1509, 1997. (Also in FOCS 1994). Google ScholarDigital Library
- Yao1.A.C.C. Yao, "Some complexity questions related to distributive compu~ing~" Proc. 11~h Ann. A GM Syrup. Theor. Comput., 209-213, 1979. Google ScholarDigital Library
- Yao2.A.C.C. ~ao, "Quantum circuit complexity", Proc. of the 3~th IEEE Syrup. Fouad. of Computer Science, pp. 352-361, 1993.Google Scholar
Index Terms
- Exponential separation of quantum and classical communication complexity
Recommendations
Exponential separation of quantum communication and classical information
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of ComputingWe exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis et. al. [SICOMP ...
Exponential separation of quantum and classical one-way communication complexity
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingWe give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Problem HMn: Alice gets as input a string x ∈ (0, 1)n and Bob gets a perfect matching M ...
Exponential Separation of Quantum and Classical Online Space Complexity
Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian ScheidelerAlthough quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we study, for ...
Comments