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

Theoretical and Natural Science

Quantum Cost of Dense Coding of Noisy and Multiple Use of Bell Channels

Tianlang Xing

Published Jan 15, 2025• 0 citations
Publisher

Abstract

Dense coding is a basic protocol for quantum information transfer. We study the noisy and multi-use of quantum channels for dense coding protocols. For this purpose, we replace the standard channel, namely the EPR pair by a noisy two-qubit pure state. We construct the measurement Alice carries out to encode her message to be transferred to Bob. It turns out that the resulting states are not all orthogonal, and we propose a probability function for success transfer. We mathematically maximize the function in terms of the quantum measurements taken by Bob. We further develop the protocol to multi-use channels, and investigate the probability function for success transfer.

DOI
10.54254/2753-8818/2025.20021

Related papers

Coherent Communication with Noisy Resources

Mark M. Wilde

This chapter demonstrates the power of both coherent communication from Chapter 7 and the particular protocol for entanglement-assisted classical coding from the previous chapter. Recall that coherent dense coding is a version of the dense coding protocol in which the sender and receiver perform all of its steps coherently.1 Since our protocol for entanglement-assisted classical coding from the previous chapter is really just a glorified dense coding protocol, the sender and receiver can perform each of its steps coherently, generating a protocol for entanglement-assisted coherent coding. Then, by exploiting the fact that two coherent bits are equivalent to a qubit and an ebit, we obtain a protocol for entanglement-assisted quantum coding that consumes far less entanglement than a naive strategy would in order to accomplish this task. We next combine this entanglement-assisted quantum coding protocol with entanglement distribution (Section 6.2.1) and obtain a protocol for quantum communication at a rate equal to the channel's coherent information (Section 13.5). This sequence of steps demonstrates an alternate proof of the direct part of the quantum capacity theorem stated in Chapter 24. Entanglement-assisted classical communication is one generalization of superdense coding, in which the noiseless qubit channel becomes an arbitrary noisy quantum channel while the noiseless ebits remain noiseless. Another generalization of super-dense coding is a protocol named noisy super-dense coding , in which the shared entanglement becomes a shared noisy state ρ AB and the noiseless qubit channels remain noiseless. Interestingly, the protocol that we employ in this chapter for noisy super-dense coding is essentially equivalent to the protocol from the previous chapter for entanglement-assisted classical communication, with some slight modifications to account for the different setting. We can also construct a coherent version of noisy super-dense coding, leading to a protocol that we name coherent state transfer . Coherent state transfer accomplishes not only the task of generating coherent communication between Alice and Bob, but it also allows Alice to transfer her share of the state ρ AB to Bob.

Cambridge University Press eBooks•Nov 2, 2016•0 citations

On Quantum Dense Coding for Bipartite Systems

Yaokun Liu

Quantum communication, as a vital area of quantum information science, aims to leverage quantum phenomena—particularly entanglement—to achieve tasks that are impossible or inefficient in classical systems. It plays a key role in the development of secure communication protocols and advanced information processing. This paper focuses on one such protocol, dense coding, which enables the transmission of two classical bits using only one entangled quantum particle.”We introduce the mathematical and physical foundations of quantum communication, such as the entangled state and Kronecker product. Then we propose the quantum communication protocol, namely dense coding using Bell states. It offer unique advantages that are beyond the classical parts. For this purpose, we in detail analyze the quantum measurements using Pauli gates and identity matrix, as well as the transmission of particle from Alice to Bob. They are necessary steps for dense coding. Then we analyze how Bob finishes the protocol using measurement over two qubits.

Theoretical and Natural Science•Sep 24, 2025•0 citations

Dense coding capacity of a quantum channel

Riccardo Laurenza, Cosmo Lupo, Seth Lloyd +1 more

We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.

•Jan 1, 2020•23 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•13 citations

Multipartite dense coding versus quantum correlation: Noise inverts relative capability of information transfer

