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:2309.14141

The Generalized Capacity of a Quantum Channel

Zahra Baghali Khanian

Published Sep 25, 2023• 0 citations
arXivHTMLPDF

Abstract

The transmission of classical information over a classical channel gave rise to the classical capacity theorem with the optimal rate in terms of the classical mutual information. Despite classical information being a subset of quantum information, the rate of the quantum capacity problem is expressed in terms of the coherent information, which does not mathematically generalize the classical mutual information. Additionally, there are multiple capacity theorems with distinct formulas when dealing with transmitting information over a noisy quantum channel. This leads to the question of what constitutes a mathematically accurate quantum generalization of classical mutual information and whether there exists a quantum task that directly extends the classical capacity problem. In this paper, we address these inquiries by introducing a quantity called the generalized information, which serves as a mathematical extension encompassing both classical mutual information and coherent information. We define a transmission task, which includes as specific instances both classical information and quantum information capacity problems, and show that the transmission capacity of this task is characterized by the generalized information.

DOI
10.48550/arxiv.2309.14141

Related papers

On General Quantum Mutual Entropy and Capacity

Noborn Watanabe

In communication processes, a channel has an activity to communicate information of input system to output system. The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi‐classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy — type measures introduced in the studies of quantum information.In this paper, we compare with these mutual entropy‐type measures in order to obtain most suitable one for discussing the quantum coding theorem. We concretely calculate the quantum capacity for quantum channels.

AIP conference proceedings•Jan 1, 2005•0 citations

von Neumann capacity of noisy quantum channels

Christoph Adami, Nicolas J. Cerf

We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely quantum manner, for transmitting or storing quantum entanglement. We propose here a definition of the von Neumann capacity of quantum channels, which is a quantum-mechanical extension of the Shannon capacity and reverts to it in the classical limit. As such, the von Neumann capacity assumes the role of a classical or quantum capacity depending on the usage of the channel. In analogy to the classical construction, this capacity is defined as the maximum von Neumann mutual entropy processed by the channel, a measure which reduces to the capacity for classical information transmission through quantum channels (the ``Kholevo capacity'') when known quantum states are sent. The quantum mutual entropy fulfills all basic requirements for a measure of information, and observes quantum data-processing inequalities. We also derive a quantum Fano inequality relating the quantum loss of the channel to the fidelity of the quantum code. The quantities introduced are calculated explicitly for the quantum depolarizing channel. The von Neumann capacity is interpreted within the context of superdense coding, and an extended Hamming bound is derived that is consistent with that capacity.

arXiv:quant-ph/9609024•Physical Review A•Nov 1, 1997•211 citations

Classical capacity per unit cost for quantum channels

Marcin Jarzyna

In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance of communication protocol by classical capacity, quantifying the maximal amount of information that can be transmitted through a quantum channel per single use of the channel. However, different figures of merit are also possible and a particularly well-suited one is the classical capacity per unit cost, which quantifies the maximal amount of information that can be transmitted per unit cost. I generalize this concept to account for the quantum nature of the information carriers and communication channels and show that if there exists a state with cost equal to zero, e.g., a vacuum state, the capacity per unit cost can be expressed by a simple formula containing maximization of the relative entropy between two quantum states. This enables me to analyze the behavior of photon information efficiency for general communication tasks and show simple bounds on the capacity per unit cost in terms of quantities familiar from quantum estimation theory. I calculate also the capacity per unit cost for general Gaussian quantum channels.

arXiv:1704.06696•Physical Review A•Sep 28, 2017•13 citations

Trade-off capacities of the quantum Hadamard channels

Kamil Brádler, Patrick M. Hayden, Dave Touchette +1 more

Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels with a tractable classical or quantum capacity, but when such a finding occurs, it demonstrates a complete understanding of that channel's capabilities for transmitting classical or quantum information. Here we show that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels. Examples of Hadamard channels include generalized dephasing channels, cloning channels, and the Unruh channel. The generalized dephasing channels and the cloning channels are natural processes that occur in quantum systems through the loss of quantum coherence or stimulated emission, respectively. The Unruh channel is a noisy process that occurs in relativistic quantum information theory as a result of the Unruh effect and bears a strong relationship to the cloning channels. We give exact formulas for the entanglement-assisted classical and quantum communication capacity regions of these channels. The coding strategy for each of these examples is superior to a na\"{\i}ve time-sharing strategy, and we introduce a measure to determine this improvement.

arXiv:1001.1732•Physical Review A•Jun 14, 2010•83 citations

ON QUANTUM MUTUAL TYPE ENTROPIES AND QUANTUM CAPACITY

Noboru Watanabe

The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy - type measures introduced in the studies of quantum information. In this paper, we compare with these mutual entropy-type measures in order to obtain most suitable one for discussing the information transmission for quantum communication processes.

Stochastic Analysis: Classical and Quantum•Oct 1, 2005•0 citations

Information transmission through a noisy quantum channel

Howard Barnum, Michael A. Nielsen, Benjamin W. Schumacher

Noisy quantum channels may be used in many information-carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on the coherent information, which plays a role in quantum information theory analogous to that played by the mutual information in classical information theory. Many new properties of the coherent information and entanglement fidelity are proved. Two nonclassical features of the coherent information are demonstrated: the failure of subadditivity, and the failure of the pipelining inequality. Both properties arise as a consequence of quantum entanglement, and give quantum information new features not found in classical information theory. The problem of a noisy quantum channel with a classical observer measuring the environment is introduced, and bounds on the corresponding channel capacity proved. These bounds are always greater than for the unobserved channel. We conclude with a summary of open problems.

