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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

General bound on the accessible information for quantum channels with noisy measurements

Kurt A. Jacobs

Published May 23, 2005• 0 citations
Publisher

Abstract

Quantum systems may be used to transmit classical information. To do this the sender encodes information by preparing the system in one of an alphabet of possible states, and sends it to the receiver. The receiver then performs a measurement on the system in order to obtain information about which state was sent. Here we describe a general bound on the information which is accessible to the receiver in such a channel when the receivers measurement is noisy. In addition to extracting classical information, measurements also reduce the entropy of a quantum system. This is important, for example, in quantum feedback control. We discuss two corollaries of the information bound that involve this entropy reduction.

DOI
10.1117/12.609317

Related papers

LIMITATION ON THE ACCESSIBLE INFORMATION FOR QUANTUM CHANNELS WITH INEFFICIENT MEASUREMENTS

Kurt A. Jacobs

To transmit classical information using a quantum system, the sender prepares the system in one of a set of possible states and sends it to the receiver. The receiver then makes a measurement on the system to obtain information about the senders choice of state. The amount of information which is accessible to the receiver depends upon the encoding and the measurement. Here we derive a bound on this information which generalizes the bound derived by Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76 , 3452 (1996)] to include inefficient measurements, and thus all quantum operations. This also allows us to obtain a generalization of a bound derived by Hall [Hall, Phys. Rev. A 55 , 100 (1997)], and to show that the average reduction in the von Neumann entropy which accompanies a measurement is concave in the initial state, for all quantum operations.

•Oct 1, 2005•0 citations

LIMITATION ON THE ACCESSIBLE INFORMATION FOR QUANTUM CHANNELS WITH INEFFICIENT MEASUREMENTS

Kurt A. Jacobs

To transmit classical information using a quantum system, the sender prepares the system in one of a set of possible states and sends it to the receiver. The receiver then makes a measurement on the system to obtain information about the senders choice of state. The amount of information which is accessible to the receiver depends upon the encoding and the measurement. Here we derive a bound on this information which generalizes the bound derived by Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] to include inefficient measurements, and thus all quantum operations. This also allows us to obtain a generalization of a bound derived by Hall [Hall, Phys. Rev. A 55, 100 (1997)], and to show that the average reduction in the von Neumann entropy which accompanies a measurement is concave in the initial state, for all quantum operations.

International Journal of Quantum Information•Nov 1, 2005•0 citations

Classical information capacity of a quantum channel

Paul A. Hausladen, Richard Jozsa, Benjamin W. Schumacher +2 more

We consider the transmission of classical information over a quantum channel. The channel is defined by an ``alphabet'' of quantum states, e.g., certain photon polarizations, together with a specified set of probabilities with which these states must be sent. If the receiver is restricted to making separate measurements on the received ``letter'' states, then the Kholevo theorem implies that the amount of information transmitted per letter cannot be greater than the von Neumann entropy H of the letter ensemble. In fact the actual amount of transmitted information will usually be significantly less than H. We show, however, that if the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted per letter can be made arbitrarily close to H and never exceeds H. This provides a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics. We apply this result to ``superdense'' coding, and we consider its extension to noisy channels. \textcopyright{} 1996 The American Physical Society.

Physical Review A•Sep 1, 1996•491 citations

On Feedback and the Classical Capacity of a Noisy Quantum Channel

Garry Bowen, Rajagopal Nagarajan

In Shannon information theory, the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this correspondence, the use of classical feedback is shown to provide no increase in the unassisted classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel. This gives a generalization of the Shannon theory for certain classes of feedback protocols when transmitting through noisy quantum communication channels.

arXiv:quant-ph/0305176•IEEE Transactions on Information Theory•Jan 1, 2005•27 citations

Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback

Dawei Ding, Yihui Quek, Peter W. Shor +1 more

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we conclude that a classical feedback channel does not improve the classical capacity of a quantum erasure channel, and by taking into account energy constraints, we conclude the same for a pure-loss bosonic channel. The method for establishing the aforementioned entropy bound involves identifying an information measure having two key properties: 1) it does not increase under a one-way local operations and classical communication channel from the receiver to the sender and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.

arXiv:1902.02490•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2019•5 citations

Information transmission through a quantum information channel

Tareq Uddin Ahmed

