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

Noncommutative Marcus-Ree inequality and Erdős channels

Repana Devendra, Chaman Kumar Sahu

Published Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Unital quantum channels are the noncommutative analogues of doubly stochastic matrices. In 1959, Marcus and Ree showed that the squared Frobenius norm of a doubly stochastic matrix is at most its maximal diagonal sum. We prove a quantum version of this inequality for mixed unitary channels on $\mathbb{M}_d$ and give an example showing that it fails for general unital channels. As in the classical case, we call the channels attaining equality as Erdős channels. We show that the trace-preserving conditional expectation onto any unital $C^*$-subalgebra of $\mathbb{M}_d$ is an Erdős channel. It is also locally isolated among channels of the same Choi rank. Next, we introduce quantum RCDS channels. These are the noncommutative analogue of doubly stochastic matrices whose supported permutations all have the same diagonal sum. We prove a structure theorem for them and use it to characterize the quantum RCDS Erdős channels. We give an explicit form, up to unitary equivalence, for the Erdős channels of Choi rank $2$, and further show that there are uncountably many unitary equivalence classes of Erdős channels unlike the classical case. We also characterize the Erdős channels among mixed Weyl-unitary channels of any Choi rank. For qubits, we prove that there are exactly four unitary equivalence classes of Erdős channels and they are represented by the identity channel and uniform averages of Pauli channels. Finally, restricting to the diagonal channels, our results recover the Marcus--Ree inequality, the structure of RCDS doubly stochastic matrices, and the characterization of Erdős.

DOI
10.48550/arxiv.2610.02294

Related papers

Noncommutative majorization

Matthew Kennedy, Paul Skoufranis

We introduce a theory of noncommutative majorization that extends the classical majorization theory introduced by Hardy, Littlewood and Pólya to tuples of self-adjoint matrices that do not necessarily commute. We define and characterize a noncommutative majorization order that extends the classical majorization order. The definition is in terms of convex noncommutative functions, and we utilize the noncommutative convexity theory and noncommutative Choquet theory recently introduced by Davidson and the first author. As an application, we obtain a new necessary and sufficient condition for the existence of a trace-preserving completely positive map, i.e. a quantum channel, that interpolates between two finite sets of matrices. We give examples demonstrating that it is not always possible for this map to be chosen mixed unitary, even locally. We also address the computational difficulty of verifying the noncommutative majorization order. Our results further apply beyond the tracial case, and we obtain more general results characterizing the existence of unital completely positive maps that preserve an arbitrary faithful state or even unital completely positive map.

arXiv:2609.02799•Sep 2, 2026•0 citations

A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem

Ian T. Durham

Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace and the identity. We expect these channels to be convex combinations of unitary channels and yet it is known that some channels cannot be written that way. Recent work has suggested that $n$ copies of a single channel might approximate a mixture (convex combination) of unitaries. In this paper we show that $n(n+1)/2$ copies of a symmetric unital quantum channel may be arbitrarily-well approximated by a mixture (convex combination) of unitarily implemented channels. In addition, we prove that any extremal properties of a channel are preserved over $n$ (and thus $n(n+1)/2$) copies. The result has the potential to be completely generalized to include non-symmetric channels.

arXiv:0905.4760•May 28, 2009•0 citations

Unital qubit channels are 333-noisy

Indu Bala, Preeti Parashar, Swapan Rana

The algebraic and environmental characteristics of mixed unitary quantum operations are investigated. It is established that the composition of two uniformly n-mixed unitary channels is itself n-noisy, and this n-noisy property is shown to be an invariant under unitary equivalence. Furthermore, by utilizing majorization and the divisibility of Kraus rank-four unital qubit channels, we demonstrate that any unital qubit channel can be physically simulated using a three-dimensional maximally mixed environment. Together, these results advance the classification and physical realization of noisy quantum channels.

quant-pharXiv:2611.03894•Nov 4, 2026•0 citations

On unital qubit channels

Man-Duen Choi, Chi-Kwong Li

A canonical form for unital qubit channels under local unitary transforms is obtained. In particular, it is shown that the eigenvalues of the Choi matrix of a unital quantum channel form a complete set of invariants of the canonical form. It follows immediately that every unital qubit channel is the average of four unitary channels. More generally, a unital qubit channel can be expressed as the convex combination of unitary channels with convex coefficients $p_1, \dots, p_m$ as long as $2(p_1, \dots, p_m)$ is majorized by the vector of eigenvalues of the Choi matrix of the channel. A unital qubit channel in the canonical form will transform the Bloch sphere onto an ellipsoid. We look into the detailed structure of the natural linear maps sending the Bloch sphere onto a corresponding ellipsoid.

arXiv:2301.01358•Quantum Information and Computation•May 1, 2023•8 citations

Positivity Improving Quantum Markov Operators

Luigi Accardi, Abdessatar Souissi

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.

arXiv:2611.10042•Nov 5, 2026•0 citations

Quantum de Finetti theorems for states and channels in any distance measure

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our $k/n$ error bound in max-relative entropy improves on the previously best known $k^2/n$ scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels $N^{(n)}:A^{\otimes n}\to B^{\otimes n}$, where $d_A=\dim A$, we prove that the $k$-system reduced channel is CP-dominated by a mixture of tensor-power channels with error $O(k/\sqrt{n})$ and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of $r$ defects, the representation error is at most $\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}$ and decays exponentially in $n$ for a suitable choice of parameters $r$ and $k$.

