The quantum communication complexity of sampling

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1570-1585

  Ambainis, Andris ^a   Schulman, Leonard J ^b   Ta Shma, Amnon ^c   Vazirani, Umesh ^d   Wigderson, Avi ^e,f  

^a UNIVERSITY OF LATVIA   (Latvia)

^b California Institute of Technology   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^f INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Communication complexity; Quantum communication complexity; Quantum information theory; Set disjointness; The log rank conjecture in communication complexity

Indexed keywords

COMMUNICATION COMPLEXITY; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM INFORMATION THEORY; SET-DISJOINTLESS; THE LOG-RANK CONJECTURE IN COMMUNICATION COMPLEXITY;

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL TECHNIQUES; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY; THEOREM PROVING;

SAMPLING;

EID: 0942299111     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979935476     Document Type: Article

References (22)

1. S. AARONSON AND A. AMBAINIS, Quantum Search of Spatial Regions, Technical report, in quant-ph/0303041.
2. D. AHARONOV, A. KITAEV, AND N. NISAN, Quantum circuits with mixed states, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX, 1998, ACM, New York, pp. 20-30.
3. A. AMBAINIS, A. NAYAK, A. TA-SHMA, AND U. VAZIRANI, Dense quantum coding and quantum finite automata, J. ACM, 49 (2002), pp. 496-511.
4. L. BABAI. P. FRANKL, AND J. SIMON, Complexity classes in communication complexity theory, in Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), 1986, Toronto, IEEE Computer Society Press, Washington, DC, 1986, pp. 337-347.
5. C. BENNETT AND S. WIESNER, Communication via one- and two- particle operators on Einstein-Podolsky-Rosen states, Phys. Rev. Lett., 69 (1992), pp. 2881-2884.
6. H. BUHRMAN, R. CLEVE, AND A. WIGDERSON, Quantum vs. classical communication and computation, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX, 1998, ACM, New York, 1998, pp. 63-68.
7. R. CLEVE, W. VAN DAM, M. NIELSEN, AND A. TAPP, Quantum entanglement and the communication complexity of the inner product function, Lecture Notes in Comput. Sci., 1509 (2002), pp. 61-74.
8. D. DEUTSCH AND R. JOZSA, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439 (1992), pp. 553-558.
9. L. K. GROVER, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), Philadelphia, PA, 1996, ACM, New York, 1996, pp. 212-219.
10. A. HOLEVO, Bounds for the quantity of information transmitted by a quantum communication channel, in Problemy Peredachi Informatsii, 9 (1973), pp. 3-11; English translation Prob. Inf. Transm., 9 (1973), pp. 177-183.
11. A. HOLEVO, Bounds for the quantity of information transmitted by a quantum communication channel, in Problemy Peredachi Informatsii, 9 (1973), pp. 3-11; English translation Prob. Inf. Transm., 9 (1973), pp. 177-183.
12. R. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1987.
13. I. KREMER, Quantum Communication, Master's thesis, The Hebrew University of Jerusalem, Jerusalem, 1995.
14. L. LOVASZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
15. A. NAYAK, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), New York, 1999, IEEE Computer Society Press, Washington, DC, 1999, pp. 369-376.
16. N. NISAN AND A. WIGDERSON, On rank vs. communication complexity, Combinatorica, 15 (1995), pp. 557-566.
17. N. NISAN AND E. KUSHILEVITZ, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
18. A. A. RAZBOROV, Quantum communication complexity of symmetric predicates, Izvestiya Math, 67 (2003) (in Russian); English version at quant-ph/0204025.
19. R. RAZ AND B. SPIEKER, On the "log rank"-conjecture in communication complexity, Combinatorica, 15 (1995), pp. 567-588.
20. R. RAZ, Exponential separation of quantum and classical communication complexity, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), Atlanta, GA, 1999, ACM, New York, 1999, pp. 358-367.
21. A.C. YAO, Quantum circuit complexity, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), Palo Alto, CA, 1993, IEEE Computer Society Press, Silver Springs, MD, 1993, pp. 352-361.
22. A. C. YAO, Some complexity questions related to distributive computing, in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), Atlanta, GA, 1979, ACM, New York, pp. 209-213.