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:1808.05048 · Linear Algebra and its Applications

Factorizations of quantum channels

Jeremy Levick

Published May 7, 2018• 2 citations
arXivHTMLPDF
DOI
10.1016/j.laa.2018.05.001

Related papers

Classical and Quantum Factors of Channels.

John R. Mahoney, Cina Aghamohammadi, James P. Crutchfield

•Sep 23, 2017•0 citations

Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

Charles H. Bennett, Peter W. Shor, John A. Smolin +1 more

Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. We obtain exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in $d$ dimensions.

arXiv:quant-ph/9904023•Physical Review Letters•Oct 11, 1999•616 citations

On diagonal quantum channels

Amir R. Arab

arXiv:2011.00237•Reports on Mathematical Physics•Aug 1, 2021•2 citations

A linearization of quantum channels

Tanner Crowder

Journal of Geometry and Physics•Feb 24, 2015•8 citations

A sufficient criterion for divisibility of quantum channels

Frederik vom Ende

We present a simple, dimension-independent criterion which guarantees that some quantum channel Φ is divisible, i.e., that there exists a non-trivial factorization Φ = Φ1Φ2. The idea is to first define an “elementary” channel Φ2 and then to analyze when ΦΦ2−1 is completely positive. The sufficient criterion obtained this way—which even yields an explicit factorization of Φ—is that one has to find orthogonal unit vectors x, x⊥ such that 〈x⊥|KΦKΦ⊥|x〉=〈x|KΦKΦ⊥|x〉={0} where KΦ is the Kraus subspace of Φ and KΦ⊥ is its orthogonal complement. Of course, using linearity this criterion can be reduced to finitely many equalities. Generically, this division even lowers the Kraus rank which is why repeated application—if possible—results in a factorization of Φ into in some sense “simple” channels. Finally, be aware that our techniques are not limited to the particular elementary channel we chose.

arXiv:2407.17103•Journal of Mathematical Physics•Mar 1, 2025•2 citations

Quantum Message Passing for Factor Graphs over Finite Abelian Groups

Avijit Mandal, Henry D. Pfister

We develop a quantum message-passing framework for factor graphs over finite abelian groups. Our starting point is the task of discriminating between a collection of quantum states indexed by the elements of a finite abelian group $\mathcal{G}$ whose overlaps respect the structure of a group-covariant pure-state channel (PSC). For such channels, we show that the Gram matrix constructed from the output states is diagonalized by the character basis of the dual group $\widehat{\mathcal{G}}$. Hence, the channel is characterized, up to isometric equivalence, by its character-indexed eigen list. Based on this representation, we analyze the induced classical-quantum channels associated with check, equality, homomorphism, marginalization, and automorphism factors. For each factor, we derive explicit update rules showing that if the incoming messages are heralded mixtures of group-covariant PSCs, then the outgoing message remains in the same class. This provides a closed quantum message-passing framework for tree-structured factor graphs assembled from these primitives. The framework applies directly to several standard code families over finite abelian groups, including polar codes, LDPC codes, and convolutional and turbo codes. It recovers the previously studied $q$-ary formulation as the special case $(\mathcal{G}=\mathbb{Z}_q)$, while extending the belief propagation with quantum messages (BPQM) framework introduced by Renes to non-cyclic alphabets and more general factor-graph constraints described by homomorphisms between products of abelian groups.

quant-pharXiv:2604.12186•Apr 15, 2026•4 citations
Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. We obtain exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in ddd dimensions.
We present a simple, dimension-independent criterion which guarantees that some quantum channel Φ is divisible, i.e., that there exists a non-trivial factorization Φ = Φ1Φ2. The idea is to first define an “elementary” channel Φ2 and then to analyze when ΦΦ2−1 is completely positive. The sufficient criterion obtained this way—which even yields an explicit factorization of Φ—is that one has to find orthogonal unit vectors x, x⊥ such that 〈x⊥|KΦKΦ⊥|x〉=〈x|KΦKΦ⊥|x〉={0} where KΦ is the Kraus subspace of Φ and KΦ⊥ is its orthogonal complement. Of course, using linearity this criterion can be reduced to finitely many equalities. Generically, this division even lowers the Kraus rank which is why repeated application—if possible—results in a factorization of Φ into in some sense “simple” channels. Finally, be aware that our techniques are not limited to the particular elementary channel we chose.
We develop a quantum message-passing framework for factor graphs over finite abelian groups. Our starting point is the task of discriminating between a collection of quantum states indexed by the elements of a finite abelian group G\mathcal{G}G whose overlaps respect the structure of a group-covariant pure-state channel (PSC). For such channels, we show that the Gram matrix constructed from the output states is diagonalized by the character basis of the dual group G^\widehat{\mathcal{G}}G​. Hence, the channel is characterized, up to isometric equivalence, by its character-indexed eigen list. Based on this representation, we analyze the induced classical-quantum channels associated with check, equality, homomorphism, marginalization, and automorphism factors. For each factor, we derive explicit update rules showing that if the incoming messages are heralded mixtures of group-covariant PSCs, then the outgoing message remains in the same class. This provides a closed quantum message-passing framework for tree-structured factor graphs assembled from these primitives. The framework applies directly to several standard code families over finite abelian groups, including polar codes, LDPC codes, and convolutional and turbo codes. It recovers the previously studied qqq-ary formulation as the special case (G=Zq)(\mathcal{G}=\mathbb{Z}_q)(G=Zq​), while extending the belief propagation with quantum messages (BPQM) framework introduced by Renes to non-cyclic alphabets and more general factor-graph constraints described by homomorphisms between products of abelian groups.