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:2204.04493 · Journal of Mathematical Physics

Entanglement-invertible channels

Dominic Verdon

Published Jun 1, 2024• 5 citations
arXivHTMLPDF

Abstract

In a well-known result [R. Werner, J. Phys. A: Math. Gen. 34(35), 7081 (2001)], Werner classified all tight quantum teleportation and dense coding schemes, showing that they correspond to unitary error bases. Here tightness is a certain dimensional restriction: the quantum system to be teleported and the entangled resource must be of dimension d, and the measurement must have d2 outcomes. Here we generalise this classification so as to remove the dimensional restriction altogether, thereby resolving an open problem raised in that work. In fact, we classify not just teleportation and dense coding schemes, but entanglement-reversible channels. These are channels between finite-dimensional C*-algebras which are reversible with the aid of an entangled resource state, generalising ordinary reversibility of a channel. We show that such channels correspond to families of linear maps which are bi-isometric with respect to a duality defined by the resource state. In particular, in Werner’s classification, a bijective correspondence between tight teleportation and dense coding schemes was shown: swapping Alice and Bob’s operations turns a teleportation scheme into a dense coding scheme and vice versa. We observe that this property generalises ordinary invertibility of a channel; we call it entanglement-invertibility. We show that entanglement-invertible channels are precisely the quantum bijections previously studied in noncommutative topology [B. Musto et al., J. Math. Phys. 59(8), 081706 (2018)], and therefore admit a classification in terms of Wang’s quantum permutation group [S. Wang, Commun. Math. Phys. 195, 195–211 (1998)].

DOI
10.1063/5.0159504

Related papers

Entanglement-equivalences of covariant channels

Dominic Verdon

