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

WORLD SCIENTIFIC eBooks

INFORMATION TRANSMISSION

Published Apr 20, 2020• 0 citations
Publisher

Abstract

We describe here the most relevant classical and quantum communication scenarios and provide for them intuitive upper bounds on the information transmission capability. In Chapter 11, we will then show the achievability of these bounds through tools that will be developed in Chapter 10.
DOI
10.1142/9789811201554_0009

Related papers

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels

Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh +2 more

We aim to study the optimal rates of transmission of public and private classical information over a quantum channel in the most general channel model. To this end, we discuss a scenario in which a quantum channel is being used only once, i.e., one-shot regime is considered. A quantum channel can be used to send classical information (bits) either publicly or privately and for either case, one-shot bounds have been reported in the literature. This paper investigates the one-shot capacity capabilities of a quantum channel for simultaneous transmission of public and private information. We derive an achievable rate region in the form of a tradeoff between public and private rates. We also provide converse bounds assessing the tightness of our achievable rates. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•12 citations

Chapter 10. Transmission of quantum information

De Gruyter eBooks•Nov 27, 2012•0 citations

Upper and Lower Bounds on Quantum Codes

Graeme Stewart Baird Smith

This thesis provides bounds on the performance of quantum error correcting codes when used for quantum communication and quantum key distribution. The first two chapters provide a bare-bones introduction to classical and quantum error correcting codes, respectively. The next four chapters present achievable rates for quantum codes in various scenarios. The final chapter is dedicated to an upper bound on the quantum channel capacity. Chapter 3 studies coding for adversarial noise using quantum list codes, showing there exist quantum codes with high rates and short lists. These can be used, together with a very short secret key, to communicate with high fidelity at noise levels for which perfect fidelity is impossible. Chapter 4 explores the performance of a family of degenerate codes when used to communicate over Pauli channels, showing they can be used to communicate over almost any Pauli channel at rates that are impossible for a nondegenerate code and that exceed those of previously known degenerate codes. By studying the scaling of the optimal block length as a function of the channel's parameters, we develop a heuristic for designing even better codes. Chapter 5 describes an equivalence between a family of noisy preprocessing protocols for quantum key distribution and entanglement distillation protocols whose target state belongs to a class of private states called "twisted states." In Chapter 6, the codes of Chapter 4 are combined with the protocols of Chapter 5 to provide higher key rates for one-way quantum key distribution than were previously thought possible. Finally, Chapter 7 presents a new upper bound on the quantum channel capacity that is both additive and convex, and which can be interpreted as the capacity of the channel for communication given access to side channels from a class of zero capacity "cloning" channels. This "clone assisted capacity" is equal to the unassisted capacity for channels that are degradable, which we use to find new upper bounds on the capacity of a depolarizing channel.

•May 24, 2006•2 citations

Quantum communication

Joachim Stolze, Dieter Suter

This chapter contains sections titled: “Quantum only” tasks Information theory

Wiley eBooks•May 26, 2004•3 citations

Capacity Bounds for Quantum Communications through Quantum Trajectories

Angela Sara Cacciapuoti, Marcello Caleffi

In both classical and quantum Shannon's information theory, communication channels are generally assumed to combine through classical trajectories, so that the associated network path traversed by the information carrier is well-defined. Counter-intuitively, quantum mechanics enables a quantum information carrier to propagate through a quantum trajectory, i.e., through a path such that the causal order of the constituting communications channels becomes indefinite. Quantum trajectories exhibit astonishing features, such as providing non-null capacity even when no information can be sent through any classical trajectory. But the fundamental question of investigating the ultimate rates achievable with quantum trajectories is an open and crucial problem. To this aim, in this paper, we derive closed-form expressions for both the upper- and the lower-bound on the quantum capacity achievable via a quantum trajectory. The derived expressions depend, remarkably, on computable single-letter quantities. Our findings reveal the substantial advantage achievable with a quantum trajectory over any classical combination of the communications channels in terms of ultimate achievable communication rates. Furthermore, we identify the region where a quantum trajectory incontrovertibly outperforms the amount of transmissible information beyond the limits of conventional quantum Shannon theory, and we quantify this advantage over classical trajectories through a conservative estimate.

•Dec 18, 2019•8 citations

A Mathematical Study of Information Transmission in Quantum Communication Processes

Masanori Ohya, Noboru Watanabe

Springer eBooks•Jan 1, 1995•5 citations
We aim to study the optimal rates of transmission of public and private classical information over a quantum channel in the most general channel model. To this end, we discuss a scenario in which a quantum channel is being used only once, i.e., one-shot regime is considered. A quantum channel can be used to send classical information (bits) either publicly or privately and for either case, one-shot bounds have been reported in the literature. This paper investigates the one-shot capacity capabilities of a quantum channel for simultaneous transmission of public and private information. We derive an achievable rate region in the form of a tradeoff between public and private rates. We also provide converse bounds assessing the tightness of our achievable rates. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.
This thesis provides bounds on the performance of quantum error correcting codes when used for quantum communication and quantum key distribution. The first two chapters provide a bare-bones introduction to classical and quantum error correcting codes, respectively. The next four chapters present achievable rates for quantum codes in various scenarios. The final chapter is dedicated to an upper bound on the quantum channel capacity. Chapter 3 studies coding for adversarial noise using quantum list codes, showing there exist quantum codes with high rates and short lists. These can be used, together with a very short secret key, to communicate with high fidelity at noise levels for which perfect fidelity is impossible. Chapter 4 explores the performance of a family of degenerate codes when used to communicate over Pauli channels, showing they can be used to communicate over almost any Pauli channel at rates that are impossible for a nondegenerate code and that exceed those of previously known degenerate codes. By studying the scaling of the optimal block length as a function of the channel's parameters, we develop a heuristic for designing even better codes. Chapter 5 describes an equivalence between a family of noisy preprocessing protocols for quantum key distribution and entanglement distillation protocols whose target state belongs to a class of private states called "twisted states." In Chapter 6, the codes of Chapter 4 are combined with the protocols of Chapter 5 to provide higher key rates for one-way quantum key distribution than were previously thought possible. Finally, Chapter 7 presents a new upper bound on the quantum channel capacity that is both additive and convex, and which can be interpreted as the capacity of the channel for communication given access to side channels from a class of zero capacity "cloning" channels. This "clone assisted capacity" is equal to the unassisted capacity for channels that are degradable, which we use to find new upper bounds on the capacity of a depolarizing channel.
In both classical and quantum Shannon's information theory, communication channels are generally assumed to combine through classical trajectories, so that the associated network path traversed by the information carrier is well-defined. Counter-intuitively, quantum mechanics enables a quantum information carrier to propagate through a quantum trajectory, i.e., through a path such that the causal order of the constituting communications channels becomes indefinite. Quantum trajectories exhibit astonishing features, such as providing non-null capacity even when no information can be sent through any classical trajectory. But the fundamental question of investigating the ultimate rates achievable with quantum trajectories is an open and crucial problem. To this aim, in this paper, we derive closed-form expressions for both the upper- and the lower-bound on the quantum capacity achievable via a quantum trajectory. The derived expressions depend, remarkably, on computable single-letter quantities. Our findings reveal the substantial advantage achievable with a quantum trajectory over any classical combination of the communications channels in terms of ultimate achievable communication rates. Furthermore, we identify the region where a quantum trajectory incontrovertibly outperforms the amount of transmissible information beyond the limits of conventional quantum Shannon theory, and we quantify this advantage over classical trajectories through a conservative estimate.