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:1610.05190 · IEEE Transactions on Information Theory

Quantum Enhancement of Randomness Distribution

Raúl García−Patrón, William Matthews, Andreas Winter

Published Mar 30, 2018• 4 citations
arXivHTMLPDF

Abstract

The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this paper, we define randomness distribution capacities of quantum channels assisted by forward, back, or two-way classical communication and compare these to the corresponding communication capacities. With forward assistance or no assistance, we find that they are equal. We establish the mutual information of the channel as an upper bound on the two-way assisted randomness distribution capacity. This implies that all of the capacities are equal for classical-quantum channels. On the other hand, we show that the back-assisted randomness distribution capacity of a quantum-classical channel is equal to its mutual information. This is often strictly greater than the back-assisted communication capacity. We give an explicit example of such a separation where the randomness distribution protocol is noiseless.

DOI
10.1109/tit.2018.2821444

Related papers

Quantum Enhancement of Randomness Distribution

Raúl García−Patrón, William Matthews, Andreas Winter

The capability of a given channel to transmit information is, a priori, distinct from its capability to distribute random correlations. Despite that, for classical channels, the capacity to distribute information and randomness turns out to be the same, even with the assistance of auxiliary communication. In this work we show that this is no longer true for quantum channels when feedback is allowed. We prove this by constructing a channel that is noisy for the transmission of information but behaves as a virtual noiseless channel for randomness distribution when assisted by feedback communication. Our result can be seen as a way of unlocking quantum randomness internal to the channel.

Leibniz international proceedings in informatics•Jan 1, 2015•1 citation

Capacity of Quantum Erasure Channel Assisted by Backwards Classical Communication

Debbie Leung, Joungkeun Lim, Peter W. Shor

We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.

arXiv:0710.5943•Physical Review Letters•Dec 11, 2009•10 citations

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

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

The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.

arXiv:quant-ph/0106052•IEEE Transactions on Information Theory•Oct 1, 2002•721 citations

One-Shot Entanglement-Assisted Quantum and Classical Communication

Nilanjana Datta, Min-Hsiu Hsieh

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.

arXiv:1105.3321•IEEE Transactions on Information Theory•Nov 21, 2012•55 citations

Classical capacity of a noiseless quantum channel assisted by noisy entanglement

Michał Horodecki, Paweł Horodecki, Ryszard Horodecki +2 more

We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the sender's share of the noisy entanglement plays the role of mutual information in the completely classical case. A consequence of our results is that bound entangled states cannot increase the capacity of a noiseless quantum channel.

arXiv:quant-ph/0106080•Quantum Information and Computation•Oct 1, 2001•73 citations

Two-way quantum communication channels

Andrew M. Childs, Debbie Leung, Hoi‐Kwong Lo

We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.

•Jun 5, 2005•17 citations
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this paper, we define randomness distribution capacities of quantum channels assisted by forward, back, or two-way classical communication and compare these to the corresponding communication capacities. With forward assistance or no assistance, we find that they are equal. We establish the mutual information of the channel as an upper bound on the two-way assisted randomness distribution capacity. This implies that all of the capacities are equal for classical-quantum channels. On the other hand, we show that the back-assisted randomness distribution capacity of a quantum-classical channel is equal to its mutual information. This is often strictly greater than the back-assisted communication capacity. We give an explicit example of such a separation where the randomness distribution protocol is noiseless.
The capability of a given channel to transmit information is, a priori, distinct from its capability to distribute random correlations. Despite that, for classical channels, the capacity to distribute information and randomness turns out to be the same, even with the assistance of auxiliary communication. In this work we show that this is no longer true for quantum channels when feedback is allowed. We prove this by constructing a channel that is noisy for the transmission of information but behaves as a virtual noiseless channel for randomness distribution when assisted by feedback communication. Our result can be seen as a way of unlocking quantum randomness internal to the channel.
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.
The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.