The power of various real-valued quantum queries

Journal of Complexity

Volumn 20, Issue 5, 2004, Pages 699-712

  Bessen, Arvid J ^a,b  

^a University of Koblenz Landau   (Germany)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4444381358     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jco.2003.07.001     Document Type: Article

References (13)

1. D.S. Abrams, C.P. Wiliams, Fast quantum algorithms for numerical integrals and stochastic processes, Technical report, NASA Jet Propulsion Laboratory, 1999, http://arXiv.org/abs/quant-ph/9908083
2. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, in: Proceedings of the 39th IEEE Conference on Foundations of Computer Science (FOCS), Palo Alto, CA, 1998, pp. 352-361, http://arXiv.org/abs/quant-ph/9802049
3. G. Brassard, P. Høyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, http://arXiv.org/abs/quant-ph/0005055, 2000.
4. Cheney E.W. Introduction to Approximation Theory 1966 McGraw-Hill Book Company New York
5. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), Philadelphia, PA, 1996, pp. 212-219, http://arXiv.org/abs/quant-ph/9605043
6. Heinrich S. Quantum Summation with an application to integration J. Complexity 18 1 2002 1-50 http://arXiv.org/abs/quant-ph/0105116
7. A. Nayak, F. Wu, The quantum query complexity of approximating the median and related statistics, in: Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC), Atlanta, GA, 1999, pp. 384-393, http://arXiv.org/abs/quant-ph/9804066
8. Nielsen M.A. Chuang I.L. Quantum Computation and Quantum Information 2000 Cambridge University Press Cambridge
9. Nikol'skii S.M. Approximation of Functions of Several Variables and Imbedding Theorems 1975 Springer Berlin
10. Novak E. Quantum complexity of integration J. Complexity 17 2001 2-16 http://arXiv.org/abs/quant-ph/0008124
11. Rivlin T.J. The Chebyshev Polynomials 1974 Wiley New York
12. Traub J.F. Wasilkowski G.W. Woźniakowski H. Information-Based Complexity 1988 Academic Press New York
13. Traub J.F. Werschulz A.G. Complexity and Information 1998 Cambridge University Press Cambridge