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.
Optimal scaling quantum linear-systems solver via discrete adiabatic theorem.PRX quantum, 3(4):040303, 2022
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.
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.
-
Logical Resource Estimation for Quantum State Preparation with Compilation
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.