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

Moscow University Mathematics Bulletin

Inverse coding theorem for infinite-dimensional quantum channels

A. A. Kuznetsova

Published Feb 1, 2013• 0 citations
Publisher

Abstract

In this paper we make a conjecture about the quantum capacity of an infinite-dimensional quantum channel. The proof of the inverse theorem is given based on definitions and properties of the coherent information in the infinite-dimensional case.
DOI
10.3103/s0027132213010099

Related papers

Mutual and coherent information for infinite-dimensional quantum channels

Alexander Semenovich Holevo, Максим Евгеньевич Широков

The paper is devoted to the study of quantum mutual information and coherent information, two important characteristics of a quantum communication channel. Appropriate definitions of these quantities in the infinite-dimensional case are given, and their properties are studied in detail. Basic identities relating the quantum mutual information and coherent information of a pair of complementary channels are proved. An unexpected continuity property of the quantum mutual information and coherent information, following from the above identities, is observed. An upper bound for the coherent information is obtained.

arXiv:1004.2495•Problems of Information Transmission•Sep 1, 2010•24 citations

On classical capacities of infinite-dimensional quantum channels

Alexander Semenovich Holevo, Максим Евгеньевич Широков

A coding theorem for entanglement-assisted communication via an infinite-dimensional quantum channel with linear constraints is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and χ-capacity of constrained channels are obtained, and conditions for their coincidence are given. Sufficient conditions for continuity of the entanglement-assisted classical capacity as a function of a channel are obtained. Some applications of the obtained results to analysis of Gaussian channels are considered. A general (continuous) version of the fundamental relation between coherent information and the measure of privacy of classical information transmission via an infinite-dimensional quantum channel is proved.

arXiv:1210.6926•Problems of Information Transmission•Jan 1, 2013•28 citations

Coding Theorems of Quantum Information Theory

Andreas Winter

Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.

arXiv:quant-ph/9907077•Jul 24, 1999•143 citations

On the multiplicativity conjecture for quantum channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo

A multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter $p$ close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in quantum information theory. The proof of the conjecture is given for the case of natural numbers $p$.

arXiv:math-ph/0103015•Mar 12, 2001•33 citations

Entanglement-Assisted Capacities of Constrained Quantum Channels

Alexander Semenovich Holevo

In this paper we fill a gap in previous works by proving the conjectured formula for the classical entanglement-assisted capacity of a quantum channel with additive constraint (such as the Bosonic Gaussian channel). Our main tools are the coding theorem for classical-quantum constrained channels and a finite-dimensional approximation of the input density operators for entanglement-assisted capacity. We also give sufficient conditions under which suprema in the capacity formulas are achieved.

Theory of Probability and Its Applications•Jan 1, 2004•51 citations

Quantum Information Theory in Infinite Dimensions with Application to Optical Channels

Vinod Sharma, Konchady Gautam Shenoy

Abstract Information theory deals with the efficient representation of information sources as well as providing fundamental limits to the amount of information communicated reliably over channels. These sources and channels are generally classical, i.e., represented by standard probability distributions. Quantum information theory takes it to the next level where we allow for the sources as well as channels to be quantum. From the representation of quantum states to the communication over quantum channels, the theory not only essentially encapsulates classical information theoretic methods but also accounts for quantum effects such as superposition, entanglement, interference, etc. In this article, we will review and focus on the information theoretic analysis of quantum channels with infinite dimensions. Infinite dimensionality is needed to model quantum optical channels which are ubiquitous in today’s practical networks, distributed quantum communication and quantum internet. The infinite dimensionality introduces some unique problems when compared with finite-dimensional channels and has not been deeply explored in literature from the quantum information theoretic perspective. For these channels, we provide the essential concepts and state-of-the-art channel capacity results. To make this paper self-contained, we also recall the finite dimensional results.

Journal of the Indian Institute of Science•Aug 23, 2022•0 citations
The paper is devoted to the study of quantum mutual information and coherent information, two important characteristics of a quantum communication channel. Appropriate definitions of these quantities in the infinite-dimensional case are given, and their properties are studied in detail. Basic identities relating the quantum mutual information and coherent information of a pair of complementary channels are proved. An unexpected continuity property of the quantum mutual information and coherent information, following from the above identities, is observed. An upper bound for the coherent information is obtained.
A coding theorem for entanglement-assisted communication via an infinite-dimensional quantum channel with linear constraints is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and χ-capacity of constrained channels are obtained, and conditions for their coincidence are given. Sufficient conditions for continuity of the entanglement-assisted classical capacity as a function of a channel are obtained. Some applications of the obtained results to analysis of Gaussian channels are considered. A general (continuous) version of the fundamental relation between coherent information and the measure of privacy of classical information transmission via an infinite-dimensional quantum channel is proved.
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.
A multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter ppp close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in quantum information theory. The proof of the conjecture is given for the case of natural numbers ppp.
Abstract Information theory deals with the efficient representation of information sources as well as providing fundamental limits to the amount of information communicated reliably over channels. These sources and channels are generally classical, i.e., represented by standard probability distributions. Quantum information theory takes it to the next level where we allow for the sources as well as channels to be quantum. From the representation of quantum states to the communication over quantum channels, the theory not only essentially encapsulates classical information theoretic methods but also accounts for quantum effects such as superposition, entanglement, interference, etc. In this article, we will review and focus on the information theoretic analysis of quantum channels with infinite dimensions. Infinite dimensionality is needed to model quantum optical channels which are ubiquitous in today’s practical networks, distributed quantum communication and quantum internet. The infinite dimensionality introduces some unique problems when compared with finite-dimensional channels and has not been deeply explored in literature from the quantum information theoretic perspective. For these channels, we provide the essential concepts and state-of-the-art channel capacity results. To make this paper self-contained, we also recall the finite dimensional results.