Randomized and quantum algorithms yield a speed-up for initial-value problems

DOI10.1016/j.jco.2004.05.002zbMath1073.68097arXivquant-ph/0311148OpenAlexW2033084728WikidataQ57636035 ScholiaQ57636035MaRDI QIDQ706788

Bolesław Kacewicz

Publication date: 9 February 2005

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

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

zbMATH Keywords

Randomized algorithmsQuantum algorithmsInitial-value problems

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20)

Related Items (12)

Randomized and quantum complexity of nonlinear two-point BVPs ⋮ Almost optimal solution of initial-value problems by randomized and quantum algorithms ⋮ A note on the probabilistic stability of randomized Taylor schemes ⋮ On the Complexity of Parametric ODEs and Related Problems ⋮ Turbulence theories and statistical closure approaches ⋮ Complexity of parametric initial value problems in Banach spaces ⋮ The randomized complexity of initial value problems ⋮ On the complexity of searching for a maximum of a function on a quantum computer ⋮ Complexity of initial-value problems for ordinary differential equations of order \(k\) ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to increase the order to get minimal-error algorithms for systems of ODE
• On sequential and parallel solution of initial value problems
• Minimum asymptotic error of algorithms for solving ODE
• 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: Randomized and quantum algorithms yield a speed-up for initial-value problems