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

Journal of Experimental and Theoretical Physics Letters

Real-time coding in a parallel quantum communication channel

S. N. Molotkov

Published Jan 1, 2003• 1 citation
Publisher

Abstract

Coding theorems formulated as exchange protocols in the space of states of quantum systems do not answer one of the basic questions of real-time information transmission rate. Expressions obtained for the transmission capacity of a binary quantum communication channel describe the real-time information transmission rate.
DOI
10.1134/1.1561981

Related papers

On the transmission rate of classical information through quantum communication channels

S. N. Molotkov

The coding of quantum communication channels in real time is considered as applied to the situation when information is coded into continuous quantum degrees of freedom (into the shape of the amplitude of quantum states with an arbitrary number of photons). It is shown that the nonlocalizability of states in quantum field theory requires that the identity of particles should be taken into account. This, together with the finiteness of the limit speed of propagation, leads to the fact that the formulas for the transmission rate of nonrelativistic communication channels have an asymptotic character; i.e., these formulas are formally valid only when the separation between messages is infinite (when the identity of particles can be neglected) and, hence, when the transmission rate in [bit/message s] is infinitely small. A real-time information capacity of a sequential relativistic quantum communication channel is obtained that takes into account the identity of particles for pure signal states with an arbitrary number of photons. An explicit analytic expression is obtained for the transmission rate of a quantum channel of finite bandwidth for one-photon input states.

Journal of Experimental and Theoretical Physics•Feb 1, 2004•0 citations

Trading Resources for Communication

Mark M. Wilde

This chapter unifies all of the channel coding theorems that we have studied in this book. One of the most general information-processing tasks that a sender and receiver can accomplish is to transmit classical and quantum information and generate entanglement with many independent uses of a quantum channel and with the assistance of classical communication, quantum communication, and shared entanglement. The resulting rates for communication are net rates that give the generation rate of a resource less its consumption rate. Since we have three resources, all achievable rates are rate triples ( C, Q, E ) that lie in a three-dimensional capacity region, where C is the net rate of classical communication, Q is the net rate of quantum communication, and E is the net rate of entanglement consumption/generation. The capacity theorem for this general scenario is known as the quantum dynamic capacity theorem, and it is the main theorem that we prove in this chapter. All of the rates given in the channel coding theorems of previous chapters are special points in this three-dimensional capacity region. The proof of the quantum dynamic capacity theorem comes in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the strategy for achieving any point in the three-dimensional capacity region is remarkably simple: we just combine the protocol from Corollary 21.5.3 for entanglement-assisted classical and quantum communication with the three unit protocols of teleportation, super-dense coding, and entanglement distribution.

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

Trading Resources for Communication

Mark M. Wilde

This chapter unifies all of the channel coding theorems that we have studied in this book. One of the most general information-processing tasks that a sender and receiver can accomplish is to transmit classical and quantum information and generate entanglement with many independent uses of a quantum channel and with the assistance of classical communication, quantum communication, and shared entanglement.1 The resulting rates for communication are net rates that give the generation rate of a resource less its consumption rate. Since we have three resources, all achievable rates are rate triples ( C,Q,E ) that lie in a three-dimensional capacity region, where C is the net rate of classical communication, Q is the net rate of quantum communication, and E is the net rate of entanglement consumption/generation. The capacity theorem for this general scenario is known as the quantum dynamic capacity theorem, and it is the main theorem that we prove in this chapter. All of the rates given in the channel coding theorems of previous chapters are special points in this three-dimensional capacity region. The proof of the quantum dynamic capacity theorem comes in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the strategy for achieving any point in the three-dimensional capacity region is remarkably simple: we just combine the protocol from Corollary 22.5.2 for entanglement-assisted classical and quantum communication with the three unit protocols of teleportation, super-dense coding, and entanglement distribution. The interpretation of the achievable rate region is that it is the unit resource capacity region from Chapter 8 translated along the points achievable with the protocol from Corollary 22.5.2. In the proof of the converse theorem, we analyze the most general protocol that can consume and generate classical communication, quantum communication, and entanglement along with the consumption of many independent uses of a quantum channel, and we show that the net rates for such a protocol are bounded by the regularization of the achievable rate region.

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

Information Transmission in a Quantum Channel

JSC «Nevskoye Design Bureau», D. E. Vorobyova

Currently, quantum key generation systems are considered as the basis of quantum telecommunications using quantum cryptography. At the same time, concepts are substituted: such a system simply generates the same binary code on two sides of the quantum channel and does not allow data to be transmitted as in the communication channel. In the future, such a key is used by a classical cryptographic system in a conventional communication channel. The low rate of generation of a quantum key requires its accumulation, which deprives this key of authentication – as soon as once it is presented as a file, it can be replaced. Nevertheless, the steady increase in the generation rate makes it possible to use a quantum key for direct secure transmission of information in a quantum channel «bit to bit» with any quantum protocol and physical implementation. The method of such transfer is discussed in this article.

LETI Transactions on Electrical Engineering & Computer Science•Jan 1, 2023•0 citations

Quantum coding theorems

Alexander Semenovich Holevo

Contents I. Introduction II. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversion III. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropy IV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography

arXiv:quant-ph/9809023•Russian Mathematical Surveys•Dec 31, 1998•226 citations

