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.
Quantum Algorithms for Nonlinear Dynamics: Revisiting Carleman Linearization with No Dissipative Conditions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.