Quantum summation with an application to integration

Journal of Complexity

Volumn 18, Issue 1, 2002, Pages 1-50

  Heinrich, S ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036225247     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2001.0629     Document Type: Article

References (23)

1. "Fast Quantum Algorithms for Numerical Integrals and Stochastic Processes"
2. Quantum lower bounds by polynomials
3. Tight bounds on quantum searching
4. "Quantum Amplitude Amplification and Estimation"
5. Quantum counting
6. Basic concepts in quantum computation
7. A fast quantum mechanical algorithm for database search
8. A framework for fast quantum mechanical algorithms
9. "Quantum Computing"
10. Random approximation in numerical analysis
11. Quantum integration in Sobolev classes
12. Optimal summation and integration by deterministic, randomized, and quantum algorithms
13. On a problem in quantum summation
14. The quantum query complexity of approximating the median and related statistics
15. "Quantum Computation and Quantum Information"
16. "Deterministic and Stochastic Error Bounds in Numerical Analysis"
17. Quantum complexity of integration
18. "Introduction to Quantum Computing Algorithms"
19. "Convergence of Stochastic Processes"
20. Algorithms for quantum computation: Discrete logarithms and factoring
21. Quantum computing
22. Introduction to quantum algorithms
23. "Information-Based Complexity"