Almost optimal solution of initial-value problems by randomized and quantum algorithms
From MaRDI portal
Abstract: We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.
Recommendations
- Improved bounds on the randomized and quantum complexity of initial-value problems
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- The randomized complexity of initial value problems
- Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k
- Complexity of initial-value problems for ordinary differential equations of order k-different models of computation
Cites work
- scientific article; zbMATH DE number 1790425 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Improved bounds on the randomized and quantum complexity of initial-value problems
- Optimal solution of ordinary differential equations
- Quantum summation with an application to integration.
- Randomized and quantum algorithms yield a speed-up for initial-value problems
Cited in
(48)- Error analysis of randomized Runge-Kutta methods for differential equations with time-irregular coefficients
- On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients
- Randomized Runge-Kutta method -- stability and convergence under inexact information
- On the randomized Euler schemes for ODEs under inexact information
- Solving Burgers' equation with quantum computing
- Complexity of parametric initial value problems for systems of odes
- Turbulence theories and statistical closure approaches
- Complexity of parametric initial value problems in Banach spaces
- Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm
- Quantum lower bounds by entropy numbers
- The randomized complexity of initial value problems
- Improved bounds on the randomized and quantum complexity of initial-value problems
- On the optimal robust solution of IVPs with noisy information
- On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes
- Randomized and quantum complexity of nonlinear two-point BVPs
- Complexity of initial value problems in Banach spaces
- On the complexity of a two-point boundary value problem in different settings
- Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
- Complexity of initial-value problems for ordinary differential equations of order k-different models of computation
- Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k
- Optimal solution of a class of non-autonomous initial-value problems with unknown singularities
- Optimality proofs of quantum weight decision algorithms
- On the complexity of parametric ODEs and related problems
- Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
- Solving systems of IVPs with discontinuous derivatives-numerical experiments
- Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface
- On the randomized solution of initial value problems
- On the quantum and randomized approximation of linear functionals on function spaces
- Existence, uniqueness and approximation of solutions to Carathéodory delay differential equations
- A note on the probabilistic stability of randomized Taylor schemes
- Mathematical analysis of a randomized method for fractional Carathéodory type equation with time-irregular coefficients
- A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation
- Simulating nonlinear radiation diffusion through quantum computing
- Optimal global approximation of SDEs with time-irregular coefficients in asymptotic setting
- Classical-quantum simulation of single and multiple solitons generated from the KdV equation
- Linearized quantum lattice-Boltzmann method for the advection-diffusion equation using dynamic circuits
- Implementation of spectral methods on Ising machines: toward flow simulations on quantum annealers
- The randomized Milstein scheme for stochastic Volterra integral equations with weakly singular kernels
- Unadjusted Hamiltonian MCMC with stratified Monte Carlo time integration
- On solving for shocks and travelling waves using a quantum algorithm
- Boundary treatment for variational quantum simulations of partial differential equations on quantum computers
- Reduced-order modeling on a near-term quantum computer
- Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems
- Convergence and stability of randomized implicit two-stage Runge-Kutta schemes
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- Quantum solving and circuits implementation for partial differential equations via linear combination of Hamiltonian simulations
- The quantum query complexity of elliptic PDE
- Optimal adaptive solution of initial-value problems with unknown singularities
This page was built for publication: Almost optimal solution of initial-value problems by randomized and quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855897)
