Pivot-shifted Carleman linearization with Lyapunov transform enables logarithmic truncation and removes initial-condition lower bounds for quantum simulation of a broader class of nonlinear ODEs.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Quantum Koopman Algorithms define an observable-space quantum framework for simulating linear quantum and nonlinear classical dynamics with polylog gate costs in some cases.
Duplicate-aware shift-and-lift Carleman linearization with moving centers reduces monomial duplication overhead and improves local validity along trajectories compared to standard Jacobian linearization on bilinear and logistic benchmarks.
citing papers explorer
-
Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization
Pivot-shifted Carleman linearization with Lyapunov transform enables logarithmic truncation and removes initial-condition lower bounds for quantum simulation of a broader class of nonlinear ODEs.
-
Quantum Koopman Algorithms
Quantum Koopman Algorithms define an observable-space quantum framework for simulating linear quantum and nonlinear classical dynamics with polylog gate costs in some cases.
-
Duplicate-Aware Shift-and-Lift Carleman Linearization:Structure, Complexity, and Comparative Evaluation
Duplicate-aware shift-and-lift Carleman linearization with moving centers reduces monomial duplication overhead and improves local validity along trajectories compared to standard Jacobian linearization on bilinear and logistic benchmarks.