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:2611.10042

Positivity Improving Quantum Markov Operators

Luigi Accardi, Abdessatar Souissi

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

A Markov operator on a matrix algebra, that is, a unital completely positive map, is called positivity improving if it maps every nonzero positive element to an invertible one. This is the noncommutative counterpart of a stochastic matrix with strictly positive entries. We show that positivity improvement is self-dual and equivalent to a faithful quantum Markov--Dobrushin--Doeblin minorization. We also compare the scalar trace minorization with the optimal common-lower-bound construction of the quantum Markov--Dobrushin coefficient. We then characterize positivity improvement through the Kraus space of the map: a Markov operator is positivity improving if and only if the Hilbert--Schmidt orthogonal complement of its Kraus space contains no operator of rank one. As a consequence the Kraus rank of a positivity improving Markov operator on the algebra of $d\times d$ matrices is at least $2d-1$, and an explicit Hankel-type channel shows that this bound is attained in every dimension. Although deciding positivity improvement is NP-hard in general, we obtain complete and effectively checkable classifications for qubits and qutrits, together with families of examples (Pauli, Weyl and Werner--Holevo channels) showing that all our estimates are optimal. Finally we show that, in infinite dimensions, positivity improvement no longer implies any contraction of the Markov operator.

DOI
10.48550/arxiv.2611.10042

Related papers

Markov operators on cones and non-commutative consensus

Stéphane Gaubert, Zheng Qu