quant-pharXiv:2609.40343•Oct 1, 2026•0 citations
Unital quantum channels are the noncommutative analogues of doubly stochastic matrices. In 1959, Marcus and Ree showed that the squared Frobenius norm of a doubly stochastic matrix is at most its maximal diagonal sum. We prove a quantum version of this inequality for mixed unitary channels on Md\mathbb{M}_dMd​ and give an example showing that it fails for general unital channels. As in the classical case, we call the channels attaining equality as Erdős channels. We show that the trace-preserving conditional expectation onto any unital C∗C^*C∗-subalgebra of Md\mathbb{M}_dMd​ is an Erdős channel. It is also locally isolated among channels of the same Choi rank. Next, we introduce quantum RCDS channels. These are the noncommutative analogue of doubly stochastic matrices whose supported permutations all have the same diagonal sum. We prove a structure theorem for them and use it to characterize the quantum RCDS Erdős channels. We give an explicit form, up to unitary equivalence, for the Erdős channels of Choi rank 222, and further show that there are uncountably many unitary equivalence classes of Erdős channels unlike the classical case. We also characterize the Erdős channels among mixed Weyl-unitary channels of any Choi rank. For qubits, we prove that there are exactly four unitary equivalence classes of Erdős channels and they are represented by the identity channel and uniform averages of Pauli channels. Finally, restricting to the diagonal channels, our results recover the Marcus--Ree inequality, the structure of RCDS doubly stochastic matrices, and the characterization of Erdős.
We introduce a theory of noncommutative majorization that extends the classical majorization theory introduced by Hardy, Littlewood and Pólya to tuples of self-adjoint matrices that do not necessarily commute. We define and characterize a noncommutative majorization order that extends the classical majorization order. The definition is in terms of convex noncommutative functions, and we utilize the noncommutative convexity theory and noncommutative Choquet theory recently introduced by Davidson and the first author. As an application, we obtain a new necessary and sufficient condition for the existence of a trace-preserving completely positive map, i.e. a quantum channel, that interpolates between two finite sets of matrices. We give examples demonstrating that it is not always possible for this map to be chosen mixed unitary, even locally. We also address the computational difficulty of verifying the noncommutative majorization order. Our results further apply beyond the tracial case, and we obtain more general results characterizing the existence of unital completely positive maps that preserve an arbitrary faithful state or even unital completely positive map.
Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace and the identity. We expect these channels to be convex combinations of unitary channels and yet it is known that some channels cannot be written that way. Recent work has suggested that nnn copies of a single channel might approximate a mixture (convex combination) of unitaries. In this paper we show that n(n+1)/2n(n+1)/2n(n+1)/2 copies of a symmetric unital quantum channel may be arbitrarily-well approximated by a mixture (convex combination) of unitarily implemented channels. In addition, we prove that any extremal properties of a channel are preserved over nnn (and thus n(n+1)/2n(n+1)/2n(n+1)/2) copies. The result has the potential to be completely generalized to include non-symmetric channels.
The algebraic and environmental characteristics of mixed unitary quantum operations are investigated. It is established that the composition of two uniformly n-mixed unitary channels is itself n-noisy, and this n-noisy property is shown to be an invariant under unitary equivalence. Furthermore, by utilizing majorization and the divisibility of Kraus rank-four unital qubit channels, we demonstrate that any unital qubit channel can be physically simulated using a three-dimensional maximally mixed environment. Together, these results advance the classification and physical realization of noisy quantum channels.
A canonical form for unital qubit channels under local unitary transforms is obtained. In particular, it is shown that the eigenvalues of the Choi matrix of a unital quantum channel form a complete set of invariants of the canonical form. It follows immediately that every unital qubit channel is the average of four unitary channels. More generally, a unital qubit channel can be expressed as the convex combination of unitary channels with convex coefficients p1,…,pmp_1, \dots, p_mp1​,…,pm​ as long as 2(p1,…,pm)2(p_1, \dots, p_m)2(p1​,…,pm​) is majorized by the vector of eigenvalues of the Choi matrix of the channel. A unital qubit channel in the canonical form will transform the Bloch sphere onto an ellipsoid. We look into the detailed structure of the natural linear maps sending the Bloch sphere onto a corresponding ellipsoid.
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.
Standard finite quantum de Finetti theorems approximate the kkk-system marginals of permutation-invariant states of nnn-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our k/nk/nk/n error bound in max-relative entropy improves on the previously best known k2/nk^2/nk2/n scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels N(n):A⊗n→B⊗nN^{(n)}:A^{\otimes n}\to B^{\otimes n}N(n):A⊗n→B⊗n, where dA=dim⁡Ad_A=\dim AdA​=dimA, we prove that the kkk-system reduced channel is CP-dominated by a mixture of tensor-power channels with error O(k/n)O(k/\sqrt{n})O(k/n​) and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of rrr defects, the representation error is at most poly(n)(2dA4k3/(nr2))(r+1)/2\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}poly(n)(2dA4​k3/(nr2))(r+1)/2 and decays exponentially in nnn for a suitable choice of parameters rrr and kkk.