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.03894

Unital qubit channels are 333-noisy

Indu Bala, Preeti Parashar, Swapan Rana

quant-phmath.OASubmitted Nov 2, 2026• Announced Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks for the smallest maximally mixed environment that can implement every unital qubit channel through joint unitary evolution and partial trace. Such an implementation with environment dimension $n$ is called $n$-noisy. Previous results established that dimension $4$ suffices, while some Kraus-rank-$3$ qubit channels cannot be implemented with dimension $2$. The main result is that every unital qubit channel is $3$-noisy, making $3$ the optimal universal environment dimension. The proof reduces unital qubit channels to Pauli channels using invariance under pre- and post-unitary transformations. For the previously unresolved Kraus-rank-$4$ case, it constructs a factorization into two unital channels with Kraus ranks at most $3$ and $2$. A majorization criterion then shows that both factors admit decompositions as uniform mixtures of three unitary channels. A general construction establishes that composing two uniform mixtures of $n$ unitaries produces an $n$-noisy channel: a Fourier matrix combines the two unitary families into a joint system–environment unitary without requiring an $n^2$-dimensional environment. Together with existing results for Kraus rank at most $3$, this proves the claimed bound. Explicit qubit unitary mixtures are supplied in an appendix. The universal dimension bound is restricted to qubits. Extensions connecting divisibility and noisy implementations in higher dimensions remain open; the paper also notes that some mixed-unitary qutrit channels are not $n$-noisy for any finite $n$.

Little sign of AI-generated textOverclaimsPossible errorUnclear writing

Error found: The conclusion asserts closure of arbitrary n-noisy channels under composition, but the paper proves only the narrower composition result for two uniform mixtures of n unitary channels. The statement that a uniform mixture of n unitary channels need not be n-noisy is false, because a controlled unitary implements every such mixture with an n-dimensional maximally mixed environment. The rank-4 factorization proof does not always produce its claimed rank-3 factor: probabilities (0.4,0.4,0.1,0.1) yield factor coefficients (0.5,0.5,0). The appendix's completely depolarizing special case specifies operators that are not unitary, although corrected parameters repair the construction.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
5+ pages; comments/suggestions are most welcome!

Related papers

Quantum memory precludes mixed-unitary dynamics

Charlotte Bäcker, Konstantin Beyer, Walter T. Strunz

Unital quantum channels, defined by their property of leaving the maximally mixed state invariant, form an important class of quantum operations. A distinguished subset of these channels can be represented as a probabilistic mixture of unitary evolutions. Characterizing channels that do not admit such a decomposition is in general a hard problem with significant implications for noise mitigation in quantum technologies and for fundamental problems in quantum information theory. Here we establish a link between mixed-unitarity of unital channels and the (quantum) nature of the memory effects in non-Markovian dynamics. Translating the problem into the language of process tensors, this connection yields a hierarchy of semidefinite programs that provides numerically efficient witnesses for non-mixed-unitary behavior, outperforming existing criteria. We demonstrate the power of this approach through illustrative examples of unital channels in dimensions three and four, and show how the method can detect non-mixed-unitary behavior based on incomplete channel tomography.

quant-pharXiv:2603.17010•Physical Review Research•Mar 19, 2026•1 citation

A rational quantum channel beyond finite tracial baths

Nidhal Mghirbi, Seth Douglas

A quantum channel can always be implemented by a unitary interaction with an environment that starts in a pure state. With a finite, maximally mixed environment, the implementable channels are the noisy operations. A tracial von Neumann algebra as environment gives the factorizable channels, and by a theorem of Haagerup and Musat combined with MIP* = RE, some of these lie outside the closure of the noisy operations. Version 1.0 of this record wrote down explicit rational channels of this kind, with no value for their distance from the closure. This version gives explicit lower bounds. Using Wang and Zhi's dimension-uniform reflection estimate, it constructs a factorizable unital channel on twelve qubits with Kraus entries in {0, 1, ±3/5, 4/5}, whose normalized Choi and diamond distances from the closure are at least 2^-(2J+50), with J = 2^(2^1122000). The bound comes from a compiler theorem: group relations that are rigid uniformly in the matrix dimension give a rational channel with an explicit distance bound. For the channels of version 1.0, a new spectral certificate for the root groups of their presentation gives explicit gaps: 2^-(2J+41) for the fifteen-qubit channel and its two variants and, by the bound of version 1.0, 2^-(2J+36) in Choi distance and 2^-(2J+21) in diamond distance for the fully referenced channel. The numbers are tiny because Wang and Zhi's tolerance is 2^-J. The results depend on recent preprints of Wang and Zhi, Thom, and Alekseev, Liu and Thom, which are not yet refereed. This archive includes the paper, the channel data, the certificates, and programs that rebuild and check them; python verify_all.py ends with OK ALL.

•Oct 2, 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

Quantum noisy channel modeled by canonical unitary operation in two qubits

Wellington Alves de Brito, Rubens Viana Ramos

In this work, we analyze the entanglement variation of pure bipartite states during quantum noisy channel propagation. The quantum noisy channel is modeled by the interaction between the bipartite state and the environment through a canonical unitary form of a two-qubit gate. We have found an analytical expression for the entanglement of the bipartite state at the channel output as function of the channel parameters. At last, we used numerical simulation to show that a canonical unitary form of a three qubit gate is not a good model for a quantum noisy channel.

International Telecommunications Symposium (ITS)•Sep 1, 2006•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

