Pith. sign in

REVIEW 1 cited by

Differentiable Quantum Computing for Large-scale Linear Control

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

arxiv 2411.01391 v1 pith:TNTSBGAK submitted 2024-11-03 quant-ph cs.ETcs.LGcs.NAmath.NAmath.OC

Differentiable Quantum Computing for Large-scale Linear Control

classification quant-ph cs.ETcs.LGcs.NAmath.NAmath.OC
keywords controlquantumalgorithmclassicaldifferentiableend-to-endgradientgrow
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations

    quant-ph 2025-08 conditional novelty 7.0

    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.