A Note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions

Quantum Information and Computation

Volumn 8, Issue 10, 2008, Pages 0943-0950

  De wolf, Ronald ^a  

^a CWI   (Netherlands)

Author keywords

Approximating polynomials; Probability theory; Quantum algorithms; Quantum proof; Symmetric functions

Indexed keywords

BOOLEAN FUNCTIONS; PROBABILITY; QUANTUM THEORY;

APPROXIMATING POLYNOMIALS; PROBABILITY THEORY; QUANTUM ALGORITHMS; QUANTUM PROOF; SYMMETRIC FUNCTIONS;

POLYNOMIALS;

EID: 65549121771     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. S. Aaronson. Lower bounds for local search by quantum arguments. In Proceedings of 35th ACM STOC, pages 465-474, 2003. quant-ph/0307149.
2. S. Aaronson. Quantum computing, postselection, and probabilistic polynomial-time. In Proceedings of the Royal Society, volume A461(2063), pages 3473-3482, 2005. quant-ph/0412187.
3. D. Aharonov and O. Regev. A lattice problem in quantum NP. In Proceedings of 44th IEEE FOCS, pages 210-219, 2003. quant-ph/0307220.
4. D. Aharonov and O. Regev. Lattice problems in NP ∩ coNP. In Proceedings of 45th IEEE FOCS, pages 362-371, 2004.
5. 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.
6. R. Beigel. The polynomial method in circuit complexity. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, pages 82-95, 1993.
7. R. Beigel. Perceptrons, PP, and the polynomial hierarchy. Computational Complexity, 4:339-349, 1994.
8. R. Beigel, N. Reingold, and D. Spielman. PP is closed under intersection. Journal of Computer and System Sciences, 50(2):191-202, 1995.
9. 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.
10. H. Buhrman, R. Cleve, R. de Wolf, and Ch. Zalka. Bounds for small-error and zero-error quantum algorithms. In Proceedings of 40th IEEE FOCS, pages 358-368, 1999. cs.CC/9904019.
11. H. Buhrman and R. deWolf. Communication complexity lower bounds by polynomials. In Proceedings of 16th IEEE Conference on Computational Complexity, pages 120-130, 2001. cs.CC/9910010.
12. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science, 288(1):21-43, 2002.
13. 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.
14. L. Fortnow and J. Rogers. Complexity limitations on quantum computation. Journal of Computer and System Sciences, 59(2):240-252, 1999. Earlier version in Complexity'98. Also cs.CC/9811023.
15. M. de Graaf and R. de Wolf. On quantum versions of the Yao principle. In Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2002), volume 2285 of Lecture Notes in Computer Science, pages 347-358. Springer, 2002. quant-ph/0109070.
16. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th ACM STOC, pages 212-219, 1996. quant-ph/9605043.
17. J. Kahn, N. Linial, and A. Samorodnitsky. Inclusion-exclusion: Exact and approximate. Combinatorica, 16(4):465-477, 1996.
18. I. Kerenidis. Quantum multiparty communication complexity and circuit lower bounds. In Proceedings of 4th Annual Conference on Theory and Applications of Models of Computation (TAMC), volume 4484 of Lecture Notes in Computer Science, pages 306-317. Springer, 2007. quant-ph/0504087.
19. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. Journal of Computer and System Sciences, 69(3):395-420, 2004. Special issue on STOC'03. quant-ph/0208062.
20. S. Laplante, T. Lee, and M. Szegedy. The quantum adversary method and classical formula size lower bounds. In Proceedings of 20th IEEE Conference on Computational Complexity, pages 76-90, 2005. quant-ph/0501057.
21. T. Lee and A. Shraibman. Disjointness is hard in the multi-party number-on-the-forehead model. In Proceedings of 23rd IEEE Conference on Computational Complexity, 2008. arXiv:0712.4279.
22. N. Linial and N. Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349-365, 1990. Earlier version in STOC'90.
23. R. Lipton, E. Markakis, A. Mehta, and N. Vishnoi. On the Fourier spectrum of symmetric Boolean functions with applications to learning symmetric juntas. In Proceedings of 20th IEEE Conference on Computational Complexity, pages 112-119, 2005.
24. M. Minsky and S. Papert. Perceptrons . MIT Press, Cambridge, MA, 1968. Second, expanded edition 1988.
25. E. Mossel, R. O'Donnell, and R. Servedio. Learning functions of k relevant variables. Journal of Computer and System Sciences, 69(3):421-434, 2004. Earlier version in STOC'03.
26. 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.
27. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions. In Proceedings of 24th ACM STOC, pages 468-474, 1992.
28. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕} . Mathematical notes of the Academy of Science of the USSR, 41(4):333-338, 1987.
29. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences, mathematics, 67(1):159-176, 2003. quant-ph/0204025.
30. T. J. Rivlin. Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory . Wiley-Interscience, second edition, 1990.
31. A. Sherstov. Approximate inclusion-exclusion for arbitrary symmetric functions. In Proceedings of 23rd IEEE Conference on Computational Complexity, 2008.
32. A. Sherstov. The pattern matrix method for lower bounds on quantum communication. In Proceedings of 40th ACM STOC, 2008.
33. R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of 19th ACM STOC, pages 77-82, 1987.
34. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865- 877, 1991.
35. S. Wehner and R. de Wolf. Improved lower bounds for locally decodable codes and private information retrieval. In Proceedings of 32nd ICALP, volume 3580 of Lecture Notes in Computer Science, pages 1424-1436, 2005. quant-ph/0403140.
36. R. de Wolf. Lower bounds on matrix rigidity via a quantum argument. In Proceedings of 33rd ICALP, volume 4051 of Lecture Notes in Computer Science, pages 62-71, 2006. quant-ph/0505188.