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

Letters in Mathematical Physics

Stochastic linear maps and transition probability

Peter M. Alberti, Armin Uhlmann

Published Mar 1, 1983• 33 citations
Publisher
DOI
10.1007/bf00419927

Related papers

Weak Markov processes as linear systems

Rolf Gohm

arXiv:1206.0378•Mathematics of Control Signals and Systems•May 27, 2015•2 citations

Trajectory of Probabilities, Probability on Trajectories, and the Stochastic-Quantum Correspondence

Győző Egri, Marton Gomori, Balazs Gyenis +1 more

The probabilistic description of the time evolution of a physical system can take two conceptually distinct forms: a trajectory of probabilities, which specifies how probabilities evolve over time, and a probability on trajectories, which assigns probabilities to possible histories. A lack of a clear distinction between these two probabilistic descriptions has given rise to a number of conceptual difficulties, particularly in recent analyses of stochastic-quantum correspondence. This paper provides a systematic account of their relationship. We define probability dynamics and stochastic process families together with a precise notion of implementation that connects the two descriptions. We show that implementations are generically non-unique, that every probability dynamics admits a Markovian implementation, and characterize when non-Markovian implementations are possible. We expose fallacies in common arguments for the linearity of probability dynamics based on the law of total probability and clarify the proper interpretation of ``transition matrices'' by distinguishing dynamics-level maps from the conditional probability matrices of implementing processes. We further introduce decomposability as the appropriate general notion of stepwise evolution for (possibly nonlinear) probability dynamics, relate it to divisibility in the linear case -- showing that the two can come apart -- and disentangle both notions from Markovianity and time-homogeneity. Finally, we connect these results to what we call statistical dynamics, in which linearity is indeed physically motivated, and contrast the framework with quantum mechanics.

quant-pharXiv:2602.23491•Mar 2, 2026•2 citations

Interpreting Quantum Learning Models via Stochastic Processes

Johannes Fankhauser, Lukas J. Fiderer, Hans J. Briegel

Quantum machine learning models define probabilistic input--output maps through coherent quantum evolution and measurement. While such models can exhibit computational advantages, their internal functioning and decision making generally resists interpretation in terms of stochastic trajectories through intermediate configurations. In contrast to classical (Markovian) stochastic processes, quantum dynamics generically violates the Chapman--Kolmogorov divisibility condition, preventing a decomposition into probabilistically meaningful intermediate transitions. We develop a probabilistic framework for representing quantum learning models as stochastic processes over configuration spaces where the dynamics are modeled as linear maps on probability distributions. Starting from a fixed POVM, arbitrary quantum channels induce transition kernels on the associated probability representation. For informationally complete POVMs, and in particular SIC-POVMs, these kernels are Markovian but generally quasi-stochastic, with non-classicality appearing as negativity. By contrast, projective spaces admit positive stochastic kernels but generally require non-Markovian dynamics due to the failure of Chapman--Kolmogorov divisibility. This yields a trade-off between negativity and dependence on past configurations, i.e. quantum dynamics can be represented either by Markovian quasi-stochastic maps or by positive stochastic processes with higher Markov order. We discuss how such representations of quantum dynamics can be interpreted as stochastic walks through a memory space in the spirit of Projective Simulation, a model of learning and agency in which decisions arise from random walks over an episodic memory network. We further outline how finite-order stochastic kernels can approximate such quantum deliberation processes and show in what regimes the classical machine learning model is recovered.

quant-pharXiv:2607.17327•Jul 21, 2026•0 citations

Stochastic Representations

Massimo Franceschetti

Cambridge University Press eBooks•Dec 4, 2017•0 citations

Stochastic Mechanics and Stochastic Processes

Aubrey Truman, Ian M Davies

Lecture notes in mathematics•Jan 1, 1988•11 citations

Time reversals of irreversible quantum maps

Erik Aurell, Jakub Zakrzewski, Karol Życzkowski