Tamoghna Das, R. Prabhu, Aditi Sen +1 more

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Applications of quantum channels are most likely to be commercially important only in the multiparty regime, where such a correspondence does not exist even for pure quantum states. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of arbitrary number of qubits are the same as those of the corresponding generalized Greenberger-Horne-Zeilinger state, then the multipartite dense coding capability of the former is the same as or better than that of the generalized Greenberger-Horne-Zeilinger state. Interestingly, in a noisy-channel scenario, where we consider both uncorrelated and correlated noise models, the relative abilities of the quantum channels to transfer classical information can get inverted by administration of a sufficient amount of noise. When the shared state is an arbitrary multipartite mixed state, we also establish a link between the classical capacity for the noiseless case and multipartite quantum correlation measures.

arXiv:1404.4559•Physical Review A•Aug 18, 2014•24 citations
Dense coding is a basic protocol for quantum information transfer. We study the noisy and multi-use of quantum channels for dense coding protocols. For this purpose, we replace the standard channel, namely the EPR pair by a noisy two-qubit pure state. We construct the measurement Alice carries out to encode her message to be transferred to Bob. It turns out that the resulting states are not all orthogonal, and we propose a probability function for success transfer. We mathematically maximize the function in terms of the quantum measurements taken by Bob. We further develop the protocol to multi-use channels, and investigate the probability function for success transfer.
This chapter demonstrates the power of both coherent communication from Chapter 7 and the particular protocol for entanglement-assisted classical coding from the previous chapter. Recall that coherent dense coding is a version of the dense coding protocol in which the sender and receiver perform all of its steps coherently.1 Since our protocol for entanglement-assisted classical coding from the previous chapter is really just a glorified dense coding protocol, the sender and receiver can perform each of its steps coherently, generating a protocol for entanglement-assisted coherent coding. Then, by exploiting the fact that two coherent bits are equivalent to a qubit and an ebit, we obtain a protocol for entanglement-assisted quantum coding that consumes far less entanglement than a naive strategy would in order to accomplish this task. We next combine this entanglement-assisted quantum coding protocol with entanglement distribution (Section 6.2.1) and obtain a protocol for quantum communication at a rate equal to the channel's coherent information (Section 13.5). This sequence of steps demonstrates an alternate proof of the direct part of the quantum capacity theorem stated in Chapter 24. Entanglement-assisted classical communication is one generalization of superdense coding, in which the noiseless qubit channel becomes an arbitrary noisy quantum channel while the noiseless ebits remain noiseless. Another generalization of super-dense coding is a protocol named noisy super-dense coding , in which the shared entanglement becomes a shared noisy state ρ AB and the noiseless qubit channels remain noiseless. Interestingly, the protocol that we employ in this chapter for noisy super-dense coding is essentially equivalent to the protocol from the previous chapter for entanglement-assisted classical communication, with some slight modifications to account for the different setting. We can also construct a coherent version of noisy super-dense coding, leading to a protocol that we name coherent state transfer . Coherent state transfer accomplishes not only the task of generating coherent communication between Alice and Bob, but it also allows Alice to transfer her share of the state ρ AB to Bob.
Quantum communication, as a vital area of quantum information science, aims to leverage quantum phenomena—particularly entanglement—to achieve tasks that are impossible or inefficient in classical systems. It plays a key role in the development of secure communication protocols and advanced information processing. This paper focuses on one such protocol, dense coding, which enables the transmission of two classical bits using only one entangled quantum particle.”We introduce the mathematical and physical foundations of quantum communication, such as the entangled state and Kronecker product. Then we propose the quantum communication protocol, namely dense coding using Bell states. It offer unique advantages that are beyond the classical parts. For this purpose, we in detail analyze the quantum measurements using Pauli gates and identity matrix, as well as the transmission of particle from Alice to Bob. They are necessary steps for dense coding. Then we analyze how Bob finishes the protocol using measurement over two qubits.
We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.
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 highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Applications of quantum channels are most likely to be commercially important only in the multiparty regime, where such a correspondence does not exist even for pure quantum states. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of arbitrary number of qubits are the same as those of the corresponding generalized Greenberger-Horne-Zeilinger state, then the multipartite dense coding capability of the former is the same as or better than that of the generalized Greenberger-Horne-Zeilinger state. Interestingly, in a noisy-channel scenario, where we consider both uncorrelated and correlated noise models, the relative abilities of the quantum channels to transfer classical information can get inverted by administration of a sufficient amount of noise. When the shared state is an arbitrary multipartite mixed state, we also establish a link between the classical capacity for the noiseless case and multipartite quantum correlation measures.