arXiv:2609.28999
On the numerical limitations of dual Koopman von Neumann embeddings for solving conservative nonlinear ordinary differential equations on quantum computers
Thibault Fredon, Abhay K. Ram, Fabrice Debbasch, Julien Zylberman, Nuno F. Loureiro
Abstract
The simulation of nonlinear ordinary differential equations on quantum computers is inherently challenging, as quantum gates are linear operators on qubit states. In this paper, we put forth a Koopman-von Neumann (KvN) operator based algorithm for solving nonlinear ordinary differential equations on a quantum computer which overcomes the innate limitations of quantum operations. In this approach, a Liouville probability density is embedded into a wavefunction, the evolution of which is governed by an operator dual to the Koopman operator. The trajectories corresponding to the nonlinear differential equations are reconstructed from the average value of Koopman observables evaluated through quantum measurements. We specifically evaluate the computational limitations of solving nonlinear equations within this Liouville embedding framework. An Ehrenfest-type estimate is derived that relates the reconstruction error to the covariance of the transported density, highlighting the competition between linear stretching and Hessian-induced folding.This leads to a key stability criterion, which depends on the local Ehrenfest-Reynolds number. We discuss the effects of measurement-induced errors including those due to Hadamard-test sampling, amplitude estimation, and bias due to covariance in probabilistic Grover-type inference on the evaluation of trajectories. The limiting bounds on the accuracy of quantum computations are numerically verified for the Lotka-Volterra system and for the quartic oscillator. We observe a rapid growth in computational errors when the Ehrenfest-Reynolds number approaches the predicted threshold. The bounds resulting from our analysis provide key guidelines for selecting the width of the initial Gaussian probability distribution associated with a system of nonlinear ordinary differential equations.
AI Summary
The paper studies when quantum Koopman–von Neumann/Liouville embeddings can reconstruct individual trajectories of conservative nonlinear ODEs from a transported probability density. It encodes $\sqrt{\rho}$ as quantum amplitudes, evolves it with an existing finite-difference, Trotterized transport algorithm, and reconstructs coordinates through expectation values. The implementation assumes $\partial_{x_i}F_i=0$ for every component, a stronger condition than divergence-freeness. The analysis separates trajectory drift from finite-width bias: the Jacobian amplifies mismatch, while the vector-field Hessian couples covariance to the reconstructed mean. Under approximately Gaussian, second-order moment closure and constant covariance, it obtains $\epsilon(t)\lesssim e^{L\tau}\epsilon_0+\sigma_F R(e^{L\tau}-1)$, where $\tau=t-t_0$, $\sigma_F^2=\|\Sigma\|_F/\sqrt d$, and $R=\sqrt d\,\sigma_F H/(2L)$; $L$ and $H$ bound Jacobian and Hessian magnitudes. Balancing the two error contributions and requiring roughly ten grid points across the initial width motivates the heuristic criterion $R\lesssim0.1$. Allowing covariance growth gives a more restrictive, exponentially time-dependent condition. Classical numerical tests on Lotka–Volterra dynamics and a quartic oscillator use nine qubits per coordinate, sixth-order spatial differences, and time step $10^{-3}$. They associate quartic-oscillator phase mixing and covariance growth with increasing reconstruction error; the analytical bound substantially overestimates its magnitude. Readout analysis discusses $O(\epsilon^{-2})$ sampling, $O(\epsilon^{-1})$ amplitude-estimation scaling, and finite-spread corrections. Stated limitations include Gaussian and short-time closure assumptions, neglected higher moments, an arbitrary resolution threshold, and the trade-off between narrow initialization and grid under-resolution. Dissipative systems require different constructions.
Central claim may not hold: The explicit reconstruction bounds are presented as inequalities even though their derivations discard uncontrolled remainder terms, including in the alternative covariance-growth argument. The geometrical stability criterion omits the initial displacement from its trajectory-difference expansion, making its normalized left-hand side equal to 1 at zero time rather than vanish. For Lotka–Volterra dynamics on the stated domain, the supplied definitions give R/σ=1/√2 rather than the reported γ/β≈2.29. The quartic benchmark has inconsistent reported Gaussian widths, and its stated grid cannot simultaneously meet the paper's resolution requirement and reported admissible-width threshold. The covariance-dependent sampling cost claimed for the Hadamard test incorrectly substitutes coordinate variance for the measured ancilla's Bernoulli variance.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 10 pages, 5 figures, 7 pages of supplemental materials