Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.10502 · SciPost Physics

Classical representation of the dynamics of quantum spin chains

Tony Jin

Published Sep 9, 2026• 2 citations
arXivHTMLPDF

Abstract

Since the advent of quantum mechanics, classical probability interpretations have faced significant challenges. A notable issue arises with the emergence of negative probabilities when attempting to define the joint probability of non-commutative observables. In this work, we propose a resolution to this dilemma by introducing an exact representation of the dynamics of quantum spin chains using classical continuous-time Markov chains (CTMCs). These CTMCs effectively model the creation, annihilation, and propagation of pairs of classical particles and antiparticles. The quantum dynamics then emerges by averaging over various realizations of this classical process.

DOI
10.21468/scipostphys.21.3.059

Related papers

Quantum-to-Classical Computability Transition via Negative Markov Chains

Hugo Lóio, Jacopo De Nardis, Tony Jin

We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined over an exponentially large configuration space. Within this framework, quantum complexity arises from the proliferation of stochastic particles, which ultimately renders classical simulation and sampling intractable beyond a certain timescale. In the presence of noise, we demonstrate that for any unitary evolution generated by a linear combination of local or pairwise interactions, there exists at least one noise channel that effectively classicalizes the system by suppressing particle growth and making Monte Carlo sampling efficient. As a corollary, we show that for this class of unitaries, the dynamics of an open quantum spin chain subject to depolarizing noise undergoes an exact transition to classical simulability once the noise strength exceeds a critical threshold which can be efficiently determined for any model.

quant-pharXiv:2604.19889•Apr 23, 2026•2 citations

ENTANGLEMENT DYNAMICS IN QUANTUM SPIN CHAINS

MŁOSZ MICHALSKI

We study patterns of temporal evolution, creation and transport, of entanglement in quantum spin chains. The model used is an isotropic Heisenberg chain with periodic boundary conditions, and we obtain in analytic form the time dependence of concurrence and negativity of various pairs of spins in the system. The objective of the present study is to assess the usefulness of various averaged entanglement measures in the characterization of entangling properties of quantum evolutions.

International Journal of Quantum Information•Jul 1, 2008•1 citation

Discrete Quantum Markov Chains

Ulrich Faigle, Alexander Schönhuth

A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.

•Nov 4, 2010•4 citations

Dynamics of mixed quantum–classical spin systems *

François Gay–Balmaz, Cesare Tronci

Abstract Mixed quantum–classical spin systems have been proposed in spin chain theory and, more recently, in magnon spintronics. However, current models of quantum–classical dynamics beyond mean-field approximations typically suffer from long-standing consistency issues, and, in some cases, invalidate Heisenberg’s uncertainty principle. Here, we present a fully Hamiltonian theory of quantum–classical spin dynamics that appears to be the first to ensure an entire series of consistency properties, including positivity of both the classical and the quantum density, so that Heisenberg’s principle is satisfied at all times. We show how this theory may connect to recent energy-balance considerations in measurement theory and we present its Poisson bracket structure explicitly. After focusing on the simpler case of a classical Bloch vector interacting with a quantum spin observable, we illustrate the extension of the model to systems with several spins, and restore the presence of orbital degrees of freedom.

arXiv:2210.00988•Journal of Physics A Mathematical and Theoretical•Mar 3, 2023•13 citations

Exact Renewal Identity for Policy-Gated Injection in Sink-Stabilized Surface-Code CTMCs

Ethan Arthur Caspian

Surface-code continuous-time Markov chain (CTMC) models with boundary injection and sink absorption provide a continuous-time view of defect transport and logical-parity flips, but policy-gated injection introduces a normalization ambiguity: should flips be normalized by attempted or accepted injections? Standard discrete-round analyses and naive "flips per attempt" ratios do not separate throughput control from per-accepted-attempt maliciousness. We establish an exact renewal identity: under empty-manifold gating (accept only when the syndrome is empty), accepted injections launch disjoint excursions, and the hazard-normalized estimator peff,acc = N flip /A acc is unbiased for the odd-parity excursion probability under the accepted-start distribution (Theorem 1). A representative CTMC dataset at L = 11, η = 0.9 shows that peff,acc remains stable (within statistical error) even when the acceptance fraction varies by more than a factor of two, while "per attempted injection" ratios change proportionally (values reported in companion application paper). We provide portable bridges to practice: mapping sustaining flip rates to per-cycle logical error probability, a decoder-integration pipeline from CTMC logs to detection events, and a reduced-model exact cross-check. We do not claim an optimal admission policy, nor do we address non-renewal (overlap) regimes in this work.

