Quantum and classical strong direct product theorems and optimal time-space tradeoffs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 12-21

  Klauck, Hartmut ^a   Špalek, Robert ^b   De Wolf, Ronald ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN MATRIX-VECTOR MULTIPLICATION; CIRCUIT COMPLEXITY; QUANTUM COMPUTERS; QUANTUM QUERIES;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; ERROR ANALYSIS; MATRIX ALGEBRA; NETWORK PROTOCOLS; PROBABILITY; THEOREM PROVING; VECTORS;

QUANTUM THEORY;

EID: 17744376633     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. http://arxiv.org/abs/quant-ph/0402123.
2. S. Aaronson. Limitations of quantum advice and one-way communication. In Proc. of 19th Conf. on Computational Complexity, 2004. To appear, quant-ph/0402095.
3. S. Aaronson and A. Ambainis. Quantum search of spatial regions. In Proc. of 44th FOCS, pages 200-209, 2003. quant-ph/0303041.
4. K. Abrahamson. A time-space tradeoff for Boolean matrix multiplication. In Proc. of 31st FOCS, pages 412-419, 1990.
5. A. Ambainis. Quantum walk algorithm for element distinctness. These Proceedings, quant-ph/0311001.
6. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. of 27th FOCS, pages 337-347, 1986.
7. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001. Earlier version in FOCS'98, quant-ph/9802049.
8. P. Beame. A general sequential time-space tradeoff for finding unique elements. SIAM Journal on Computing, 20(2):270-277, 1991. Earlier version in STOC'89.
9. P. Beame, M. Tompa, and P. Yan. Communication-space tradeoffs for unrestricted protocols. SIAM Journal on Computing, 23(3):652-661, 1994. Earlier version in FOCS'90.
10. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4-5):493-505, 1998. Earlier version in Physcomp'96. quant-ph/9605034.
11. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of AMS Contemporary Mathematics Series, pages 53-74. 2002. quant-ph/0005055.
12. H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, 70:131-141, 2000.
13. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proc. of 30th STOC, pages 63-68, 1998. quant-ph/9802040.
14. H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka. Bounds for small-error and zero-error quantum algorithms. In Proc. of 40th FOCS, pages 358-368, 1999.cs.CC/9904019.
15. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. In Proc. of 16th Conf. on Computational Complexity, pages 131-137, 2001. quant-ph/0007016
16. H. Buhrman, I. Newman, H. Röhrig, and R. de Wolf. Robust quantum algorithms and polynomials, quant-ph/0309220, 2003.
17. H. Buhrman and R. Špalek. Quantum verification of matrix products. Manuscript, 2004.
18. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science, 288(1):21-43, 2002.
19. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proc. of 1st NASA QCQC conference, volume 1509 of LNCS, pages 61-74. Springer, 1998. quant-ph/9708019.
20. D. Coppersmith and T. J. Rivlin. The growth of polynomials bounded at equally spaced points. SIAM Journal on Mathematical Analysis, 23(4):970-983, 1992.
21. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical report, ECCC TR-95-050, 1995. Available at http://www.eccc.uni-trier.de/eccc/.
22. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. of 28th STOC, pages 212-219, 1996. quant-ph/9605043.
23. P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality. In Proc. of 19th STAGS, LNCS 2285, pages 299-310. Springer, 2002. quant-ph/0109068.
24. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5(4):545-557, 1992. Earlier version in Structures'87.
25. H. Klauck. Quantum communication complexity. In Workshop on Boolean Functions and Applications at 27th ICALP, pages 241-252, 2000. quant-ph/0005032.
26. H. Klauck. Quantum time-space tradeoffs for sorting. In Proc. of 35th STOC, pages 69-76, 2003. quant-ph/0211174.
27. H. Klauck. Quantum and classical communication-space tradeoffs from rectangle bounds. Manuscript, 2004.
28. D. E. Knuth. Combinatorial matrices. In Selected Papers on Discrete Mathematics, volume 106 of CSLI Lecture Notes. Stanford University, 2003.
29. I. Kremer. Quantum communication. Master's thesis, Hebrew University, Computer Science Depart., 1995.
30. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
31. T. Lam, P. Tiwari, and M. Tompa. Trade-offs between communication and space. Journal of Computer and Systems Sciences, 45(3):296-315, 1992. Earlier version in STOC'89.
32. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
33. N. Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999-1007, 1991. Earlier version in STOC'89.
34. N. Nisan, S. Rudich, and M. Saks. Products and help bits in decision trees. In Proc. of 35th FOCS, pages 318-329, 1994.
35. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4(4):301-313, 1994. Earlier version in STOC'92.
36. I. Parnafes, R. Raz, and A. Wigderson. Direct product results and the GCD problem, in old and new communication models. In Proc. of 29th STOC, pages 363-372, 1997.
37. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions. In Proc. of 24th STOC, pages 468-474, 1992.
38. A. Razborov. On the distributional complexity of disjoint ness. Theoretical Computer Science, 106(2):385-390, 1992.
39. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, 67(1):159-176, 2003. quant-ph/0204025.
40. T. J. Rivlin. Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. Wiley-Interscience, second edition, 1990.
41. R. Shaltiel. Towards proving strong direct product theorems. In Proc. of 16th Conf. on Computational Complexity, pages 107-119, 2001.
42. R. de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):337-353, 2002.
43. A.C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proc. of 18th FOCS, pages 222-227, 1977.
44. A. C.-C. Yao. Theory and applications of trapdoor functions. In Proc. of 23rd FOCS, pages 80-91, 1982.
45. A. C.-C. Yao. Quantum circuit complexity. In Proc. of 34th FOCS, pages 352-360, 1993.