Lower bounds for quantum communication complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 288-297

  Klauck, H ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; FOURIER TRANSFORMS; NETWORK PROTOCOLS; QUANTUM THEORY; SENSITIVITY ANALYSIS;

QUANTUM COMMUNICATION;

INFORMATION THEORY;

EID: 0035187013     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959903     Document Type: Conference Paper

References (25)

1. Communication via one- and two-particle operators on einstein-podolsky-rosen states
2. Quantum counting
3. Quantum vs. classical communication and computation
4. Communication complexity lower bounds by polynomials
5. Substituting quantum entanglement for communication
6. Quantum entanglement und the communication complexity of the inner product function
7. Elements of information theory
8. Separating counting communication complexity classes
9. A linear lower bound on the unbounded error probabilistic communication complexity
10. A fast quantum mechanical algorithm for database search
11. Relations between communication complexity classes
12. The influence of variables on Boolean functions
13. The probabilistic communication complexity of set intersection
14. Interaction in quantum communication and the complexity of set disjointness
15. Private vs. common random bits in communication complexity
16. Probabilistic communication complexity
17. Fourier analysis for probabilistic communication complexity
18. Exponential separation of quantum and classical communication complexity
19. Characterization of non-deterministic quantum query and quantum communication complexity
20. Quantum circuit complexity