•Jan 2, 2026•1 citation

Continuous-time quantum Markov chains and discretizations of p -adic Schrödinger equations: comparisons and simulations

Wilson A. Zúñiga-Galindo, L. F. Chacón-Cortés

Abstract Continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p -adic Schrödinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. Unlike classical continuous-time Markov chains (CTMCs), the CTQMCs studied here do not satisfy the classical Chapman–Kolmogorov equation; this is a genuine quantum effect, due to the fact that the underlying unitary evolution composes at the level of probability amplitudes rather than probabilities, and we make precise the sense in which the term ‘quantum Markov chain’ is used. In this paper, we study a large class of p -adic Schrödinger equations and the associated CTQMCs by comparing them with p -adic heat equations and the associated CTMCs. The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.

arXiv:2508.06712•Journal of Statistical Mechanics Theory and Experiment•Sep 1, 2026•7 citations
Since the advent of quantum mechanics, classical probability interpretations have faced significant challenges. A notable issue arises with the emergence of negative probabilities when attempting to define the joint probability of non-commutative observables. In this work, we propose a resolution to this dilemma by introducing an exact representation of the dynamics of quantum spin chains using classical continuous-time Markov chains (CTMCs). These CTMCs effectively model the creation, annihilation, and propagation of pairs of classical particles and antiparticles. The quantum dynamics then emerges by averaging over various realizations of this classical process.
We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined over an exponentially large configuration space. Within this framework, quantum complexity arises from the proliferation of stochastic particles, which ultimately renders classical simulation and sampling intractable beyond a certain timescale. In the presence of noise, we demonstrate that for any unitary evolution generated by a linear combination of local or pairwise interactions, there exists at least one noise channel that effectively classicalizes the system by suppressing particle growth and making Monte Carlo sampling efficient. As a corollary, we show that for this class of unitaries, the dynamics of an open quantum spin chain subject to depolarizing noise undergoes an exact transition to classical simulability once the noise strength exceeds a critical threshold which can be efficiently determined for any model.
A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.
Abstract Mixed quantum–classical spin systems have been proposed in spin chain theory and, more recently, in magnon spintronics. However, current models of quantum–classical dynamics beyond mean-field approximations typically suffer from long-standing consistency issues, and, in some cases, invalidate Heisenberg’s uncertainty principle. Here, we present a fully Hamiltonian theory of quantum–classical spin dynamics that appears to be the first to ensure an entire series of consistency properties, including positivity of both the classical and the quantum density, so that Heisenberg’s principle is satisfied at all times. We show how this theory may connect to recent energy-balance considerations in measurement theory and we present its Poisson bracket structure explicitly. After focusing on the simpler case of a classical Bloch vector interacting with a quantum spin observable, we illustrate the extension of the model to systems with several spins, and restore the presence of orbital degrees of freedom.
Surface-code continuous-time Markov chain (CTMC) models with boundary injection and sink absorption provide a continuous-time view of defect transport and logical-parity flips, but policy-gated injection introduces a normalization ambiguity: should flips be normalized by attempted or accepted injections? Standard discrete-round analyses and naive "flips per attempt" ratios do not separate throughput control from per-accepted-attempt maliciousness. We establish an exact renewal identity: under empty-manifold gating (accept only when the syndrome is empty), accepted injections launch disjoint excursions, and the hazard-normalized estimator peff,acc = N flip /A acc is unbiased for the odd-parity excursion probability under the accepted-start distribution (Theorem 1). A representative CTMC dataset at L = 11, η = 0.9 shows that peff,acc remains stable (within statistical error) even when the acceptance fraction varies by more than a factor of two, while "per attempted injection" ratios change proportionally (values reported in companion application paper). We provide portable bridges to practice: mapping sustaining flip rates to per-cycle logical error probability, a decoder-integration pipeline from CTMC logs to detection events, and a reduced-model exact cross-check. We do not claim an optimal admission policy, nor do we address non-renewal (overlap) regimes in this work.
Abstract Continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p -adic Schrödinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. Unlike classical continuous-time Markov chains (CTMCs), the CTQMCs studied here do not satisfy the classical Chapman–Kolmogorov equation; this is a genuine quantum effect, due to the fact that the underlying unitary evolution composes at the level of probability amplitudes rather than probabilities, and we make precise the sense in which the term ‘quantum Markov chain’ is used. In this paper, we study a large class of p -adic Schrödinger equations and the associated CTQMCs by comparing them with p -adic heat equations and the associated CTMCs. The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.