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

Springer series in synergetics

Quantum Markov Processes

Crispin W. Gardiner

Published Jan 1, 1991• 1 citation
Publisher
DOI
10.1007/978-3-662-09642-0_5

Related papers

Quantum Markov Processes

Luigi Accardi

Springer eBooks•Jan 1, 1980•3 citations

CLASSICAL MARKOV PROCESSES FROM QUANTUM LÉVY PROCESSES

Uwe Franz

We show how classical Markov processes can be obtained from quantum Lévy processes. It is shown that quantum Lévy processes are quantum Markov processes, and sufficient conditions for restrictions to subalgebras to remain quantum Markov processes are given. A classical Markov process (which has the same time-ordered moments as the quantum process in the vacuum state) exists whenever we can restrict to a commutative subalgebra without losing the quantum Markov property.8 Several examples, including the Azéma martingale, with explicit calculations are presented. In particular, the action of the generator of the classical Markov processes on polynomials or their moments are calculated using Hopf algebra duality.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Mar 1, 1999•2 citations

Quantum Markov Processes

Crispin W. Gardiner, P. Zoller

Springer series in synergetics•Jan 1, 2000•1 citation

Quantum Markov monogamy inequalities

Matheus Capela, Lucas C. Céleri, Rafael Chaves +1 more

Markovianity lies at the heart of communication problems. This in turn makes the information-theoretic characterization of Markov processes worthwhile. Data-processing inequalities are ubiquitous in this sense, assigning necessary conditions for all Markov processes. We address here the problem of the information-theoretic analysis of constraints on Markov processes in the quantum regime. We show the existence of a class of quantum data-processing inequalities called here quantum Markov monogamy inequalities. This class of necessary conditions on quantum Markov processes is inspired by its counterpart for classical Markov processes, thus providing a strong link between classical and quantum constraints on Markovianity. We go on to construct a family of multitime quantum Markov monogamy inequalities, based on the process tensor formalism and that exploits multitime correlations. We then show, by means of an explicit example, that the Markov monogamy inequalities can be stronger than the usual quantum data-processing inequalities.

arXiv:2108.11533•Physical Review A•Aug 29, 2022•8 citations

Quantum partially observable Markov decision processes

Jennifer Barry, Daniel T. Barry, Scott Aaronson

We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent's state is represented as a quantum state and the agent can choose a superoperator to apply. This is similar to the POMDP belief state, which is a probability distribution over world states and evolves via a stochastic matrix. We show that the existence of a policy of at least a certain value has the same complexity for QOMDPs and POMDPs in the polynomial and infinite horizon cases. However, we also prove that the existence of a policy that can reach a goal state is decidable for goal POMDPs and undecidable for goal QOMDPs.

arXiv:1406.2858•Physical Review A•Sep 9, 2014•74 citations

Quantum Markov Processes

Burkhard Kümmerer

Lecture notes in physics•Jan 1, 2002•21 citations
We show how classical Markov processes can be obtained from quantum Lévy processes. It is shown that quantum Lévy processes are quantum Markov processes, and sufficient conditions for restrictions to subalgebras to remain quantum Markov processes are given. A classical Markov process (which has the same time-ordered moments as the quantum process in the vacuum state) exists whenever we can restrict to a commutative subalgebra without losing the quantum Markov property.8 Several examples, including the Azéma martingale, with explicit calculations are presented. In particular, the action of the generator of the classical Markov processes on polynomials or their moments are calculated using Hopf algebra duality.
Markovianity lies at the heart of communication problems. This in turn makes the information-theoretic characterization of Markov processes worthwhile. Data-processing inequalities are ubiquitous in this sense, assigning necessary conditions for all Markov processes. We address here the problem of the information-theoretic analysis of constraints on Markov processes in the quantum regime. We show the existence of a class of quantum data-processing inequalities called here quantum Markov monogamy inequalities. This class of necessary conditions on quantum Markov processes is inspired by its counterpart for classical Markov processes, thus providing a strong link between classical and quantum constraints on Markovianity. We go on to construct a family of multitime quantum Markov monogamy inequalities, based on the process tensor formalism and that exploits multitime correlations. We then show, by means of an explicit example, that the Markov monogamy inequalities can be stronger than the usual quantum data-processing inequalities.
We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent's state is represented as a quantum state and the agent can choose a superoperator to apply. This is similar to the POMDP belief state, which is a probability distribution over world states and evolves via a stochastic matrix. We show that the existence of a policy of at least a certain value has the same complexity for QOMDPs and POMDPs in the polynomial and infinite horizon cases. However, we also prove that the existence of a policy that can reach a goal state is decidable for goal POMDPs and undecidable for goal QOMDPs.