We define two channels N and N' to be entanglement-equivalent if there exists an entanglement-assisted channel coding scheme for N from N' and vice versa. For example, the noiseless channel on a d^2-level classical system and the noiseless channel on a d-dimensional quantum system are entanglement-equivalent by teleportation and dense coding. We provide a construction of entanglement-equivalences of channels based on the principle of covariance. Let G be a compact quantum group of Kac type, let F': Rep(G) -> Hilb be a fibre functor accessible from the canonical fibre functor F: Rep(G) -> Hilb by a unitary pseudonatural transformation, and let G' be the compact quantum group of Kac type obtained from the fibre functor F' by Tannaka duality. Then for any G-covariant channel N we construct a G'-covariant channel N' and entanglement-assisted channel coding schemes witnessing an entanglement-equivalence of N and N'. This construction induces an equivalence of categories E: Chan(G) -> Chan(G'), where Chan(G) is the category whose objects are G-C*-algebras and whose morphisms are covariant channels. We show that all tight teleportation and dense coding schemes are a special case of our construction, using covariance for the action of the quantum permutation group of the algebra M_d(\mathbb{C}). Where G is a finite abelian group, we explicitly compute the effect of the equivalence E on algebras and channels. We thereby produce concrete new examples of entanglement-equivalences of channels in the case where G=Z_2 \times Z_2 and the noncanonical fibre functor is specified by the Pauli matrices.

•Dec 10, 2020•2 citations

All teleportation and dense coding schemes

R F Werner

We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert–Schmidt scalar product and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be `tight' in the sense that all Hilbert spaces involved have the same finite dimension d , and the classical channel involved distinguishes d 2 signals. A general construction procedure for orthonormal bases of unitaries, involving Latin squares and complex Hadamard matrices is also presented.

arXiv:quant-ph/0003070•Journal of Physics A Mathematical and General•Aug 24, 2001•312 citations

All Teleportation and Dense Coding Schemes

R. F. Werner

We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert-Schmidt scalar product, and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be ``tight'' in the sense that all Hilbert spaces involved have the same finite dimension d, and the classical channel involved distinguishes d^2 signals. A general construction procedure for orthonormal bases of unitaries, involving Latin Squares and complex Hadamard Matrices is also presented.

•Mar 17, 2000•267 citations

On the Duality of Teleportation and Dense Coding

Eric Chitambar, Felix Leditzky

Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•2 citations

On the Duality of Teleportation and Dense Coding

Eric Chitambar, Felix Leditzky

Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.

arXiv:2302.14798•IEEE Transactions on Information Theory•Nov 13, 2023•18 citations

Teleportation of entangled states and dense coding using a multiparticle quantum channel

В. Н. Горбачев, Andrew I. Trubilko, A. I. Zhiliba +1 more

A set of protocols for teleportation and dense coding tasks with the use of a N particle quantum channel, presented by entangled states of the GHZ class, is introduced, when N>2. Using a found representation for the multiparticle entangled states of the GHZ class, it has shown, that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is N/N-1. If N>2 there is no one - to -one correspondence between teleportation and dense coding schemes in comparison with the EPR channel is exploited. A set of schemes, for which two additional operations as entanglement and disentanglement are permitted, is considered.

arXiv:quant-ph/0011124•Nov 30, 2000•20 citations
In a well-known result [R. Werner, J. Phys. A: Math. Gen. 34(35), 7081 (2001)], Werner classified all tight quantum teleportation and dense coding schemes, showing that they correspond to unitary error bases. Here tightness is a certain dimensional restriction: the quantum system to be teleported and the entangled resource must be of dimension d, and the measurement must have d2 outcomes. Here we generalise this classification so as to remove the dimensional restriction altogether, thereby resolving an open problem raised in that work. In fact, we classify not just teleportation and dense coding schemes, but entanglement-reversible channels. These are channels between finite-dimensional C*-algebras which are reversible with the aid of an entangled resource state, generalising ordinary reversibility of a channel. We show that such channels correspond to families of linear maps which are bi-isometric with respect to a duality defined by the resource state. In particular, in Werner’s classification, a bijective correspondence between tight teleportation and dense coding schemes was shown: swapping Alice and Bob’s operations turns a teleportation scheme into a dense coding scheme and vice versa. We observe that this property generalises ordinary invertibility of a channel; we call it entanglement-invertibility. We show that entanglement-invertible channels are precisely the quantum bijections previously studied in noncommutative topology [B. Musto et al., J. Math. Phys. 59(8), 081706 (2018)], and therefore admit a classification in terms of Wang’s quantum permutation group [S. Wang, Commun. Math. Phys. 195, 195–211 (1998)].
We define two channels N and N' to be entanglement-equivalent if there exists an entanglement-assisted channel coding scheme for N from N' and vice versa. For example, the noiseless channel on a d^2-level classical system and the noiseless channel on a d-dimensional quantum system are entanglement-equivalent by teleportation and dense coding. We provide a construction of entanglement-equivalences of channels based on the principle of covariance. Let G be a compact quantum group of Kac type, let F': Rep(G) -> Hilb be a fibre functor accessible from the canonical fibre functor F: Rep(G) -> Hilb by a unitary pseudonatural transformation, and let G' be the compact quantum group of Kac type obtained from the fibre functor F' by Tannaka duality. Then for any G-covariant channel N we construct a G'-covariant channel N' and entanglement-assisted channel coding schemes witnessing an entanglement-equivalence of N and N'. This construction induces an equivalence of categories E: Chan(G) -> Chan(G'), where Chan(G) is the category whose objects are G-C*-algebras and whose morphisms are covariant channels. We show that all tight teleportation and dense coding schemes are a special case of our construction, using covariance for the action of the quantum permutation group of the algebra M_d(\mathbb{C}). Where G is a finite abelian group, we explicitly compute the effect of the equivalence E on algebras and channels. We thereby produce concrete new examples of entanglement-equivalences of channels in the case where G=Z_2 \times Z_2 and the noncanonical fibre functor is specified by the Pauli matrices.
We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert–Schmidt scalar product and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be `tight' in the sense that all Hilbert spaces involved have the same finite dimension d , and the classical channel involved distinguishes d 2 signals. A general construction procedure for orthonormal bases of unitaries, involving Latin squares and complex Hadamard matrices is also presented.
We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert-Schmidt scalar product, and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be ``tight'' in the sense that all Hilbert spaces involved have the same finite dimension d, and the classical channel involved distinguishes d^2 signals. A general construction procedure for orthonormal bases of unitaries, involving Latin Squares and complex Hadamard Matrices is also presented.
Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.
Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.
A set of protocols for teleportation and dense coding tasks with the use of a N particle quantum channel, presented by entangled states of the GHZ class, is introduced, when N>2. Using a found representation for the multiparticle entangled states of the GHZ class, it has shown, that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is N/N-1. If N>2 there is no one - to -one correspondence between teleportation and dense coding schemes in comparison with the EPR channel is exploited. A set of schemes, for which two additional operations as entanglement and disentanglement are permitted, is considered.