For strictly dissipative linear ODEs, quantum solvers based on time-marching or LCHS achieve query complexity O(polylog(1/ε)) that is independent of the evolution time T.
Differentiable Quantum Computing for Large-scale Linear Control
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
As industrial models and designs grow increasingly complex, the demand for optimal control of large-scale dynamical systems has significantly increased. However, traditional methods for optimal control incur significant overhead as problem dimensions grow. In this paper, we introduce an end-to-end quantum algorithm for linear-quadratic control with provable speedups. Our algorithm, based on a policy gradient method, incorporates a novel quantum subroutine for solving the matrix Lyapunov equation. Specifically, we build a quantum-assisted differentiable simulator for efficient gradient estimation that is more accurate and robust than classical methods relying on stochastic approximation. Compared to the classical approaches, our method achieves a super-quadratic speedup. To the best of our knowledge, this is the first end-to-end quantum application to linear control problems with provable quantum advantage.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations
For strictly dissipative linear ODEs, quantum solvers based on time-marching or LCHS achieve query complexity O(polylog(1/ε)) that is independent of the evolution time T.