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

Coherent Classical Communication

Aram W. Harrow

Published Jul 12, 2003• 7 citations
OpenAlex

Abstract

We introduce the concept of coherent classical communication and use it to relate other resources in quantum information theory. Using coherent classical communication, we are able to generalize super-dense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulae for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.

Related papers

Coherent Communication of Classical Messages

Aram W. Harrow

We define coherent communication in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory. Using coherent communication, we are able to generalize superdense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulas for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.

arXiv:quant-ph/0307091•Physical Review Letters•Mar 5, 2004•108 citations

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

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. 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 which the channel's coherent information (Section 12.5) is an achievable rate for quantum communication. This sequence of steps demonstrates an alternate proof of the direct part of the quantum channel coding theorem stated in Chapter 23. 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.

Cambridge University Press eBooks•Apr 18, 2013•0 citations

The classical capacity of a quantum dense coding system

Masashi Ban, Sachiko Kitajima, Fumiaki Shibata

Quantum dense coding transmits classical information by sending a quantum system with the assistance of quantum entanglement. The classical information capacity of a quantum dense coding system is obtained, where a sender and receiver share a completely entangled state and a quantum system encoded by applying unitary operators is sent through an arbitrary quantum channel. The result is compared with that obtained in another setting.

Journal of Physics A Mathematical and General•Aug 18, 2004•5 citations

Nonoptimality of unitary encoding with quantum channels assisted by entanglement

Michael R. Beran, Scott M. Cohen

One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.

arXiv:0807.4552•Physical Review A•Dec 23, 2008•10 citations

Distributed Quantum Dense Coding

Dagmar Bruß, Giacomo Mauro D’Ariano, Maciej Lewenstein +3 more

We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

arXiv:quant-ph/0407037•Physical Review Letters•Nov 19, 2004•174 citations
We introduce the concept of coherent classical communication and use it to relate other resources in quantum information theory. Using coherent classical communication, we are able to generalize super-dense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulae for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.
We define coherent communication in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory. Using coherent communication, we are able to generalize superdense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulas for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.
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.
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. 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 which the channel's coherent information (Section 12.5) is an achievable rate for quantum communication. This sequence of steps demonstrates an alternate proof of the direct part of the quantum channel coding theorem stated in Chapter 23. 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.
One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.
We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.