Better transmission with lower capacity: lossy compression over quantum channels

Sristy Agrawal, Rajashik Tarafder, Graeme Smith +2 more

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication in the classical regime. Lossy compression scenarios require the additional description provided by rate-distortion theory, which characterizes the trade-off between compression rate and the distortion of the compressed signal. Even in this context, the capacity characterizes the usefulness of a channel -- a channel with more capacity will always outperform a channel with less capacity. We show that this is no longer true when sending classical information over a quantum channel. In particular, we find a pair of quantum channels where the channel with the lower capacity causes less distortion than the higher capacity channel when both are used at a fixed rate.

arXiv:2105.06617•May 14, 2021•1 citation
The coding of quantum communication channels in real time is considered as applied to the situation when information is coded into continuous quantum degrees of freedom (into the shape of the amplitude of quantum states with an arbitrary number of photons). It is shown that the nonlocalizability of states in quantum field theory requires that the identity of particles should be taken into account. This, together with the finiteness of the limit speed of propagation, leads to the fact that the formulas for the transmission rate of nonrelativistic communication channels have an asymptotic character; i.e., these formulas are formally valid only when the separation between messages is infinite (when the identity of particles can be neglected) and, hence, when the transmission rate in [bit/message s] is infinitely small. A real-time information capacity of a sequential relativistic quantum communication channel is obtained that takes into account the identity of particles for pure signal states with an arbitrary number of photons. An explicit analytic expression is obtained for the transmission rate of a quantum channel of finite bandwidth for one-photon input states.
This chapter unifies all of the channel coding theorems that we have studied in this book. One of the most general information-processing tasks that a sender and receiver can accomplish is to transmit classical and quantum information and generate entanglement with many independent uses of a quantum channel and with the assistance of classical communication, quantum communication, and shared entanglement. The resulting rates for communication are net rates that give the generation rate of a resource less its consumption rate. Since we have three resources, all achievable rates are rate triples ( C, Q, E ) that lie in a three-dimensional capacity region, where C is the net rate of classical communication, Q is the net rate of quantum communication, and E is the net rate of entanglement consumption/generation. The capacity theorem for this general scenario is known as the quantum dynamic capacity theorem, and it is the main theorem that we prove in this chapter. All of the rates given in the channel coding theorems of previous chapters are special points in this three-dimensional capacity region. The proof of the quantum dynamic capacity theorem comes in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the strategy for achieving any point in the three-dimensional capacity region is remarkably simple: we just combine the protocol from Corollary 21.5.3 for entanglement-assisted classical and quantum communication with the three unit protocols of teleportation, super-dense coding, and entanglement distribution.
This chapter unifies all of the channel coding theorems that we have studied in this book. One of the most general information-processing tasks that a sender and receiver can accomplish is to transmit classical and quantum information and generate entanglement with many independent uses of a quantum channel and with the assistance of classical communication, quantum communication, and shared entanglement.1 The resulting rates for communication are net rates that give the generation rate of a resource less its consumption rate. Since we have three resources, all achievable rates are rate triples ( C,Q,E ) that lie in a three-dimensional capacity region, where C is the net rate of classical communication, Q is the net rate of quantum communication, and E is the net rate of entanglement consumption/generation. The capacity theorem for this general scenario is known as the quantum dynamic capacity theorem, and it is the main theorem that we prove in this chapter. All of the rates given in the channel coding theorems of previous chapters are special points in this three-dimensional capacity region. The proof of the quantum dynamic capacity theorem comes in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the strategy for achieving any point in the three-dimensional capacity region is remarkably simple: we just combine the protocol from Corollary 22.5.2 for entanglement-assisted classical and quantum communication with the three unit protocols of teleportation, super-dense coding, and entanglement distribution. The interpretation of the achievable rate region is that it is the unit resource capacity region from Chapter 8 translated along the points achievable with the protocol from Corollary 22.5.2. In the proof of the converse theorem, we analyze the most general protocol that can consume and generate classical communication, quantum communication, and entanglement along with the consumption of many independent uses of a quantum channel, and we show that the net rates for such a protocol are bounded by the regularization of the achievable rate region.
Currently, quantum key generation systems are considered as the basis of quantum telecommunications using quantum cryptography. At the same time, concepts are substituted: such a system simply generates the same binary code on two sides of the quantum channel and does not allow data to be transmitted as in the communication channel. In the future, such a key is used by a classical cryptographic system in a conventional communication channel. The low rate of generation of a quantum key requires its accumulation, which deprives this key of authentication – as soon as once it is presented as a file, it can be replaced. Nevertheless, the steady increase in the generation rate makes it possible to use a quantum key for direct secure transmission of information in a quantum channel «bit to bit» with any quantum protocol and physical implementation. The method of such transfer is discussed in this article.
Contents I. Introduction II. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversion III. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropy IV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography
Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication in the classical regime. Lossy compression scenarios require the additional description provided by rate-distortion theory, which characterizes the trade-off between compression rate and the distortion of the compressed signal. Even in this context, the capacity characterizes the usefulness of a channel -- a channel with more capacity will always outperform a channel with less capacity. We show that this is no longer true when sending classical information over a quantum channel. In particular, we find a pair of quantum channels where the channel with the lower capacity causes less distortion than the higher capacity channel when both are used at a fixed rate.