Nondeterministic quantum query and communication complexities

SIAM Journal on Computing

Volumn 32, Issue 3, 2003, Pages 681-699

  De Wolf, Ronald ^a  

^a CWI   (Netherlands)

Author keywords

Communication complexity; Nondeterminism; Quantum computing; Query complexity

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; ERROR ANALYSIS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; QUANTUM CRYPTOGRAPHY; QUERY LANGUAGES; THEOREM PROVING;

NONDETERMINISTIC POLYNOMIAL DEGREE; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM COMPUTING; QUANTUM QUERY COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0038600626     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702407345     Document Type: Article

References (54)

1. S. Aaronson, Quantum Certificate Complexity, http://arxiv.org/abs/quant-ph/0210020 (2 Oct2002); to appear in Proceedings of the 18th IEEE Conference on Computational Complexity, IEEE Computer Society, Los Alamitos, CA, 2003.
2. L. M. Adleman, J. Demarrais, and M. A. Huang, Quantum computability, SIAM J. Comput., 26 (1997), pp. 1524-1540.
3. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience, New York, 1992.
4. A. Ambainis, Quantum lower bounds by quantum arguments, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 636-643.
5. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson, The quantum communication complexity of sampling, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 342-351.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf, Quantum lower bounds by polynomials, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 352-361.
7. N. De Beaudrap, R. Cleve, and J. Watrous, Sharp quantum vs. classical query complexity separations, Algorithmica, 34 (2002), pp. 449-461.
8. R. Beigel, The polynomial method in circuit complexity, in Proceedings of the 8th IEEE Structure in Complexity Theory Conference, IEEE, New York, 1993, pp. 82-95.
9. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
10. G. Brassard, Personal communication via email, Université de Montréal, Canada, 2000.
11. G. Brassard, Quantum Communication Complexity (A Survey), http://arxiv.org/abs/quant-ph/0101005 (1 Jan 2001).
12. G. Brassard and P. Høyer, An exact quantum polynomial-time algorithm for Simon's problem, in Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, Ramat-Gan, Israel, 1997, pp. 12-23.
13. G. Brassard, P. Høyer, and A. Tapp, Quantum algorithm for the collision problem, ACM SIGACT News (Cryptology Column), 28 (1997), pp. 14-19.
14. G. Brassard, P. Høyer, and A. Tapp, Quantum counting, in Proceedings of the 25th ICALP, Lecture Notes in Comput. Sci. 1443, Springer-Verlag, New York, 1998, pp. 820-831.
15. H. Buhrman, Quantum computing and communication complexity, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 70 (2000), pp. 131-141.
16. H. Buhrman, R. Cleve, J. Watrous, and R. De Wolf, Quantum fingerprinting, Phys. Rev. Lett., 87 (2001), article 167902.
17. H. Buhrman, R. Cleve, and A. Wigderson, Quantum vs. classical communication and computation, in Proceedings of the 30th ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 63-68.
18. H. Burhman, R. Cleve, R. De Wolf, and Ch. Zalka, Bounds for small-error and zero-error quantum algorithms, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 358-368.
19. H. Buhrman and R. De Wolf, Communication complexity lower bounds by polynomials, in Proceedings of the 16th IEEE Conference on Computational Complexity, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 120-130.
20. H. Buhrman and R. De Wolf, Complexity measures and decision tree complexity: A survey, Theoret. Comput. Sci., 288 (2002), pp. 21-43.
21. R. Cleve and H. Buhrman, Substituting quantum entanglement for communication, Phys. Rev. A (3), 56 (1997), pp. 1201-1204.
22. D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439 (1992), pp. 553-558.
23. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, A limit on the speed of quantum computation in determining parity, Phys. Rev. Lett., 81 (1998), pp. 5442-5444.
24. S. Fenner, F. Green, S. Homer, and R. Pruim, Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy, in Proceedings of the 6th Italian Conference on Theoretical Computer Science, Prato, Italy, 1998, pp. 241-252.
25. L. Fortnow and J. Rogers, Complexity limitations on quantum computation, J. Comput. System Sci., 59 (1999), pp. 240-252.
26. L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 212-219.
27. H. Van Der Holst, L. Lovász, and A. Schrijver, The Colin de Verdière graph parameter, in Graph Theory and Combinatorial Biology, János Bolyai Mathematical Society, Budapest, 1999, pp. 29-85.
28. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
29. P. Høyer and R. De Wolf, Improved quantum communication complexity bounds for disjointness and equality, in Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2285, Springer-Verlag, New York, 2002, pp. 299-310.
30. A. Kitaev, A. Shen, and M. Vyalvi, Classical and Quantum Computation, AMS, Providence, RI, 2002.
31. A. Kitaev and J. Watrous, Parallelization, amplification, and exponential time simulation of quantum interactive proof systems, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 608-617.
32. A. Y. Kitaev, Quantum NP, talk given at the 2nd Workshop on Algorithms in Quantum Information Processing, DePaul University, Chicago, 1999.
33. H. Klauck, Quantum communication complexity, in Proceedings of the Workshop on Boolean Functions and Applications at the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, 2000, pp. 241-252.
34. H. Klauck, Lower bounds for quantum communication complexity, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 288-297.
35. I. Kremer, Quantum Communication, Master's thesis, Computer Science Department, Hebrew University, Jerusalem, Israel, 1995.
36. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
37. S. Massar, D. Bacon, N. Cerf, and R. Cleve, Classical simulation of quantum entanglement without local hidden variables, Phys. Rev. A (3), 63 (2001), article 052305.
38. C. Meinel and S. Waack, The "log rank" conjecture for modular communication complexity, in Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1046, Springer-Verlag, New York, 1996, pp. 619-630.
39. M. Minsky and S. Papert, Perceptrons, MIT Press, Cambridge, MA, 1968, 1988.
40. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
41. N. Nisan, CREW PRAMs and decision trees, SIAM J. Comput., 20 (1991), pp. 999-1007.
42. N. Nisan and M. Szegedy, On the degree of Boolean functions as real polynomials, Comput. Complexity, 4 (1994), pp. 301-313.
43. N. Nisan and A. Wigderson, On rank vs. communication complexity, Combinatorica, 15 (1995), pp. 557-565.
44. R. Raz, Exponential separation of quantum and classical communication complexity, in Proceedings of the 31st ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 358-367.
45. A. Razborov, On the distributional complexity of disjointness, Theoret. Comput. Sci., 106 (1992), pp. 385-390.
46. J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 27 (1980), pp. 701-717.
47. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
48. D. R. Simon, On the power of quantum computation, SIAM J. Comput., 26 (1997), pp. 1474-1483.
49. A. Ta-Shma, Classical versus quantum communication complexity, ACM SIGACT News (Complexity Column 23), 30 (1999), pp. 25-34.
50. R. De Wolf, Characterization of non-deterministic quantum query and quantum communication complexity, in Proceedings of the 15th IEEE Conference on Computational Complexity, IEEE Computer Society, Los Alamitos, CA, 2000, pp. 271-278.
51. R. De Wolf, Quantum communication and complexity, Theoret. Comput. Sci., 287 (2002), pp. 337-353.
52. C = co-C=P, Inform. Process. Lett., 71 (1999), pp. 63-69.
53. A. C.-C. Yao, Some complexity questions related to distributive computing, in Proceedings of the 11th ACM Symposium on Theory of Computing, ACM, New York, 1979, pp. 209-213.
54. A. C.-C. Yao, Quantum circuit complexity, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 352-360.