Limitations of quantum advice and one-way communication

Theory of Computing

Volumn 1, Issue , 2005, Pages 1-28

  Aaronson, Scott ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Advice; BQP; Communication; Direct product theorem; Nonuniform; Oracle; Polynomial method; PP; Quantum computation; Relativized complexity

Indexed keywords

COMMUNICATION; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; POLYPROPYLENES; QUANTUM COMMUNICATION; QUANTUM COMPUTERS;

ADVICE; DIRECT PRODUCT THEOREMS; NONUNIFORM; ORACLE; POLYNOMIAL METHODS; RELATIVIZED COMPLEXITY;

QUANTUM THEORY;

EID: 33748590174     PISSN: None     EISSN: 15572862     Source Type: Journal    
DOI: 10.4086/toc.2005.v001a001     Document Type: Article

References (40)

1. S. AARONSON: Quantum lower bound for the collision problem. In Proc. 34th ACM STOC, pp. 635-642, 2002. [STOC:509907.509999, arXiv:quant-ph/0111102]. 11, 6
2. S. AARONSON: Limitations of quantum advice and one-way communication. In 19th IEEE Conf. Comput. Complexity (CCC), pp. 320-332, 2004. [CCC:10.1109/CCC.2004.1313854, arXiv:quant-ph/0402095]. 1
3. S. AARONSON: Quantum computing, postselection, and probabilistic polynomial-time. Submitted, 2004. [arXiv:quant-ph/0412187]. 3.1
4. L. ADLEMAN, J. DEMARRAIS, and M.-D. HUANG: Quantum computability. SIAM J. Computing, 26(5):1524-1540, 1997. [SICOMP:10.1137/S0097539795293639]. 3.1
5. A. AMBAINIS, A. NAYAK, A. TA-SHMA, AND U. V. VAZIRANI: Quantum dense coding and quantum finite automata. J. ACM, 49:496-511, 2002. Earlier version in 31st ACM STOC, 1999, pp. 376-383. [JACM:581771.581773, arXiv:quant-ph/9804043]. 1, 2.3
6. Z. BAR-YOSSEF, T. S. JAYRAM, and I. KERENIDIS: Exponential separation of quantum and classical one-way communication complexity. In 36th ACM STOC, pp. 128-137, 2004. [STOC:1007352.1007379, ECCC:TR04-036]. 1, 2.1, 6
7. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, and R. DE WOLF: Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001. Earlier version in 39th IEEE FOCS, 1998, pp. 352-361. [JACM:502090.502097, arXiv:quant-ph/9802049]. 1, 4, 4
8. C. BENNETT, E. BERNSTEIN, G. BRASSARD, and U. VAZIRANI: Strengths and weaknesses of quantum computing. SIAM J. Computing, 26(5):1510-1523, 1997. [SICOMP:30093, arXiv:quantph/9701001]. 1, 4, 6
9. 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. [PRL:10.1103/PhysRevLett.70.1895]. 1
10. C. H. BENNETT and J. GILL: Relative to a random oracle A, PA = NPA = coNPA with probability 1. SIAM J. Computing, 10(1):96-113, 1981. [SICOMP:10/0210008]. 11
11. S. N. BERNSTEIN: Sur l’ordre de la meilleure approximation des fonctions continues par les polynômes de degré donné. Mem. Cl. Sci. Acad. Roy. Belg., 4:1-103, 1912. French. 10
12. H. BUHRMAN, R. CLEVE, J. WATROUS, and R. DEWOLF: Quantum fingerprinting. Phys. Rev. Lett., 87(16), 2001. 4 pages. [PRL:10.1103/PhysRevLett.87.167902, arXiv:quant-ph/0102001]. 1, 6
13. H. BUHRMAN and R. DE WOLF: Complexity measures and decision tree complexity: a survey. Theoretical Computer Sci., 288:21-43, 2002. [TCS:10.1016/S0304-3975(01)00144-X]. 1
14. 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. In 14th Symp. Theoret. Aspects of Comp. Sci. (STACS), pp. 117-128, 1997. 2.1
15. H. EHLICH and K. ZELLER: Schwankung von Polynomen zwischen Gitterpunkten. Mathematische Zeitschrift, 86:41-44, 1964. 4
16. L. FORTNOW and J. ROGERS: Complexity limitations on quantum computation. J. Comput. Sys. Sci., 59(2):240-252, 1999. [JCSS:10.1006/jcss.1999.1651, arXiv:cs.CC/9811023]. 3.1
17. O. GOLDREICH: On quantum computing. 2004. 1 page. 1
18. Y. HAN, L. HEMASPAANDRA, and T. THIERAUF: Threshold computation and cryptographic security. SIAM J. Computing, 26(1):59-78, 1997. [SICOMP:24046]. 3.1
19. A. S. HOLEVO: Some estimates of the information transmitted by quantum communication channels. Problems of Information Transmission, 9:177-183, 1973. English translation. 1
20. H. KLAUCK: Quantum communication complexity. In 27th Int’l. Colloq. on Automata, Languages, and Programming (ICALP), pp. 241-252, 2000. [arXiv:quant-ph/0005032]. 1, 2.1, 3
21. H. KLAUCK: Quantum time-space tradeoffs for sorting. In 35th ACM STOC, pp. 69-76, 2003. [STOC:780542.780553, arXiv:quant-ph/0211174]. 1, 4, 9
22. H. KLAUCK, R. ŠPALEK, and R. DE WOLF: Quantum and classical strong direct product theorems and optimal time-space tradeoffs. In 45th IEEE FOCS, pp. 12-21, 2004. [FOCS:10.1109/FOCS.2004.52, arXiv:quant-ph/0402123]. 1, 4, 4, 10
23. E. KUSHILEVITZ and N. NISAN: Communication Complexity. Cambridge, 1997. 1
24. A. A. MARKOV: On a question by D. I. Mendeleev. Zapiski Imperatorskoi Akademii Nauk, SP6(62):1-24, 1890. Russian. English translation at http://www.math.technion.ac.il/hat/fpapers/markov4.pdf. 4
25. V. A. MARKOV: Über Polynome, die in einem gegebenen Intervalle möglichst wenig von Null abweichen. Math. Ann., 77:213-258, 1916. German. Originally written in 1892. 4
26. M. MINSKY and S. PAPERT: Perceptrons (2nd edition). MIT Press, 1988. First appeared in 1968. 4
27. A. NAYAK: Optimal lower bounds for quantum automata and random access codes. In 40th IEEE FOCS, pp. 369-377, 1999. [FOCS:10.1109/SFFCS.1999.814608, arXiv:quant-ph/9904093]. 1, 3
28. M. NIELSEN and I. CHUANG: Quantum Computation and Quantum Information. Cambridge University Press, 2000. 1, 2.3
29. N. NISAN and M. SZEGEDY: On the degree of Boolean functions as real polynomials. Computational Complexity, 4(4):301-313, 1994. 4, 4
30. H. NISHIMURA and T. YAMAKAMI: Polynomial time quantum computation with advice. Inform. Proc. Lett., 90:195-204, 2003. [IPL:10.1016/j.ipl.2004.02.005, ECCC:TR03-059,arXiv:quant-ph/0305100]. 6, 2.2
31. M. RABIN and A. C-C. YAO: Manuscript, cited in [38], 1979. 1, 5.1, 6
32. T. J. RIVLIN: Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. Wiley, 1990. 4, 4
33. 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. [SINUM:03/0703024]. 4
34. N. SAUER: On the density of families of sets. J. Combinatorial Theory Series A, 13:145-147, 1972. [JCombThA:10.1016/0097-3165(72)90019-2]. 1, 3
35. Y. SHI: Both Toffoli and controlled-NOT need little help to do universal quantum computation. Quantum Information and Computation, 3(1):84-92, 2002. [arXiv:quant-ph/0205115]. 3.1
36. J. WATROUS: Succinct quantum proofs for properties of finite groups. In 41st IEEE FOCS, pp. 537-546, 2000. [FOCS:10.1109/SFCS.2000.892141, arXiv:cs.CC/0009002]. 2.2
37. A. WINTER: Quantum and classical message identification via quantum channels. In O. Hirota, editor, Quantum Information, Statistics, Probability (A. S. Holevo festschrift), pp. 172-189. Rinton, 2004. [arXiv:quant-ph/0401060]. 2.1, 6
38. A. C-C. YAO: Some complexity questions related to distributive computing. In 11th ACM STOC, pp. 209-213, 1979. [STOC:804414]. 1, 31
39. A. C-C. YAO: Princeton University course assignment, 2001. 6
40. A. C-C. YAO: On the power of quantum fingerprinting. In 35th ACM STOC, pp. 77-81, 2003. [STOC:780542.780554, ECCC:TR02-074]. 1, 6