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

Symmetry

SU(2)-Covariant Quantum Channels

Łukasz Rudnicki, A. B. Klimov, Ariana S. Muñoz, Gerd Leuchs, Luis Lorenzo Sánchez-Soto

Published Jul 5, 2026• 0 citations
Publisher

Abstract

We present a complete characterization of quantum channels covariant under the action of SU(2), a symmetry that arises naturally across a wide range of physical settings. By exploiting the constraints imposed by rotational symmetry, we derive the spectral decomposition of the associated Choi–Jamiołkowski operators and obtain explicit closed-form expressions for the corresponding Kraus operators. This unified framework provides a systematic approach to analyzing the structure and dynamics of SU(2)-covariant noise, with direct applications to quantum communication, information processing, and symmetry-constrained quantum protocols.

DOI
10.3390/sym18071146

Related papers

SU(2)-Irreducibly Covariant Quantum Channels and Some Applications

Muneerah Al Nuwairan

In this thesis, we introduce EPOSIC channels, a class of SU(2) -covariant quantum channels. For each of them, we give a Stinespring representation, a Kraus representation, its Choi matrix, a complementary channel, and its dual map. We show that these channels are the extreme points of all SU(2) -irreducibly covariant channels. As an application of these channels to the theory of quantum information, we study the minimal output entropy of EPOSIC channels, and show that a large class of these channels is a potential example of violating the well-known problem, the additivity problem. We determine the cases where their minimal output entropy is not zero, and obtain some partial results on the fulfillment of their entanglement breaking property. We find a bound of the minimal output entropy of the tensor product of two SU(2) -irreducibly covariant channels. We also get an example of a positive map that is not completely positive.

•Jan 1, 2015•3 citations

Entanglement Fidelity in Standard Quantum Channels

Niccolò Zanieri, Marios Kountouris

Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator $ρ$, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.

quant-pharXiv:2603.07761•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 10, 2026•0 citations

Entanglement Breaking Structure of Cartan-Covariant Quantum Channels

Sean Prudhoe

Cartan-covariant quantum channels are introduced and studied using the Choi-Jamiołkowski isomorphism. The channels are Cartan-covariant as the covariance groups considered form symmetric pairs with the special unitary group SU($n$), and their associated Cartan involution provides a route to exactly compute the eigenspectrum of their Choi states and the partial transpose for any $n\in \mathbb{N}$. These channels include previously studied SO$(n)$-covariant channels, and further include Sp$(\frac{n}{2})$-covariant channels (when $n$ is even) and S(U($p$) $\times$ U($q$))-covariant channels (where $n\!=\!p\!+\!q$). We show that all Cartan-covariant channels satisfy the PPT$^{2}$-conjecture and further demonstrate the nontrivial nature of this result for the class of Sp$(\frac{n}{2})$-covariant and ${\rm S}({\rm U}(p) \!\times\!{\rm U}(q))$-covariant channels

arXiv:2501.03959•Jan 7, 2025•4 citations

The extreme points of SU(2)-irreducibly covariant channels

Muneerah Al Nuwairan

In this paper, we introduce EPOSIC channels, a class of SU(2)-covariant quantum channels. For each of them, we give a Kraus representation, its Choi matrix, a complementary channel, and its dual map. We show that they are the extreme points of all SU(2)-irreducibly covariant channels. As an application of these channels, we get an example of a positive map that is not completely positive.

arXiv:1306.5321•International Journal of Mathematics•Apr 21, 2014•28 citations

Approximate quantum error correction, covariance symmetry, and their relation

Hao Dai

To perform reliable quantum computation, quantum error correction is indispensable. In certain cases, continuous covariance symmetry of the physical system can make exact error correction impossible. In this work we study the approximate error correction and covariance symmetry from the information-theoretic perspective. For general encoding and noise channels, we define a quantity named infidelity to characterize the performance of the approximate quantum error correction and quantify the noncovariance of an encoding channel with respect to a general Lie group from the asymmetry measure of the corresponding Choi state. In particular, when the encoding channel is isometric, we derive a trade-off relation between infidelity and noncovariance. Furthermore, we calculate the average infidelity and noncovariance measure for a type of random code.

arXiv:2305.02162•Physical Review A•Jul 24, 2023•2 citations

Semidefinite Programming for Optimal Quantum Cloning: A Computational Framework

Jörg Hettel

