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

IEEE International Symposium on Information Theory (ISIT)

Detecting the normal quantum/Compound Quantum channel with von Neumann measurement

Lóránt Farkas

Published Jul 1, 2008• 0 citations
Publisher

Abstract

In this brief summary we show an alternate prove for the fundamental theorem of quantum channel coding. This new prove is stronger then the previously known results because it is used von Neumann measurement. Moreover, the compound quantum channel is defined, and its capacity deduced, with the help of this new measurement.
DOI
10.1109/isit.2008.4595007

Related papers

An Additive Refinement of Quantum Channel Capacities

Dongsheng Wang

Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity measure. However, this cannot be achieved for a few quantities that have been established as capacity measures. Asymptotic regularization is generically necessary making the study of capacities notoriously hard. In this work, by a proper refinement of the physical settings of quantum communication using restricted encodings, we prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems. This refinement is consistent with the principles of quantum theory, and it further demonstrates von Neumann entropy as the cornerstone of quantum information.

arXiv:2205.07205•Open Systems & Information Dynamics•Mar 1, 2025•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•209 citations

Reaching the Holevo Capacity via von Neumann measurement, and its use

Lóránt Farkas

In this article we show that the Holevo capacity of a classical quantum channel, can be reached not only by a POVM but by von Neumann measurement too. Furthermore we show two use of this fact 1) We can generalize the classical compound channel to quantum environment and with this new measure technique we can give an optimal coding/decoding algorithm to it. 2) We give an algorithm, with it a classical system can be decoded by quantum apparatus in linear time, which is a surprising result, because best known optimal classical decoding algorithm need n*log(n) time. This means that if a quantum machine can perform arbitrarily von Neumann measurement with only two possible outcome, then it can solve non-polynomial classical problems in linear time.

arXiv:0704.2513•Apr 19, 2007•1 citation

On Quantum Entropies for the Compound Quantum Channel

Noboru Watanabe

In classical information theory, the most important theorems are the coding theorems, which were discussed by calculating the mean entropy and the mean mutual entropy defined by the classical dynamical entropy (Kolmogorov–Sinai). The quantum dynamical entropy was first studied by Emch [13] and Connes–Stormer [11]. After that, several approaches for introducing the quantum dynamical entropy were proposed [10,[Formula: see text]3,[Formula: see text]8,[Formula: see text]39,[Formula: see text]15,[Formula: see text]44,[Formula: see text]9,[Formula: see text]27,[Formula: see text]28,[Formula: see text]2,[Formula: see text]19,[Formula: see text]45]. The efficiency of information transmission for the quantum processes is investigated by using the von Neumann entropy [22] and the Ohya mutual entropy [24]. These entropies were extended to S-mixing entropy by Ohya [26,[Formula: see text]27] in general quantum systems. The mean entropy and the mean mutual entropy for the quantum dynamical systems were introduced based on the S-mixing entropy. In this paper, based on research into the dynamical entropy and mean mutual entropy of quantum systems, this study investigates the characteristics of quantum channels that exhibit entanglement, a property unique to quantum systems, and investigates the behaviour of quantum entropy for compound quantum channels by changing the perspective from information transmission between input and output to a new perspective of information transmission from the initial state to the final state.

Open Systems & Information Dynamics•Mar 1, 2026•0 citations

Classical Capacities of Compound and Averaged Quantum Channels

Igor Bjelaković, Holger Boche

We determine the capacity of compound classical-quantum channels. As a consequence, we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical setting, the existence of reliable universal classical-quantum codes in scenarios where the onlya prioriinformation about the channel used for the transmission of information is that it belongs to a given set of memoryless classical-quantum channels. Our approach is based on a universal classical approximation of the quantum relative entropy which in turn relies on a universal hypothesis testing result.

IEEE Transactions on Information Theory•Jun 16, 2009•54 citations

On Entangled Information and Quantum Capacity

V. P. Belavkin