The analysis of classical consensus algorithms relies on contraction properties of Markov matrices with respect to the Hilbert semi-norm (infinitesimal version of Hilbert's projective metric) and to the total variation norm. We generalize these properties to the case of operators on cones. This is motivated by the study of “non-commutative consensus”, i.e., of the dynamics of linear maps leaving invariant cones of positive semi-definite matrices. Such maps appear in quantum information (Kraus maps), and in the study of matrix means. We give a characterization of the contraction rate of an abstract Markov operator on a cone, which extends classical formulæ obtained by Dœblin and Dobrushin in the case of Markov matrices. In the special case of Kraus maps, we relate the absence of contraction to the positivity of the “zero-error capacity” of a quantum channel. We finally show that a number of decision problems concerning the contraction rate of Kraus maps reduce to finding a rank one matrix in linear spaces satisfying certain conditions and discuss complexity issues.

European Control Conference (ECC)•Jul 1, 2013•3 citations

Strict positivity and D -majorization

Frederik vom Ende

Motivated by quantum thermodynamics, we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action on any full-rank state, and that the image of non-strictly positive maps lives inside a lower-dimensional subalgebra. This implies that the distance of such maps to the identity channel is lower bounded by one. The notion of strict positivity comes in handy when generalizing the majorization ordering on real vectors with respect to a positive vector d to majorization on square matrices with respect to a positive definite matrix D. For the two-dimensional case, we give a characterization of this ordering via finitely many trace norm inequalities and, moreover, investigate some of its order properties. In particular it admits a unique minimal and a maximal element. The latter is unique as well if and only if minimal eigenvalue of D has multiplicity one.

arXiv:2004.05613•Linear and Multilinear Algebra•Dec 17, 2020•10 citations

Domination for quantum Markov semigroups (Research on structure of operators by order and related topics)

B. V. Rajarama Bhat

A well-known theorem of W. Arveson states that a completely positive (CP) map dominated (difference is CP) by a given CP map is described through a positive contraction in the commutant of the homomorphism of Stinespring representation. This contraction plays the role of Radon-Nikodym derivative of measure theory. We look at implications of this to one parameter semigroups of unital completely positive maps, known as quantum Markov semigroups. We focus our attention to quantum Markov semigroups of B(H), the algebra of all bounded operators on a Hilbert space. These semigroups can be dilated to semigroups of unital endomorphisms (E₀-semigroups) of B(K) for some other Hilbert space K. Here we see that dominated CP semigroups dilate to dominated semigroups of the dilation. Moreover at the level of Eo-semigroups the dominated CP semigroups are described through positive contractive local cocycles, which are really families of contractions of 'Radon-Nikodym derivatives' mentioned above. We analyze the structure for quantum semigroups with bounded generators.

数理解析研究所講究録•Oct 1, 2021•0 citations

Asymptotic properties of quantum Markov chains

J Novotný, G Alber, I Jex

The asymptotic dynamics of discrete quantum Markov chains generated by the most general physically relevant quantum operations is investigated. It is shown that it is confined to an attractor space in which the resulting quantum Markov chain is diagonalizable. A construction procedure of a basis of this attractor space and its associated dual basis of 1-forms is presented. It is applicable whenever a strictly positive quantum state exists which is contracted or left invariant by the generating quantum operation. Moreover, algebraic relations between the attractor space and Kraus operators involved in the definition of a quantum Markov chain are derived. This construction is not only expected to offer significant computational advantages in cases in which the dimension of the Hilbert space is large and the dimension of the attractor space is small, but it also sheds new light onto the relation between the asymptotic dynamics of discrete quantum Markov chains and fixed points of their generating quantum operations. Finally, we show that without any restriction our construction applies to all initial states whose support belongs to the so-called recurrent subspace.

arXiv:1208.0764•Journal of Physics A Mathematical and Theoretical•Nov 19, 2012•23 citations

Approximating quantum channels by completely positive maps with small Kraus rank

Cécilia Lancien, Andreas Winter

We study the problem of approximating a quantum channel by one with as few Kraus operators as possible (in the sense that, for any input state, the output states of the two channels should be close to one another). Our main result is that any quantum channel mapping states on some input Hilbert space A to states on some output Hilbert space B can be compressed into one with order dlog⁡d Kraus operators, where d=max(|A|,|B|) , hence much less than |A||B| . In the case where the channel's outputs are all very mixed, this can be improved to order d . We discuss the optimality of this result as well as some consequences.

arXiv:1711.00697•Quantum•Apr 30, 2024•10 citations

Quantum Markov chains

Stanley Gudder

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.

Journal of Mathematical Physics•Jul 1, 2008•106 citations
A Markov operator on a matrix algebra, that is, a unital completely positive map, is called positivity improving if it maps every nonzero positive element to an invertible one. This is the noncommutative counterpart of a stochastic matrix with strictly positive entries. We show that positivity improvement is self-dual and equivalent to a faithful quantum Markov--Dobrushin--Doeblin minorization. We also compare the scalar trace minorization with the optimal common-lower-bound construction of the quantum Markov--Dobrushin coefficient. We then characterize positivity improvement through the Kraus space of the map: a Markov operator is positivity improving if and only if the Hilbert--Schmidt orthogonal complement of its Kraus space contains no operator of rank one. As a consequence the Kraus rank of a positivity improving Markov operator on the algebra of d×dd\times dd×d matrices is at least 2d−12d-12d−1, and an explicit Hankel-type channel shows that this bound is attained in every dimension. Although deciding positivity improvement is NP-hard in general, we obtain complete and effectively checkable classifications for qubits and qutrits, together with families of examples (Pauli, Weyl and Werner--Holevo channels) showing that all our estimates are optimal. Finally we show that, in infinite dimensions, positivity improvement no longer implies any contraction of the Markov operator.
The analysis of classical consensus algorithms relies on contraction properties of Markov matrices with respect to the Hilbert semi-norm (infinitesimal version of Hilbert's projective metric) and to the total variation norm. We generalize these properties to the case of operators on cones. This is motivated by the study of “non-commutative consensus”, i.e., of the dynamics of linear maps leaving invariant cones of positive semi-definite matrices. Such maps appear in quantum information (Kraus maps), and in the study of matrix means. We give a characterization of the contraction rate of an abstract Markov operator on a cone, which extends classical formulæ obtained by Dœblin and Dobrushin in the case of Markov matrices. In the special case of Kraus maps, we relate the absence of contraction to the positivity of the “zero-error capacity” of a quantum channel. We finally show that a number of decision problems concerning the contraction rate of Kraus maps reduce to finding a rank one matrix in linear spaces satisfying certain conditions and discuss complexity issues.
Motivated by quantum thermodynamics, we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action on any full-rank state, and that the image of non-strictly positive maps lives inside a lower-dimensional subalgebra. This implies that the distance of such maps to the identity channel is lower bounded by one. The notion of strict positivity comes in handy when generalizing the majorization ordering on real vectors with respect to a positive vector d to majorization on square matrices with respect to a positive definite matrix D. For the two-dimensional case, we give a characterization of this ordering via finitely many trace norm inequalities and, moreover, investigate some of its order properties. In particular it admits a unique minimal and a maximal element. The latter is unique as well if and only if minimal eigenvalue of D has multiplicity one.
A well-known theorem of W. Arveson states that a completely positive (CP) map dominated (difference is CP) by a given CP map is described through a positive contraction in the commutant of the homomorphism of Stinespring representation. This contraction plays the role of Radon-Nikodym derivative of measure theory. We look at implications of this to one parameter semigroups of unital completely positive maps, known as quantum Markov semigroups. We focus our attention to quantum Markov semigroups of B(H), the algebra of all bounded operators on a Hilbert space. These semigroups can be dilated to semigroups of unital endomorphisms (E₀-semigroups) of B(K) for some other Hilbert space K. Here we see that dominated CP semigroups dilate to dominated semigroups of the dilation. Moreover at the level of Eo-semigroups the dominated CP semigroups are described through positive contractive local cocycles, which are really families of contractions of 'Radon-Nikodym derivatives' mentioned above. We analyze the structure for quantum semigroups with bounded generators.
The asymptotic dynamics of discrete quantum Markov chains generated by the most general physically relevant quantum operations is investigated. It is shown that it is confined to an attractor space in which the resulting quantum Markov chain is diagonalizable. A construction procedure of a basis of this attractor space and its associated dual basis of 1-forms is presented. It is applicable whenever a strictly positive quantum state exists which is contracted or left invariant by the generating quantum operation. Moreover, algebraic relations between the attractor space and Kraus operators involved in the definition of a quantum Markov chain are derived. This construction is not only expected to offer significant computational advantages in cases in which the dimension of the Hilbert space is large and the dimension of the attractor space is small, but it also sheds new light onto the relation between the asymptotic dynamics of discrete quantum Markov chains and fixed points of their generating quantum operations. Finally, we show that without any restriction our construction applies to all initial states whose support belongs to the so-called recurrent subspace.
We study the problem of approximating a quantum channel by one with as few Kraus operators as possible (in the sense that, for any input state, the output states of the two channels should be close to one another). Our main result is that any quantum channel mapping states on some input Hilbert space A to states on some output Hilbert space B can be compressed into one with order dlog⁡d Kraus operators, where d=max(|A|,|B|) , hence much less than |A||B| . In the case where the channel's outputs are all very mixed, this can be improved to order d . We discuss the optimality of this result as well as some consequences.
A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.