While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that reformulates cloning optimization as a search over completely positive trace-preserving maps using the Choi-Jamiolkowski isomorphism and Semidefinite Programming. The framework (i) numerically certifies global optimality through primal-dual strong duality and (ii) automatically extracts operational Kraus operators from the optimal Choi matrix via spectral decomposition. We systematically treat universal, phase-covariant, asymmetric, and entanglement cloning scenarios, providing -for the first time - a unified computational catalogue of explicit, implementable Kraus representations across all major cloning families, including higher-order processes and arbitrary input state distributions. As an application, we analyse optimal cloning attacks on BB84 under depolarizing noise, demonstrating how the extracted operators enable quantitative security analysis in realistic noisy quantum channels. An open-source implementation enables community validation and extension.

quant-pharXiv:2605.21274•May 21, 2026•1 citation
We present a complete characterization of quantum channels covariant under the action of SU(2), a symmetry that arises naturally across a wide range of physical settings. By exploiting the constraints imposed by rotational symmetry, we derive the spectral decomposition of the associated Choi–Jamiołkowski operators and obtain explicit closed-form expressions for the corresponding Kraus operators. This unified framework provides a systematic approach to analyzing the structure and dynamics of SU(2)-covariant noise, with direct applications to quantum communication, information processing, and symmetry-constrained quantum protocols.
In this thesis, we introduce EPOSIC channels, a class of SU(2) -covariant quantum channels. For each of them, we give a Stinespring representation, a Kraus representation, its Choi matrix, a complementary channel, and its dual map. We show that these channels are the extreme points of all SU(2) -irreducibly covariant channels. As an application of these channels to the theory of quantum information, we study the minimal output entropy of EPOSIC channels, and show that a large class of these channels is a potential example of violating the well-known problem, the additivity problem. We determine the cases where their minimal output entropy is not zero, and obtain some partial results on the fulfillment of their entanglement breaking property. We find a bound of the minimal output entropy of the tensor product of two SU(2) -irreducibly covariant channels. We also get an example of a positive map that is not completely positive.
Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator ρρρ, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.
Cartan-covariant quantum channels are introduced and studied using the Choi-Jamiołkowski isomorphism. The channels are Cartan-covariant as the covariance groups considered form symmetric pairs with the special unitary group SU(nnn), and their associated Cartan involution provides a route to exactly compute the eigenspectrum of their Choi states and the partial transpose for any n∈Nn\in \mathbb{N}n∈N. These channels include previously studied SO(n)(n)(n)-covariant channels, and further include Sp(n2)(\frac{n}{2})(2n​)-covariant channels (when nnn is even) and S(U(ppp) ×\times× U(qqq))-covariant channels (where n ⁣= ⁣p ⁣+ ⁣qn\!=\!p\!+\!qn=p+q). We show that all Cartan-covariant channels satisfy the PPT2^{2}2-conjecture and further demonstrate the nontrivial nature of this result for the class of Sp(n2)(\frac{n}{2})(2n​)-covariant and S(U(p) ⁣× ⁣U(q)){\rm S}({\rm U}(p) \!\times\!{\rm U}(q))S(U(p)×U(q))-covariant channels
To perform reliable quantum computation, quantum error correction is indispensable. In certain cases, continuous covariance symmetry of the physical system can make exact error correction impossible. In this work we study the approximate error correction and covariance symmetry from the information-theoretic perspective. For general encoding and noise channels, we define a quantity named infidelity to characterize the performance of the approximate quantum error correction and quantify the noncovariance of an encoding channel with respect to a general Lie group from the asymmetry measure of the corresponding Choi state. In particular, when the encoding channel is isometric, we derive a trade-off relation between infidelity and noncovariance. Furthermore, we calculate the average infidelity and noncovariance measure for a type of random code.
While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that reformulates cloning optimization as a search over completely positive trace-preserving maps using the Choi-Jamiolkowski isomorphism and Semidefinite Programming. The framework (i) numerically certifies global optimality through primal-dual strong duality and (ii) automatically extracts operational Kraus operators from the optimal Choi matrix via spectral decomposition. We systematically treat universal, phase-covariant, asymmetric, and entanglement cloning scenarios, providing -for the first time - a unified computational catalogue of explicit, implementable Kraus representations across all major cloning families, including higher-order processes and arbitrary input state distributions. As an application, we analyse optimal cloning attacks on BB84 under depolarizing noise, demonstrating how the extracted operators enable quantitative security analysis in realistic noisy quantum channels. An open-source implementation enables community validation and extension.