Quantum open system identification via global optimization: Optimally accurate Markovian models of open systems from time-series data
Not on the map. Why?
Abstract (arXiv)
Accurate models of the dynamics of quantum circuits are essential for optimizing and advancing quantum devices. Since first-principles models of environmental noise and dissipation in real quantum systems are often unavailable, deriving accurate models from measured time-series data is critical. However, identifying open quantum systems poses significant challenges: powerful methods from systems engineering can perform poorly beyond weak damping (as we show) because they fail to incorporate essential constraints required for quantum evolution (e.g., positivity). Common methods that can include these constraints are typically multi-step, fitting linear models to physically grounded master equations, often resulting in non-convex functions in which local optimization algorithms get stuck in local extrema (as we show). In this work, we solve these problems by formulating quantum system identification directly from data as a polynomial optimization problem, enabling the use of recently developed global optimization methods. These methods are essentially guaranteed to reach global optima, allowing us for the first time to efficiently obtain the most accurate Markovian model for a given system. In addition to its practical importance, this allows us to take the error of these Markovian models as an alternative (operational) measure of the non-Markovianity of a system. We test our method with the spin-boson model -- a two-level system coupled to a bath of harmonic oscillators -- for which we obtain the exact evolution using matrix-product-state techniques. We show that polynomial optimization using moment/sum-of-squares approaches significantly outperforms traditional optimization algorithms, and we show that even for strong damping Lindblad-form master equations can provide accurate models of the spin-boson system.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 1 of its 18 references that are in the map. First posted on arXiv 31 Mar 2022.
Builds on
1 of 18 references.
References · 1
- 2019TSSOS: A Moment-SOS hierarchy that exploits term sparsitycited by 14
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.
- 2024Learning quantum Hamiltonians at any temperature in polynomial time with Chebyshev and bit complexitycited by 0
- 2024Optimisation Strategies for Ensuring Fairness in Machine Learning: With and Without Demographicscited by 0
- 2026Quantum Port-Hamiltonian Neural Networks: Learning Conservative and Dissipative Dynamics via Measurement-Induced Nonlinearitycited by 0
- 2026Quantum Port-Hamiltonian Neural Networks: Learning Conservative and Dissipative Dynamics via Measurement-Induced Nonlinearity14 Jul 2026
- 2024Optimisation Strategies for Ensuring Fairness in Machine Learning: With and Without Demographics13 Nov 2024
- 2024Learning quantum Hamiltonians at any temperature in polynomial time with Chebyshev and bit complexity8 Feb 2024