Limitations of quantum advice and one-way communication

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 320-332

  Aaronson, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; QUANTUM ADVICE; QUANTUM SEARCH;

COMMUNICATION; POLYNOMIALS; PROBABILITY; QUANTUM THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 4944248531     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. S. Aaronson. Quantum lower bound for the collision problem, Proc. ACM STOC, pp. 635-642, 2002. quant-ph/0111102.
2. S. Aaronson. Is quantum mechanics an island in theoryspace?, Proceedings of the Växjö Conference "Quantum Theory: Reconsideration of Foundations" (A. Khrennikov, ed.), 2004. quant-ph/0401062.
3. L. Adleman, J. DeMarrais, and M.-D. Huang. Quantum computability, SIAM J. Comp. 26(5):1524-1540, 1997.
4. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata, Proc. ACM STOC, pp. 376-383, 1999. quant-ph/9804043.
5. Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis. Exponential separation of quantum and classical one-way communication complexity, to appear in Proc. ACM STOC, 2004.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials, J. ACM 48(4):778-797, 2001. quant-ph/9802049.
7. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing, SIAM J. Comp. 26(5):1510-1523, 1997. quant-ph/9701001.
8. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters. Teleporting an unknown quantum state by dual classical and EPR channels, Phys. Rev. Lett. 70:1895-1898, 1993.
9. A with probability 1, SIAM J. Comp. 10(1):96-113, 1981.
10. C. H. Bennett and S. J. Wiesner. Communication via 1- and 2-particle operators on Einstein-Podolsky-Rosen states, Phys. Rev. Lett. 69:2881-2884, 1992.
11. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting, Phys. Rev. Lett. 87(16), 2001. quant-ph/0102001.
12. P. Duriš, J. Hromkovič, J. D. P. Rolim, and G. Schnitger. Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations, Proc. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 117-128, 1997.
13. H. Ehlich and K. Zeller. Schwankung von polynomen zwischen gitterpunkten, Mathematische Zeitschrift 86:41-44, 1964.
14. L. Fortnow and J. Rogers. Complexity limitations on quantum computation, J. Comp. Sys. Sci. 59(2):240-252, 1999. cs.CC/9811023.
15. O. Goldreich. On quantum computing, 2004. http://www.wisdom.weizmann.ac. il/~oded/on-qc.html.
16. Y. Han, L. Hemaspaandra, and T. Thierauf. Threshold computation and cryptographic security, SIAM J. Comp. 26(1):59-78, 1997.
17. A. S. Holevo. Some estimates of the information transmitted by quantum communication channels, Problems of Information Transmission 9:177-183, 1973 (English translation).
18. R. M. Karp and R. J. Lipton. Turing machines that take advice, Enseign. Math. 28:191-201, 1982.
19. H.Klauck. Quantum communication complexity, Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2000. quant-ph/0005032.
20. H. Klauck. Quantum time-space tradeoffs for sorting, Proc. ACM STOC, pp. 69-76, 2003. quant-ph/0211174.
21. H. Klauck, R. Špalek, and R. de Wolf. Quantum and classical strong direct product theorems and optimal time-space tradeoffs, manuscript, 2004.
22. E. Kushilevitz and N. Nisan. Communication Complexity, Cambridge, 1997.
23. A. Nayak. Optimal lower bounds for quantum automata and random access codes, Proc. IEEE FOCS, pp. 369-377, 1999. quant-ph/9904093.
24. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information, Cambridge, 2000.
25. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials, Comput. Complexity 4(4):301-313, 1994.
26. H. Nishimura and T. Yamakami. Polynomial time quantum computation with advice, ECCC TR03-059, 2003. quant-ph/0305100.
27. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions, Proc. ACM STOC, pp. 468-474, 1992.
28. T. J. Rivlin. Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory, Wiley, 1990.
29. T. J. Rivlin and E. W. Cheney. A comparison of uniform approximations on an interval and a finite subset thereof, SIAM J. Numerical Analysis 3(2):311-320, 1966.
30. N. Sauer. On the density of families of sets, J. Combinatorial Theory Series A, 13:145-147, 1972.
31. A. Winter. Quantum and classical message identification via quantum channels, to appear in A. S. Holevo Festschrift, Rinton, 2004. quant-ph/0401060.
32. A. C-C. Yao. On the power of quantum fingerprinting, Proc. ACM STOC, pp. 77-81, 2003.
33. A. C-C. Yao. Some complexity questions related to distributive computing, Proc. ACM STOC, pp. 209-213, 1979.
34. A. C-C. Yao. "Current Problems in Theory" course assignment #3, 2001. http://www.cs.princeton.edu/courses/ archive/spr01/cs598a/assignments/ hw3.ps.