Pith. sign in

REVIEW 4 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

arxiv 2312.09518 v1 pith:KGKBOA75 submitted 2023-12-15 quant-ph math-phmath.MP

classification quant-phmath-phmath.MP
keywords equationscarlemandifferentialhigher-orderquantumrescalingsolutiontechnique
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Provable Quantum Speedups for Reaction-Rate Estimation in High-Dimensional Fokker-Planck Dynamics

    quant-ph 2026-01 conditional novelty 8.0 of 10

    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.

  2. Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections

    quant-ph 2025-06 conditional novelty 7.0 of 10

    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 λ).

  3. Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schr\"odingerization

    quant-ph 2025-05 reject novelty 6.0 of 10

    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...

  4. Learning with springs and sticks

    cs.LG 2025-08 conditional novelty 5.0 of 10

    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.

Pith tools