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

Noncommutative majorization

Matthew Kennedy, Paul Skoufranis

Published Sep 2, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Characterization of preorders induced by positive maps in the set of Hermitian matrices

Julio I. de Vicente

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.

arXiv:2105.08778•May 18, 2021•0 citations

Operator algebra generalization of a theorem of Watrous and mixed unitary quantum channels

David W. Kribs, Jeremy Levick, Rajesh Pereira +1 more

Abstract We establish an operator algebra generalization of Watrous’ theorem (Watrous 2009 Quantum Inf. Comput. 9 403–413) on mixing unital quantum channels (completely positive trace-preserving maps) with the completely depolarizing channel, wherein the more general objects of focus become (finite-dimensional) von Neumann algebras, the unique trace preserving conditional expectation onto the algebra, the group of unitary operators in the commutant of the algebra, and the fixed point algebra of the channel. As an application, we obtain a result on the asymptotic theory of quantum channels, showing that all unital channels are eventually mixed unitary. We also discuss the special case of the diagonal algebra in detail, and draw connections to the theory of correlation matrices and Schur product maps.

arXiv:2306.04077•Journal of Physics A Mathematical and Theoretical•Feb 23, 2024•3 citations

Extending quantum operations

Teiko Heinosaari, Maria Anastasia Jivulescu, David Reeb +1 more

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

arXiv:1205.0641•Journal of Mathematical Physics•Oct 1, 2012•45 citations

Notes on completely positive map

Haiyang Li

The sufficient and necessary conditions of positive and trace preserving map,completely positive and trace preserving map are given and proved so as to they can be well-understanded and used,the convexity of quantum channels is also proved.

Computer Engineering and Applications Journal•Jan 1, 2011•0 citations

CP-preserving channels

Indu Bala, Sourav Das, Swapan Rana

Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston \emph{et al.} [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $Φ:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $Φ:\MM_2\to \MM_n$ is also CPCP.

quant-pharXiv:2607.24682•Jul 28, 2026•0 citations

Noncommutative Marcus-Ree inequality and Erdős channels

Repana Devendra, Chaman Kumar Sahu

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.

arXiv:2610.02294•Oct 1, 2026•0 citations
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.
Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix AAA into another BBB if and only if the vector of eigenvalues of AAA majorizes that of BBB. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.
Abstract We establish an operator algebra generalization of Watrous’ theorem (Watrous 2009 Quantum Inf. Comput. 9 403–413) on mixing unital quantum channels (completely positive trace-preserving maps) with the completely depolarizing channel, wherein the more general objects of focus become (finite-dimensional) von Neumann algebras, the unique trace preserving conditional expectation onto the algebra, the group of unitary operators in the commutant of the algebra, and the fixed point algebra of the channel. As an application, we obtain a result on the asymptotic theory of quantum channels, showing that all unital channels are eventually mixed unitary. We also discuss the special case of the diagonal algebra in detail, and draw connections to the theory of correlation matrices and Schur product maps.
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.
Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston \emph{et al.} [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $Φ:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $Φ:\MM_2\to \MM_n$ is also CPCP.
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.