Quantum approximation. II: Sobolev embeddings

DOI10.1016/j.jco.2003.08.003zbMath1082.68030arXivquant-ph/0305031OpenAlexW1963539121WikidataQ57636029 ScholiaQ57636029MaRDI QIDQ1883583

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/0305031

zbMATH Keywords

quantum computationnumerical problems

Mathematics Subject Classification ID

Quantum computation (81P68) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

Randomized and quantum complexity of nonlinear two-point BVPs ⋮ 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 ⋮ Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces ⋮ Quantum lower bounds by entropy numbers ⋮ 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 ⋮ On the representation of smooth functions on the sphere using finitely many bits ⋮ 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
• On a problem in quantum summation.
• Quantum integration in Sobolev classes
• Quantum summation with an application to integration.
• Equivalent Norms for Sobolev Spaces

This page was built for publication: Quantum approximation. II: Sobolev embeddings