Abstract We propose an alternative notion of time reversal in open quantum systems as represented by linear quantum operations, and a related generalization of classical entropy production in the environment. This functional is the ratio of the probability to observe a transition between two states under the forward and the time reversed dynamics, and leads, as in the classical case, to fluctuation relations as tautological identities. As in classical dynamics in contact with a heat bath, time reversal is not unique, and we discuss several possibilities. For any bistochastic map its dual map preserves the trace and describes a legitimate dynamics reversed in time, in that case the entropy production in the environment vanishes. For a generic stochastic map we construct a simple quantum operation which can be interpreted as a time reversal. For instance, the decaying channel, which sends the excited state into the ground state with a certain probability, can be reversed into the channel transforming the ground state into the excited state with the same probability.

arXiv:1505.02259•Journal of Physics A Mathematical and Theoretical•Aug 24, 2015•19 citations
The probabilistic description of the time evolution of a physical system can take two conceptually distinct forms: a trajectory of probabilities, which specifies how probabilities evolve over time, and a probability on trajectories, which assigns probabilities to possible histories. A lack of a clear distinction between these two probabilistic descriptions has given rise to a number of conceptual difficulties, particularly in recent analyses of stochastic-quantum correspondence. This paper provides a systematic account of their relationship. We define probability dynamics and stochastic process families together with a precise notion of implementation that connects the two descriptions. We show that implementations are generically non-unique, that every probability dynamics admits a Markovian implementation, and characterize when non-Markovian implementations are possible. We expose fallacies in common arguments for the linearity of probability dynamics based on the law of total probability and clarify the proper interpretation of ``transition matrices'' by distinguishing dynamics-level maps from the conditional probability matrices of implementing processes. We further introduce decomposability as the appropriate general notion of stepwise evolution for (possibly nonlinear) probability dynamics, relate it to divisibility in the linear case -- showing that the two can come apart -- and disentangle both notions from Markovianity and time-homogeneity. Finally, we connect these results to what we call statistical dynamics, in which linearity is indeed physically motivated, and contrast the framework with quantum mechanics.
Quantum machine learning models define probabilistic input--output maps through coherent quantum evolution and measurement. While such models can exhibit computational advantages, their internal functioning and decision making generally resists interpretation in terms of stochastic trajectories through intermediate configurations. In contrast to classical (Markovian) stochastic processes, quantum dynamics generically violates the Chapman--Kolmogorov divisibility condition, preventing a decomposition into probabilistically meaningful intermediate transitions. We develop a probabilistic framework for representing quantum learning models as stochastic processes over configuration spaces where the dynamics are modeled as linear maps on probability distributions. Starting from a fixed POVM, arbitrary quantum channels induce transition kernels on the associated probability representation. For informationally complete POVMs, and in particular SIC-POVMs, these kernels are Markovian but generally quasi-stochastic, with non-classicality appearing as negativity. By contrast, projective spaces admit positive stochastic kernels but generally require non-Markovian dynamics due to the failure of Chapman--Kolmogorov divisibility. This yields a trade-off between negativity and dependence on past configurations, i.e. quantum dynamics can be represented either by Markovian quasi-stochastic maps or by positive stochastic processes with higher Markov order. We discuss how such representations of quantum dynamics can be interpreted as stochastic walks through a memory space in the spirit of Projective Simulation, a model of learning and agency in which decisions arise from random walks over an episodic memory network. We further outline how finite-order stochastic kernels can approximate such quantum deliberation processes and show in what regimes the classical machine learning model is recovered.
Abstract We propose an alternative notion of time reversal in open quantum systems as represented by linear quantum operations, and a related generalization of classical entropy production in the environment. This functional is the ratio of the probability to observe a transition between two states under the forward and the time reversed dynamics, and leads, as in the classical case, to fluctuation relations as tautological identities. As in classical dynamics in contact with a heat bath, time reversal is not unique, and we discuss several possibilities. For any bistochastic map its dual map preserves the trace and describes a legitimate dynamics reversed in time, in that case the entropy production in the environment vanishes. For a generic stochastic map we construct a simple quantum operation which can be interpreted as a time reversal. For instance, the decaying channel, which sends the excited state into the ground state with a certain probability, can be reversed into the channel transforming the ground state into the excited state with the same probability.