Quantum complexity of integration

DOI10.1006/jcom.2000.0566zbMath0974.68062arXivquant-ph/0008124OpenAlexW2008891665WikidataQ57636023 ScholiaQ57636023MaRDI QIDQ5938578

Erich Novak

Publication date: 23 July 2001

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0008124

zbMATH Keywords

quantum computers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (30)

From Monte Carlo to quantum computation ⋮ Randomized and quantum complexity of nonlinear two-point BVPs ⋮ Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces ⋮ Quantum complexity of parametric integration ⋮ Sharp error bounds on quantum Boolean summation in various settings ⋮ The power of various real-valued quantum queries ⋮ The quantum setting with randomized queries for continuous problems ⋮ The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries ⋮ A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer ⋮ The quantum query complexity of elliptic PDE ⋮ What can quantum computers do? ⋮ A fast algorithm for approximating the ground state energy on a quantum computer ⋮ On a problem in quantum summation. ⋮ Quantum integration in Sobolev classes ⋮ Some Results on the Complexity of Numerical Integration ⋮ Random bit quadrature and approximation of distributions on Hilbert spaces ⋮ Quantum lower bounds by entropy numbers ⋮ On the complexity of the multivariate Sturm-Liouville eigenvalue problem ⋮ Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms ⋮ Lower bound for quantum integration error on anisotropic Sobolev classes ⋮ On the quantum and randomized approximation of linear functionals on function spaces ⋮ On the complexity of searching for a maximum of a function on a quantum computer ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ Random bit multilevel algorithms for stochastic differential equations ⋮ Optimal query error of quantum approximation on some Sobolev classes ⋮ Lower bound for quantum phase estimation ⋮ Classical and quantum complexity of the Sturm-Liouville eigenvalue problem ⋮ Improved bounds on the randomized and quantum complexity of initial-value problems ⋮ Solving Burgers' equation with quantum computing ⋮ Quantum summation with an application to integration.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic and stochastic error bounds in numerical analysis
• The real number model in numerical analysis
• The quantum query complexity of approximating the median and related statistics
• The Monte Carlo Algorithm with a Pseudorandom Generator
• Numerical Evaluation of Multiple Integrals
• Quantum computing

This page was built for publication: Quantum complexity of integration