REVIEW 9 cited by
Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The solution of large systems of nonlinear differential equations is needed for many applications in science and engineering. In this study, we present three main improvements to existing quantum algorithms based on the Carleman linearisation technique. First, by using a high-precision technique for the solution of the linearised differential equations, we achieve logarithmic dependence of the complexity on the error and near-linear dependence on time. Second, we demonstrate that a rescaling technique can considerably reduce the cost, which would otherwise be exponential in the Carleman order for a system of ODEs, preventing a quantum speedup for PDEs. Third, we provide improved, tighter bounds on the error of Carleman linearisation. We apply our results to a class of discretised reaction-diffusion equations using higher-order finite differences for spatial resolution. We show that providing a stability criterion independent of the discretisation can conflict with the use of the rescaling due to the difference between the max-norm and 2-norm. An efficient solution may still be provided if the number of discretisation points is limited, as is possible when using higher-order discretisations.
Forward citations
Cited by 9 Pith papers
-
Provable Quantum Speedups for Reaction-Rate Estimation in High-Dimensional Fokker-Planck Dynamics
A quantum algorithm estimates Fokker-Planck reaction rates with sublinear-time, polynomial-in-particle-number cost, giving an exponential-in-particle-number separation from the sharpest classical worst-case Langevin bounds.
-
Quantum simulation of non-Markovian dynamical systems
Quantum algorithms simulate linear Volterra integro-differential equations exponentially faster in system size when memory is weak (M<1), with a matching hardness result for strong memory and efficient handling of sum...
-
Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
New Lyapunov, conserved-quantity, and nonresonance-based criteria make quantum Carleman simulation provably convergent for stable, conservative, and nonresonant nonlinear ODEs, and yield BQP-complete nonlinear oscilla...
-
Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections
Adding a fast-forwardable penalty projection to the generator of a quantum-simulated ODE enforces boundary conditions up to error ε, with gate complexity overhead O(log λ).
-
Quantum-Accelerated Solution of Nonlinear Equations from Variational Principles
Nonlinear equilibrium problems can be solved on quantum computers by simulating a gradient-flow ODE linearized by Carleman or Pivot Switching Carleman methods.
-
Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schr\"odingerization
A quantum algorithm pipeline is proposed that maps forced, nonlinear, and time-dependent oscillator networks to nonlinear Schrodinger equations and then to Hermitian Hamiltonian simulation, claiming near-linear time c...
-
State-Based Quantum Simulation: Releasing the Powers of Quantum States and Copies
State-based quantum simulation replaces gate decompositions with state decompositions and copy-aided controlled-swap steps, enabling simulation of state-dependent, nonlinear, and open-system dynamics.
-
Learning with springs and sticks
A damped spring-and-stick lattice performs regression by energy relaxation, and a reported 'thermodynamic learning barrier' sets the minimum free energy needed for learning.
-
Addressing the Readout Problem in Quantum Differential Equation Algorithms with Quantum Scientific Machine Learning
Quantum neural networks can classify shock and turbulent flow solutions encoded as quantum states, with accuracy strongly dependent on Fourier versus real-space basis choice.
Discussion (0). Continue with ORCID to comment.