Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces

DOI10.1016/j.jco.2003.08.002zbMath1072.68039arXivquant-ph/0305030OpenAlexW2023347923WikidataQ57636030 ScholiaQ57636030MaRDI QIDQ1883582

Stefan Heinrich

Publication date: 13 October 2004

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

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

Mathematics Subject Classification ID

Related Items (12)

Randomized and quantum complexity of nonlinear two-point BVPs ⋮ Quantum complexity of parametric integration ⋮ The quantum setting with randomized queries for continuous problems ⋮ A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer ⋮ The quantum query complexity of elliptic PDE ⋮ Quantum lower bounds by entropy numbers ⋮ The randomized information complexity of elliptic PDE ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ On the complexity of a two-point boundary value problem in different settings ⋮ Optimal query error of quantum approximation on some Sobolev classes ⋮ Lower bound for quantum phase estimation ⋮ Improved bounds on the randomized and quantum complexity of initial-value problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic and stochastic error bounds in numerical analysis
• On a problem in quantum summation.
• Quantum integration in Sobolev classes
• Quantum summation with an application to integration.
• From Monte Carlo to quantum computation
• Sharp error bounds on quantum Boolean summation in various settings
• The quantum query complexity of approximating the median and related statistics
• Geometric quantum computation
• Convergence of stochastic processes
• Quantum complexity of integration

This page was built for publication: Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces