A lower bound on the quantum query complexity of read-once functions
暂无分享,去创建一个
[1] Miklos Santha. On the Monte Carlo Boolean decision tree complexity of read-once formulae , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[2] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[3] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[4] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[5] Noam Nisan,et al. On the degree of boolean functions as real polynomials , 1992, STOC '92.
[6] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[7] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[8] Mario Szegedy,et al. Quantum Decision Trees and Semidefinite Programming. , 2001 .
[9] Peter W. Shor,et al. Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[10] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[11] Richard Cleve,et al. The query complexity of order-finding , 1999, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[12] Michael E. Saks,et al. Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[14] Andris Ambainis,et al. Quantum lower bounds by quantum arguments , 2000, STOC '00.
[15] Jan Neerbek,et al. Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2001, ICALP.
[16] Lov K. Grover. How fast can a quantum computer search , 1998 .