arXiv:quant-ph/9702049•Physical Review A•Jun 1, 1998•404 citations
The transmission of classical information over a classical channel gave rise to the classical capacity theorem with the optimal rate in terms of the classical mutual information. Despite classical information being a subset of quantum information, the rate of the quantum capacity problem is expressed in terms of the coherent information, which does not mathematically generalize the classical mutual information. Additionally, there are multiple capacity theorems with distinct formulas when dealing with transmitting information over a noisy quantum channel. This leads to the question of what constitutes a mathematically accurate quantum generalization of classical mutual information and whether there exists a quantum task that directly extends the classical capacity problem. In this paper, we address these inquiries by introducing a quantity called the generalized information, which serves as a mathematical extension encompassing both classical mutual information and coherent information. We define a transmission task, which includes as specific instances both classical information and quantum information capacity problems, and show that the transmission capacity of this task is characterized by the generalized information.
In communication processes, a channel has an activity to communicate information of input system to output system. The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi‐classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy — type measures introduced in the studies of quantum information.In this paper, we compare with these mutual entropy‐type measures in order to obtain most suitable one for discussing the quantum coding theorem. We concretely calculate the quantum capacity for quantum channels.
We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely quantum manner, for transmitting or storing quantum entanglement. We propose here a definition of the von Neumann capacity of quantum channels, which is a quantum-mechanical extension of the Shannon capacity and reverts to it in the classical limit. As such, the von Neumann capacity assumes the role of a classical or quantum capacity depending on the usage of the channel. In analogy to the classical construction, this capacity is defined as the maximum von Neumann mutual entropy processed by the channel, a measure which reduces to the capacity for classical information transmission through quantum channels (the ``Kholevo capacity'') when known quantum states are sent. The quantum mutual entropy fulfills all basic requirements for a measure of information, and observes quantum data-processing inequalities. We also derive a quantum Fano inequality relating the quantum loss of the channel to the fidelity of the quantum code. The quantities introduced are calculated explicitly for the quantum depolarizing channel. The von Neumann capacity is interpreted within the context of superdense coding, and an extended Hamming bound is derived that is consistent with that capacity.
In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance of communication protocol by classical capacity, quantifying the maximal amount of information that can be transmitted through a quantum channel per single use of the channel. However, different figures of merit are also possible and a particularly well-suited one is the classical capacity per unit cost, which quantifies the maximal amount of information that can be transmitted per unit cost. I generalize this concept to account for the quantum nature of the information carriers and communication channels and show that if there exists a state with cost equal to zero, e.g., a vacuum state, the capacity per unit cost can be expressed by a simple formula containing maximization of the relative entropy between two quantum states. This enables me to analyze the behavior of photon information efficiency for general communication tasks and show simple bounds on the capacity per unit cost in terms of quantities familiar from quantum estimation theory. I calculate also the capacity per unit cost for general Gaussian quantum channels.
Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels with a tractable classical or quantum capacity, but when such a finding occurs, it demonstrates a complete understanding of that channel's capabilities for transmitting classical or quantum information. Here we show that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels. Examples of Hadamard channels include generalized dephasing channels, cloning channels, and the Unruh channel. The generalized dephasing channels and the cloning channels are natural processes that occur in quantum systems through the loss of quantum coherence or stimulated emission, respectively. The Unruh channel is a noisy process that occurs in relativistic quantum information theory as a result of the Unruh effect and bears a strong relationship to the cloning channels. We give exact formulas for the entanglement-assisted classical and quantum communication capacity regions of these channels. The coding strategy for each of these examples is superior to a na\"{\i}ve time-sharing strategy, and we introduce a measure to determine this improvement.
The mutual entropy (information) denotes an amount of information transmitted correctly from the input system to the output system through a channel. The (semi-classical) mutual entropies for classical input and quantum output were defined by several researchers. The fully quantum mutual entropy, which is called Ohya mutual entropy, for quantum input and output by using the relative entropy was defined by Ohya in 1983, and he extended it to general quantum systems by means of the relative entropy of Araki and Uhlmann. The capacity shows the ability of the information transmission of the channel, which is used as a measure for construction of channels. The fully quantum capacity is formulated by taking the supremum of Ohya mutual entropy with respect to a certain subset of the initial state space. One of the most important theorems in quantum communication theory is coding theorem. The quantum coding theorems are discussed by using the mutual entropy - type measures introduced in the studies of quantum information. In this paper, we compare with these mutual entropy-type measures in order to obtain most suitable one for discussing the information transmission for quantum communication processes.
Noisy quantum channels may be used in many information-carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on the coherent information, which plays a role in quantum information theory analogous to that played by the mutual information in classical information theory. Many new properties of the coherent information and entanglement fidelity are proved. Two nonclassical features of the coherent information are demonstrated: the failure of subadditivity, and the failure of the pipelining inequality. Both properties arise as a consequence of quantum entanglement, and give quantum information new features not found in classical information theory. The problem of a noisy quantum channel with a classical observer measuring the environment is introduced, and bounds on the corresponding channel capacity proved. These bounds are always greater than for the unobserved channel. We conclude with a summary of open problems.