Improved bounds on the randomized and quantum complexity of initial-value problems

DOI10.1016/J.JCO.2005.05.003zbMath1082.65069arXivquant-ph/0405018OpenAlexW1980991123WikidataQ57636034 ScholiaQ57636034MaRDI QIDQ2576279

Bolesław Kacewicz

Publication date: 27 December 2005

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

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

zbMATH Keywords

algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20)

Related Items (10)

The quantum setting with randomized queries for continuous problems ⋮ Almost optimal solution of initial-value problems by randomized and quantum algorithms ⋮ A note on the probabilistic stability of randomized Taylor schemes ⋮ Turbulence theories and statistical closure approaches ⋮ Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients ⋮ The randomized complexity of initial value problems ⋮ On the complexity of searching for a maximum of a function on a quantum computer ⋮ Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions ⋮ Complexity of initial-value problems for ordinary differential equations of order \(k\) ⋮ Solving Burgers' equation with quantum computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to increase the order to get minimal-error algorithms for systems of ODE
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• Deterministic and stochastic error bounds in numerical analysis
• Quantum summation with an application to integration.
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Quantum approximation. II: Sobolev embeddings
• The quantum query complexity of approximating the median and related statistics
• Quantum complexity of integration

This page was built for publication: Improved bounds on the randomized and quantum complexity of initial-value problems