The pure quantum entanglement is generalized to the case of mixed compound states to include the classical and quantum encodings as particular cases. The true quantum entanglements are characterized as transpose-CP but not CP maps. The entangled information is introduced as the relative entropy of the mutual and the input state and total information of the entangled states leads to two different types of entropy for a given quantum state: the von Neumann entropy, which is achieved as the supremum of the information over all c-entanglements, and the true quantum entropy, which is achieved at the standard entanglement. The q-capacity, defined as the supremum over all entanglements, doubles the c-capacity in the case of the simple algebra. The conditional q-entropy is positive, and q-information of a quantum channel is additive.

arXiv:quant-ph/0208115•Open Systems & Information Dynamics•Mar 1, 2001•7 citations
Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity measure. However, this cannot be achieved for a few quantities that have been established as capacity measures. Asymptotic regularization is generically necessary making the study of capacities notoriously hard. In this work, by a proper refinement of the physical settings of quantum communication using restricted encodings, we prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems. This refinement is consistent with the principles of quantum theory, and it further demonstrates von Neumann entropy as the cornerstone of quantum information.
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 this article we show that the Holevo capacity of a classical quantum channel, can be reached not only by a POVM but by von Neumann measurement too. Furthermore we show two use of this fact 1) We can generalize the classical compound channel to quantum environment and with this new measure technique we can give an optimal coding/decoding algorithm to it. 2) We give an algorithm, with it a classical system can be decoded by quantum apparatus in linear time, which is a surprising result, because best known optimal classical decoding algorithm need n*log(n) time. This means that if a quantum machine can perform arbitrarily von Neumann measurement with only two possible outcome, then it can solve non-polynomial classical problems in linear time.
In classical information theory, the most important theorems are the coding theorems, which were discussed by calculating the mean entropy and the mean mutual entropy defined by the classical dynamical entropy (Kolmogorov–Sinai). The quantum dynamical entropy was first studied by Emch [13] and Connes–Stormer [11]. After that, several approaches for introducing the quantum dynamical entropy were proposed [10,[Formula: see text]3,[Formula: see text]8,[Formula: see text]39,[Formula: see text]15,[Formula: see text]44,[Formula: see text]9,[Formula: see text]27,[Formula: see text]28,[Formula: see text]2,[Formula: see text]19,[Formula: see text]45]. The efficiency of information transmission for the quantum processes is investigated by using the von Neumann entropy [22] and the Ohya mutual entropy [24]. These entropies were extended to S-mixing entropy by Ohya [26,[Formula: see text]27] in general quantum systems. The mean entropy and the mean mutual entropy for the quantum dynamical systems were introduced based on the S-mixing entropy. In this paper, based on research into the dynamical entropy and mean mutual entropy of quantum systems, this study investigates the characteristics of quantum channels that exhibit entanglement, a property unique to quantum systems, and investigates the behaviour of quantum entropy for compound quantum channels by changing the perspective from information transmission between input and output to a new perspective of information transmission from the initial state to the final state.
We determine the capacity of compound classical-quantum channels. As a consequence, we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical setting, the existence of reliable universal classical-quantum codes in scenarios where the onlya prioriinformation about the channel used for the transmission of information is that it belongs to a given set of memoryless classical-quantum channels. Our approach is based on a universal classical approximation of the quantum relative entropy which in turn relies on a universal hypothesis testing result.
The pure quantum entanglement is generalized to the case of mixed compound states to include the classical and quantum encodings as particular cases. The true quantum entanglements are characterized as transpose-CP but not CP maps. The entangled information is introduced as the relative entropy of the mutual and the input state and total information of the entangled states leads to two different types of entropy for a given quantum state: the von Neumann entropy, which is achieved as the supremum of the information over all c-entanglements, and the true quantum entropy, which is achieved at the standard entanglement. The q-capacity, defined as the supremum over all entanglements, doubles the c-capacity in the case of the simple algebra. The conditional q-entropy is positive, and q-information of a quantum channel is additive.