Properties of Conjugate Channels with Applications to Additivity and Multiplicativity

Christopher King, Keiji Matsumoto, Michael Nathanson +1 more

Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.

arXiv:quant-ph/0509126•Markov Processes And Related Fields•Sep 19, 2005•142 citations
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.
The paper asks for the smallest maximally mixed environment that can implement every unital qubit channel through joint unitary evolution and partial trace. Such an implementation with environment dimension nnn is called nnn-noisy. Previous results established that dimension 444 suffices, while some Kraus-rank-333 qubit channels cannot be implemented with dimension 222. The main result is that every unital qubit channel is 333-noisy, making 333 the optimal universal environment dimension.
The proof reduces unital qubit channels to Pauli channels using invariance under pre- and post-unitary transformations. For the previously unresolved Kraus-rank-444 case, it constructs a factorization into two unital channels with Kraus ranks at most 333 and 222. A majorization criterion then shows that both factors admit decompositions as uniform mixtures of three unitary channels. A general construction establishes that composing two uniform mixtures of nnn unitaries produces an nnn-noisy channel: a Fourier matrix combines the two unitary families into a joint system–environment unitary without requiring an n2n^2n2-dimensional environment. Together with existing results for Kraus rank at most 333, this proves the claimed bound. Explicit qubit unitary mixtures are supplied in an appendix.
The universal dimension bound is restricted to qubits. Extensions connecting divisibility and noisy implementations in higher dimensions remain open; the paper also notes that some mixed-unitary qutrit channels are not nnn-noisy for any finite nnn.
Unital quantum channels, defined by their property of leaving the maximally mixed state invariant, form an important class of quantum operations. A distinguished subset of these channels can be represented as a probabilistic mixture of unitary evolutions. Characterizing channels that do not admit such a decomposition is in general a hard problem with significant implications for noise mitigation in quantum technologies and for fundamental problems in quantum information theory. Here we establish a link between mixed-unitarity of unital channels and the (quantum) nature of the memory effects in non-Markovian dynamics. Translating the problem into the language of process tensors, this connection yields a hierarchy of semidefinite programs that provides numerically efficient witnesses for non-mixed-unitary behavior, outperforming existing criteria. We demonstrate the power of this approach through illustrative examples of unital channels in dimensions three and four, and show how the method can detect non-mixed-unitary behavior based on incomplete channel tomography.
A quantum channel can always be implemented by a unitary interaction with an environment that starts in a pure state. With a finite, maximally mixed environment, the implementable channels are the noisy operations. A tracial von Neumann algebra as environment gives the factorizable channels, and by a theorem of Haagerup and Musat combined with MIP* = RE, some of these lie outside the closure of the noisy operations. Version 1.0 of this record wrote down explicit rational channels of this kind, with no value for their distance from the closure. This version gives explicit lower bounds. Using Wang and Zhi's dimension-uniform reflection estimate, it constructs a factorizable unital channel on twelve qubits with Kraus entries in {0, 1, ±3/5, 4/5}, whose normalized Choi and diamond distances from the closure are at least 2^-(2J+50), with J = 2^(2^1122000). The bound comes from a compiler theorem: group relations that are rigid uniformly in the matrix dimension give a rational channel with an explicit distance bound. For the channels of version 1.0, a new spectral certificate for the root groups of their presentation gives explicit gaps: 2^-(2J+41) for the fifteen-qubit channel and its two variants and, by the bound of version 1.0, 2^-(2J+36) in Choi distance and 2^-(2J+21) in diamond distance for the fully referenced channel. The numbers are tiny because Wang and Zhi's tolerance is 2^-J. The results depend on recent preprints of Wang and Zhi, Thom, and Alekseev, Liu and Thom, which are not yet refereed. This archive includes the paper, the channel data, the certificates, and programs that rebuild and check them; python verify_all.py ends with OK ALL.
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.
In this work, we analyze the entanglement variation of pure bipartite states during quantum noisy channel propagation. The quantum noisy channel is modeled by the interaction between the bipartite state and the environment through a canonical unitary form of a two-qubit gate. We have found an analytical expression for the entanglement of the bipartite state at the channel output as function of the channel parameters. At last, we used numerical simulation to show that a canonical unitary form of a three qubit gate is not a good model for a quantum noisy channel.
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.
Quantum channels can be described via a unitary coupling of system and environment, followed by a trace over the environment state space. Taking the trace instead over the system state space produces a different mapping which we call the conjugate channel. We explore the properties of conjugate channels and describe several different methods of construction. In general, conjugate channels map M_d to M_d' with d < d', and different constructions may differ by conjugation with a partial isometry. We show that a channel and its conjugate have the same minimal output entropy and maximal output p-norm. It then follows that the additivity and multiplicativity conjectures for these measures of optimal output purity hold for a product of channels if and only if they also hold for the product of their conjugates. This allows us to reduce these conjectures to the special case of maps taking M_d to M_d' with a minimal representation of dimension at most d. We find explicit expressions for the conjugates for a number of well-known examples, including entanglement-breaking channels, unital qubit channels, the depolarizing channel, and a subclass of random unitary channels. For the entanglement-breaking channels, channels this yields a new class of channels for which additivity and multiplicativity of optimal output purity can be established. For random unitary channels using the generalized Pauli matrices, we obtain a new formulation of the multiplicativity conjecture. The conjugate of the completely noisy channel plays a special role and suggests a mechanism for using noise to transmit information.