Bounded-error quantum state identification and exponential separations in communication complexity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 594-603

  Gavinsky, Dmitry ^a   Kempe, Julia ^b   Regev, Oded ^c   De Wolf, Ronald ^d  

^a UNIVERSITY OF CALGARY   (Canada)

^b CNRS   (France)

^c TEL AVIV UNIVERSITY   (Israel)

^d CWI   (Netherlands)

Author keywords

Communication complexity; Entanglement; Quantum computing; Randomness; State identification

Indexed keywords

ERROR ANALYSIS; INFORMATION THEORY; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

COMMUNICATION COMPLEXITY; ENTANGLEMENT; QUANTUM COMPUTING; RANDOMNESS; STATE IDENTIFICATION;

QUANTUM THEORY;

EID: 33748093058     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132602     Document Type: Conference Paper

References (30)

1. A. Ambainis. Communication complexity in a 3-computer model. Algorithmica, 16(3):298-301,1996.
2. L. Babai and P. G. Kimmel. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In Proceedings of 12th IEEE Conference on Computational Complexity, p. 239-246, 1997.
3. Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis. Exponential separation of quantum and classical one-way communication complexity. In Proceedings of 36th ACM STOC, p. 128-137, 2004.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. Information theory methods in communication complexity. In Proceedings of 17th IEEE Conference on Computational Complexity, p. 93-102, 2002.
5. R. Bhatia. Matrix Analysis. Number 169 in Graduate Texts in Mathematics. Springer, 1997.
6. H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, 70:131-141, Feb. 2000.
7. H. Buhrman. Personal communication, Nov. 2003.
8. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), Sep. 26, 2001.
9. R. Cleve and H. Buhrman. Substituting quantum entanglement for communication. Physical Review A, 56(2):1201-1204, 1997.
10. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
11. Y. C. Eldar. A semidefinite programming approach to optimal unambiguous discrimination of quantum states. IEEE Transactions on Information Theory, 49:446-456, 2003.
12. D. Gavinsky. A note on shared randomness and shared entanglement in communication. quant-ph/0505088, 12 May 2005.
13. D. Gavinsky, J. Kempe, and R. de Wolf. Quantum communication cannot simulate a public coin. quant-ph/0411051, 8 Nov 2004.
14. D. Gavinsky, J. Kempe, O. Regev, and R. de Wolf. Bounded-error quantum state identification and exponential separations in communication complexity. quant-ph/0511013, 2 Nov 2005.
15. A. Golinsky and P. Sen. A note on the power of quantum fingerprinting, quant-ph/0510091, Dec. 2003.
16. A. S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9(3):3-11, 1973.
17. English translation in Problems of Information Transmission, 9:177-183, 1973.
18. C. King and M-B. Ruskai. Comments on multiplicativity of maximal p-norms when p = 2. In O. Hirota, editor, Quantum Information, Statistics, Probability (Festschrift for A. Holevo). Rinton Press, 2004.
19. H. Klauck. Quantum communication complexity. In Proceedings Workshop on Boolean Functions and Applications at 27th ICALP, p.241-252, 2000.
20. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
21. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
22. L. Lovász. Semidefinite programs and combinatorial optimization. At http://research.microsoft.com/users/lovasz/notes.htm, 2000.
23. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of 40th IEEE FOCS, p. 369-376, 1999.
24. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2):67-71, 1991.
25. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In Proceedings of 28th ACM STOC, p. 561-570, 1996.
26. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
27. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38:49-95, 1996.
28. R. de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):337-353, 2002.
29. A. C-C. Yao. Quantum circuit complexity. In Proceedings of 34th IEEE FOCS, p. 352-360, 1993.
30. A. C-C. Yao. On the power of quantum fingerprinting. In Proceedings of 35th ACM STOC, p. 77-81, 2003.