We consider the transmission of classical information over a quantum chan- nel. The channel is expressed by an alphabet of quantum states. For an example, we can express quantum states by photon polarization. For trans- mitting information, we use speci ed set of probabilities. If we nd that the receiver is unable to make separate measurement on the received letter then we have to use Holevo theorem. From this theorem we see that, in such case, the amount of information per letter we are sending cannot be larger than the Von Neumann entropy H of the letter ensemble. It happens most of the time that, the actual amount of information which will be transmitted is less than H. However if we use block coding scheme which has options to choose code words that respects the priori probabilities of the letter states then we nd a di erent situation. In this case the receiver distinguishes whole words rather than individual letters. In this way, the information transmitted per letter can be made arbitrarily close to H. Block coding scheme helps us to nd clear information of theoretical interpretation of Von Neumann entropy in quantum mechanics. We use this experiment in superdense coding and we consider this extension to noisy channels.

•Jan 1, 2017•0 citations
Quantum systems may be used to transmit classical information. To do this the sender encodes information by preparing the system in one of an alphabet of possible states, and sends it to the receiver. The receiver then performs a measurement on the system in order to obtain information about which state was sent. Here we describe a general bound on the information which is accessible to the receiver in such a channel when the receivers measurement is noisy. In addition to extracting classical information, measurements also reduce the entropy of a quantum system. This is important, for example, in quantum feedback control. We discuss two corollaries of the information bound that involve this entropy reduction.
To transmit classical information using a quantum system, the sender prepares the system in one of a set of possible states and sends it to the receiver. The receiver then makes a measurement on the system to obtain information about the senders choice of state. The amount of information which is accessible to the receiver depends upon the encoding and the measurement. Here we derive a bound on this information which generalizes the bound derived by Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76 , 3452 (1996)] to include inefficient measurements, and thus all quantum operations. This also allows us to obtain a generalization of a bound derived by Hall [Hall, Phys. Rev. A 55 , 100 (1997)], and to show that the average reduction in the von Neumann entropy which accompanies a measurement is concave in the initial state, for all quantum operations.
To transmit classical information using a quantum system, the sender prepares the system in one of a set of possible states and sends it to the receiver. The receiver then makes a measurement on the system to obtain information about the senders choice of state. The amount of information which is accessible to the receiver depends upon the encoding and the measurement. Here we derive a bound on this information which generalizes the bound derived by Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] to include inefficient measurements, and thus all quantum operations. This also allows us to obtain a generalization of a bound derived by Hall [Hall, Phys. Rev. A 55, 100 (1997)], and to show that the average reduction in the von Neumann entropy which accompanies a measurement is concave in the initial state, for all quantum operations.
We consider the transmission of classical information over a quantum channel. The channel is defined by an ``alphabet'' of quantum states, e.g., certain photon polarizations, together with a specified set of probabilities with which these states must be sent. If the receiver is restricted to making separate measurements on the received ``letter'' states, then the Kholevo theorem implies that the amount of information transmitted per letter cannot be greater than the von Neumann entropy H of the letter ensemble. In fact the actual amount of transmitted information will usually be significantly less than H. We show, however, that if the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted per letter can be made arbitrarily close to H and never exceeds H. This provides a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics. We apply this result to ``superdense'' coding, and we consider its extension to noisy channels. \textcopyright{} 1996 The American Physical Society.
In Shannon information theory, the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this correspondence, the use of classical feedback is shown to provide no increase in the unassisted classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel. This gives a generalization of the Shannon theory for certain classes of feedback protocols when transmitting through noisy quantum communication channels.
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we conclude that a classical feedback channel does not improve the classical capacity of a quantum erasure channel, and by taking into account energy constraints, we conclude the same for a pure-loss bosonic channel. The method for establishing the aforementioned entropy bound involves identifying an information measure having two key properties: 1) it does not increase under a one-way local operations and classical communication channel from the receiver to the sender and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.
We consider the transmission of classical information over a quantum chan- nel. The channel is expressed by an alphabet of quantum states. For an example, we can express quantum states by photon polarization. For trans- mitting information, we use speci ed set of probabilities. If we nd that the receiver is unable to make separate measurement on the received letter then we have to use Holevo theorem. From this theorem we see that, in such case, the amount of information per letter we are sending cannot be larger than the Von Neumann entropy H of the letter ensemble. It happens most of the time that, the actual amount of information which will be transmitted is less than H. However if we use block coding scheme which has options to choose code words that respects the priori probabilities of the letter states then we nd a di erent situation. In this case the receiver distinguishes whole words rather than individual letters. In this way, the information transmitted per letter can be made arbitrarily close to H. Block coding scheme helps us to nd clear information of theoretical interpretation of Von Neumann entropy in quantum mechanics. We use this experiment in superdense coding and we consider this extension to noisy channels.