arXiv:2609.40214
Quantum Markov State Models for Metastable Dynamics
Hao-En Li, Lin Lin, Michael Ragone
Abstract
Open quantum systems can rapidly lose most microscopic information, leaving only a few degrees of freedom to govern their long-time dynamics. Classical Markov state models (MSMs) describe such metastable dynamics as transitions among a few representative phases and are widely used to reduce complex-system dynamics in condensed matter and chemical physics. In quantum systems, however, phase labels alone are insufficient when coherence persists between metastable states. Even when the slow modes are known, their spectral projection need not produce valid quantum states. We construct quantum Markov state models (QMSMs) that describe the surviving information and its evolution on a small physical state space containing classical sectors and quantum matrix blocks. We quantify metastability by assuming that the evolution channel $\mathcal C$ changes little when applied a second time, with sufficiently small defect $η=\|\mathcal C^2-\mathcal C\|_\diamond$, and that the number of slow degrees of freedom is bounded independently of the full system size. Under these assumptions, we construct compression and reconstruction channels whose composition recovers every reduced state exactly, while the reverse composition gives an exactly idempotent channel approximating $\mathcal C$, answering Kitaev's exact-rounding question [Kit25]. Our constructions give an optimal diamond-norm bound of $\mathcal{O}(η^{1/3})$ on all input states, as well as an improved bound of $\mathcal{O}(η^{1/2})$ on metastable states prepared by $\mathcal C$, with constants depending only on the slow dimension. The reduced transition channel can be iterated to predict the microscopic dynamics with controlled error. We illustrate the QMSM through a weakly driven dissipative spin chain supporting either a metastable logical qubit or long-lived classical phases.
AI Summary
Spectral projections onto slow modes of open quantum dynamics need not be completely positive, preventing their direct use as physical reduced models. This paper asks when a metastable evolution admits compression and reconstruction channels onto a small state space that retains both classical phase labels and quantum coherence. For a channel $\mathcal C$ with idempotency defect $\eta=\|\mathcal C^2-\mathcal C\|_\diamond$ sufficiently small and slow Riesz-projection rank $r_0\le r$, it constructs a CPTP idempotent $\mathcal Q_{\rm g}$ of rank $r_0$ satisfying $\|\mathcal Q_{\rm g}-\mathcal C\|_\diamond\le C_r\eta^{1/3}$. The exponent is stated to be optimal. A second construction has rank at most $r_0+1$ and satisfies $\|\mathcal Q_{\rm m}\mathcal C-\mathcal C\|_\diamond\le C_r\sqrt\eta$. The reduced state spaces are CPTP-isomorphic to direct sums of matrix blocks, encoding classical sectors and quantum memories. Iterating the compressed transition channel gives errors $O_r(k\eta^{1/3})$ globally or $O_r((k+1)\sqrt\eta)$ after preparation by $\mathcal C$. The proofs start from an approximate encoding–decoding factorization and repair its Stinespring dilations using environmental-state cutoffs and subspace rotations, making reduced-space recovery exact. Weakly driven dissipative spin chains illustrate reductions to a logical qubit or two classical phases. The guarantees require bounded slow rank, with constants independent of ambient dimension but dependent on $r$. The paper states that without this restriction no dimension-independent exact-rounding modulus exists. The improved bound concerns prepared states rather than arbitrary inputs; general iteration errors grow linearly with step count, with longer-time control established separately for the spin-chain examples.
We used OpenAI GPT-5.5, GPT-5.6 Sol, and GPT-6 Astra to explore candidate proof strategies, examples, and counterexamples, and to assist with manuscript preparation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages, 6 figures