Interaction in quantum communication and the complexity of set disjointness

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 124-133

  Klauck, H ^a   Nayak, A ^a   Ta Shma, A ^a   Zuckerman, D ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM THEORY; THEOREM PROVING;

QUBITS;

COMPUTATIONAL COMPLEXITY;

EID: 0034819349     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380786     Document Type: Conference Paper

References (28)

1. Quantum circuits with mixed states
2. The quantum communication complexity of sampling
3. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
4. Quantum complexity theory
5. Quantum vs. classical communication and computation
6. Communication complexity lower bounds by polynomials
7. Quantum entanglement and the communication complexity of the inner product function
8. Lower bounds on communication complexity
9. Cryptographic distinguishability measures for quantum-mechanical states
10. Fidelity for mixed quantum states
11. Lower bounds for computation with limited nondeterminism
12. On quantum and probabilistic communication: Las vegas and one-way protocols
13. On rounds in quantum communication
14. Why quantum bit commitment and ideal quantum coin tossing are impossible
15. Unconditionally secure quantum bit commitment is impossible
16. On data structures and asymmetric communication complexity
17. Optimal lower bounds for quantum automata and random access codes
18. Rounds in communication complexity revisited
19. Communication complexity
20. The communication complexity of pointer chasing, applications of entropy and sampling
21. Exponential separation of quantum and classical communication complexity
22. The 'transition probability' in the state space of a *-algebra
23. Quantum circuit complexity