| name | quantum-linear-differential-equation |
| description | Nearly optimal quantum algorithm for linear matrix differential equations with applications to open quantum systems. Achieves O~(nu*L*t/epsilon) query complexity for unitary/dissipative dynamics, with polynomial to exponential quantum speedups over classical methods. Activation: quantum differential equation, open quantum system simulation, dissipative dynamics quantum, linear matrix ODE quantum, quantum time evolution algorithm. |
Quantum Linear Matrix Differential Equation Solver
Nearly optimal quantum algorithm for solving linear matrix differential equations with O~(nuLt/epsilon) query complexity, achieving polynomial to exponential speedups for dissipative dynamics and open quantum system simulation. (arXiv:2605.16195)
Metadata
- Source: arXiv:2605.16195
- Authors: Sophia Simon, Dominic W. Berry, Rolando D. Somma
- Published: 2026-05-15
- Categories: quant-ph
Core Methodology
Key Innovation
First efficient quantum algorithm for linear matrix differential equations that avoids the exponential-time bottleneck of prior approaches. Unlike methods that encode the solution in a quantum state (leading to exponentially small amplitudes), this algorithm computes entries of the solution matrix directly, with query complexity linear in time t for unitary dynamics and constant for dissipative dynamics.
Complexity Analysis
The algorithm achieves query complexity: O~(nu * L * t / epsilon)
- nu: Problem-dependent constant (related to norms of evolution operators)
- L: Time integral of upper bounds on evolution operator norms
- t: Evolution time
