REVIEW 5 cited by
Challenges for quantum computation of nonlinear dynamical systems using linear representations
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
A number of recent studies have proposed that linear representations are appropriate for solving nonlinear dynamical systems with quantum computers, which fundamentally act linearly on a wave function in a Hilbert space. Linear representations, such as the Koopman representation and Koopman von Neumann mechanics, have regained attention from the dynamical-systems research community. Here, we aim to present a unified theoretical framework, currently missing in the literature, with which one can compare and relate existing methods, their conceptual basis, and their representations. We also aim to show that, despite the fact that quantum simulation of nonlinear classical systems may be possible with such linear representations, a necessary projection into a feasible finite-dimensional space will in practice eventually induce numerical artifacts which can be hard to eliminate or even control. As a result, a practical, reliable and accurate way to use quantum computation for solving general nonlinear dynamical systems is still an open problem.
Forward citations
Cited by 5 Pith papers
-
Measure-free Koopman-von Neumann Dynamics and Noncommutative Geometry
A new Koopman-von Neumann framework uses reproducing kernel Hilbert spaces and symmetric Fock space dilations to represent non-unitary classical evolution unitarily, without choosing a volume measure on the state space.
-
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...
-
A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer
LCNU loading plus multigrid-warmed VQLS solves Carleman-linearized 1D Burgers on quantum hardware/simulators, with circuits scaling to 2^80 points.
-
A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics
A recursive quantum time-marching circuit for a second-order Lorenz discretization uses a linear number of initial-state copies but an exponential number of operations and exponentially small postselection probability.
-
A Quantum Path to Partial Differential Equations
Lecture notes that organize quantum PDE algorithms around block encodings of finite-difference and finite-element operators, tracking discretization, preparation, normalization, postselection, and measurement costs.
Discussion (0). Continue with ORCID to comment.