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:1302.3118 · Quantum Information Processing

The Correlation Conversion property of quantum channels

László Gyöngyösi

Published Oct 31, 2013• 19 citations
arXivHTMLPDF
DOI
10.1007/s11128-013-0663-0

Related papers

The correlation conversion property of quantum channels: distillable entanglement from classical correlation

László Gyöngyösi, Sándor Imre

Transmission of quantum entanglement will play a crucial role in future networks and long-distance quantum communications. Quantum Key Distribution, the working mechanism of quantum repeaters and the various quantum communication protocols are all based on quantum entanglement. To share entanglement between distant points, high fidelity quantum channels are needed. In practice, these communication links are noisy, which makes it impossible or extremely difficult and expensive to distribute entanglement. In this work we first show that quantum entanglement can be generated by a new idea, exploiting the most natural effect of the communication channels: the noise itself of the link. We prove that the noise transformation of quantum channels that are not able to transmit quantum entanglement can be used to generate distillable (useable) entanglement from classically correlated input. We call this new phenomenon the Correlation Conversion property (CC-property) of quantum channels. The proposed solution does not require any nonlocal operation or local measurement by the parties, only the use of standard quantum channels. Our results have implications and consequences for the future of quantum communications, and for global-scale quantum communication networks. The discovery also revealed that entanglement generation by local operations is possible.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2013•4 citations

Correlation and Information in Quantum Channels

Masashi Ban

International Journal of Theoretical Physics•Feb 1, 2004•1 citation

Quantum correlation of optical-terahertz biphotons generated via spontaneous parametric down-conversion

A.A. Leontyev, Kirill A. Kuznetsov, A.M. Rudyak +2 more

We study the statistical properties of optical - terahertz biphotons generated by means of spontaneous parametric down conversion. Numerical dependence of the second-order correlation function is obtained depending on the frequency. Statistical distributions of the detector's readings in idler and signal channels are analyzed experimentally.

International Conference Laser Optics (ICLO)•Nov 2, 2020•0 citations

Coherence of quantum channels

Chandan Datta, Sk Sazim, Arun Kumar Pati +1 more

arXiv:1710.05015•Annals of Physics•Aug 23, 2018•30 citations

Finite Blocklength Converse Bounds for Quantum Channels

William Matthews, Stephanie Wehner

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.

arXiv:1210.4722•IEEE Transactions on Information Theory•Sep 8, 2014•101 citations

The Information of Quantum Channels

Mark M. Wilde

Cambridge University Press eBooks•Nov 2, 2016•0 citations
Transmission of quantum entanglement will play a crucial role in future networks and long-distance quantum communications. Quantum Key Distribution, the working mechanism of quantum repeaters and the various quantum communication protocols are all based on quantum entanglement. To share entanglement between distant points, high fidelity quantum channels are needed. In practice, these communication links are noisy, which makes it impossible or extremely difficult and expensive to distribute entanglement. In this work we first show that quantum entanglement can be generated by a new idea, exploiting the most natural effect of the communication channels: the noise itself of the link. We prove that the noise transformation of quantum channels that are not able to transmit quantum entanglement can be used to generate distillable (useable) entanglement from classically correlated input. We call this new phenomenon the Correlation Conversion property (CC-property) of quantum channels. The proposed solution does not require any nonlocal operation or local measurement by the parties, only the use of standard quantum channels. Our results have implications and consequences for the future of quantum communications, and for global-scale quantum communication networks. The discovery also revealed that entanglement generation by local operations is possible.
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.