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

International Journal of Quantum Information

LIMITATION ON THE ACCESSIBLE INFORMATION FOR QUANTUM CHANNELS WITH INEFFICIENT MEASUREMENTS

Kurt A. Jacobs

Published Nov 1, 2005• 0 citations
Publisher

Abstract

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.

DOI
10.1142/s0219749905001274

Related papers

A bound on the mutual information for quantum channels with inefficient measurements

Kurt A. Jacobs

The Holevo bound is a bound the mutual information for a given quantum encoding. In 1996 Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] derived a bound which reduces to the Holevo bound for complete measurements, but which is tighter for incomplete measurements. The most general quantum operations may be both incomplete and inefficient. Here we show that the bound derived by SWW can be further extended to obtain one which is yet again tighter for inefficient measurements. This allows us in addition to obtain a generalization of a bound derived by Hall, and to show that the average reduction in the von Neumann entropy during a quantum operation is concave in the initial state, for all quantum operations. This is a quantum version of the concavity of the mutual information. We also show that both this average entropy reduction, and the mutual information for pure state ensembles, are Schur-concave for unitarily covariant measurements; that is, for these measurements, information gain increases with initial uncertainty.

•Dec 1, 2004•3 citations

A bound on the mutual information, and properties of entropy reduction, for quantum channels with inefficient measurements

Kurt Jacobs

The Holevo bound is a bound on the mutual information for a given quantum encoding. In 1996 Schumacher, Westmoreland, and Wootters [Phys. Rev. Lett. 76, 3452 (1996)] derived a bound that reduces to the Holevo bound for complete measurements, but that is tighter for incomplete measurements. The most general quantum operations may be both incomplete and inefficient. Here we show that the bound derived by SWW can be further extended to obtain one that is yet again tighter for inefficient measurements. This allows us, in addition, to obtain a generalization of a bound derived by Hall, and to show that the average reduction in the von Neumann entropy during a quantum operation is concave in the initial state, for all quantum operations. This is a quantum version of the concavity of the mutual information. We also show that both this average entropy reduction and the mutual information for pure state ensembles, are Schur concave for unitarily covariant measurements; that is, for these measurements, information gain increases with initial uncertainty.

arXiv:quant-ph/0412006•Journal of Mathematical Physics•Jan 1, 2006•12 citations

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

Kurt A. Jacobs

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 23, 2005•0 citations

Efficient measurements, purification, and bounds on the mutual information

Kurt A. Jacobs

When a measurement is made on a quantum system in which classical information is encoded, the measurement reduces the observers' average Shannon entropy for the encoding ensemble. This reduction, being the mutual information, is always non-negative. For efficient measurements the state is also purified; that is, on average, the observers' von Neumann entropy for the state of the system is also reduced by a non-negative amount. Here we point out that by rewriting a bound derived by Hall [Phys. Rev. A 55, 100 (1997)], which is dual to the Holevo bound, one finds that for efficient measurements, the mutual information is bounded by the reduction in the von Neumann entropy. We also show that this result, which provides a physical interpretation for Hall's bound, may be derived directly from the Schumacher-Westmoreland-Wootters theorem [Phys. Rev. Lett. 76, 3452 (1996)]. We discuss these bounds, and their relationship to another bound, valid for efficient measurements on pure state ensembles, which involves the subentropy.

arXiv:quant-ph/0306039•Physical Review A•Nov 4, 2003•14 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•497 citations

The capacity of the quantum channel with general signal states

Alexander Semenovich Holevo

It is shown that the capacity of a classical-quantum channel with arbitrary (possibly mixed) states equals the maximum of the entropy bound with respect to all a priori distributions. This completes the recent result of Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters (1996), who proved the equality for the pure state channel.

IEEE Transactions on Information Theory•Jan 1, 1998•1,170 citations
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.
The Holevo bound is a bound the mutual information for a given quantum encoding. In 1996 Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] derived a bound which reduces to the Holevo bound for complete measurements, but which is tighter for incomplete measurements. The most general quantum operations may be both incomplete and inefficient. Here we show that the bound derived by SWW can be further extended to obtain one which is yet again tighter for inefficient measurements. This allows us in addition to obtain a generalization of a bound derived by Hall, and to show that the average reduction in the von Neumann entropy during a quantum operation is concave in the initial state, for all quantum operations. This is a quantum version of the concavity of the mutual information. We also show that both this average entropy reduction, and the mutual information for pure state ensembles, are Schur-concave for unitarily covariant measurements; that is, for these measurements, information gain increases with initial uncertainty.
The Holevo bound is a bound on the mutual information for a given quantum encoding. In 1996 Schumacher, Westmoreland, and Wootters [Phys. Rev. Lett. 76, 3452 (1996)] derived a bound that reduces to the Holevo bound for complete measurements, but that is tighter for incomplete measurements. The most general quantum operations may be both incomplete and inefficient. Here we show that the bound derived by SWW can be further extended to obtain one that is yet again tighter for inefficient measurements. This allows us, in addition, to obtain a generalization of a bound derived by Hall, and to show that the average reduction in the von Neumann entropy during a quantum operation is concave in the initial state, for all quantum operations. This is a quantum version of the concavity of the mutual information. We also show that both this average entropy reduction and the mutual information for pure state ensembles, are Schur concave for unitarily covariant measurements; that is, for these measurements, information gain increases with initial uncertainty.
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.
When a measurement is made on a quantum system in which classical information is encoded, the measurement reduces the observers' average Shannon entropy for the encoding ensemble. This reduction, being the mutual information, is always non-negative. For efficient measurements the state is also purified; that is, on average, the observers' von Neumann entropy for the state of the system is also reduced by a non-negative amount. Here we point out that by rewriting a bound derived by Hall [Phys. Rev. A 55, 100 (1997)], which is dual to the Holevo bound, one finds that for efficient measurements, the mutual information is bounded by the reduction in the von Neumann entropy. We also show that this result, which provides a physical interpretation for Hall's bound, may be derived directly from the Schumacher-Westmoreland-Wootters theorem [Phys. Rev. Lett. 76, 3452 (1996)]. We discuss these bounds, and their relationship to another bound, valid for efficient measurements on pure state ensembles, which involves the subentropy.
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.