Exponential separation of quantum and classical communication complexity
Author:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 358-367
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Dense Coding in Experimental Quantum CommunicationPhysical Review Letters, 1996
- Quantum cryptographyContemporary Physics, 1995
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channelsPhysical Review Letters, 1993
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- The Probabilistic Communication Complexity of Set IntersectionSIAM Journal on Discrete Mathematics, 1992
- Private vs. common random bits in communication complexityInformation Processing Letters, 1991
- Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics, 1990