REVIEW 4 cited by
Quantum open system identification via global optimization: Optimally accurate Markovian models of open systems from time-series data
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
read the original abstract
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.
Forward citations
Cited by 4 Pith papers
-
Quantum Port-Hamiltonian Neural Networks: Learning Conservative and Dissipative Dynamics via Measurement-Induced Nonlinearity
Q-pHNNs learn classical conservative and dissipative dynamics by mapping the port-Hamiltonian J matrix to unitary gates and the R matrix to mid-circuit measurement nonlinearity, enforcing structure by construction.
-
Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
The authors prove that arrow decomposition can be applied after forming moment-SOS relaxations of polynomial matrix inequalities, yielding convergent lower bounds and significant computational speedups in structural o...
-
Optimisation Strategies for Ensuring Fairness in Machine Learning: With and Without Demographics
A thesis combining fairness-aware forecasting via non-commutative polynomial optimization with a group-blind optimal-transport bias-repair method that needs only population-level group distributions.
-
Identifiability of Autonomous and Controlled Open Quantum Systems
The paper derives identifiability criteria for time-independent GKSL open quantum systems by mapping their measurement dynamics onto classical linear and bilinear dynamical systems and inverting the parameter map.
Discussion (0). Continue with ORCID to comment.