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

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

Kurt A. Jacobs

Published Jan 1, 2006• 9 citations
OpenAlex

Abstract

Griffith Sciences, School of Natural Sciences

Related papers

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

An entropy function of a quantum channel

Yanjun Chu, Fang Huang, Mingxiao Li +1 more

Quantum Information Processing•Dec 17, 2022•11 citations

LIMITATION ON THE ACCESSIBLE INFORMATION FOR QUANTUM CHANNELS WITH INEFFICIENT MEASUREMENTS

Kurt A. Jacobs

•Oct 1, 2005•0 citations

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

Entropy reduction of quantum measurements

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

It is shown that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a quantum-classical channel mapping an a priori state to the corresponding posteriori probability distribution of the outcomes of the measurement. As a result the entropy reduction is defined for arbitrary a priori states (not only for states with finite von Neumann entropy) and its analytical properties is studied in detail by using general properties of the quantum mutual information. By using this approach it is shown that the entropy reduction of an efficient quantum measurement is a nonnegative lower semicontinuous concave function on the set of all a priori states having continuous restrictions to subsets on which the von Neumann entropy is continuous. Monotonicity and subadditivity of the entropy reduction are also easily proved by this method. A simple continuity condition for the entropy reduction and for the mean posteriori entropy considered as functions of a pair (a priori state, measurement) is obtained. A characterization of an irreducible measurement (in the Ozawa sense) which is not efficient is considered in the Appendix.

arXiv:1011.3127•Journal of Mathematical Physics•May 1, 2011•26 citations

On entropy and information of quantum states

Olga V. Man’ko

Journal of Russian Laser Research•Mar 1, 2007•4 citations
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.
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.
It is shown that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a quantum-classical channel mapping an a priori state to the corresponding posteriori probability distribution of the outcomes of the measurement. As a result the entropy reduction is defined for arbitrary a priori states (not only for states with finite von Neumann entropy) and its analytical properties is studied in detail by using general properties of the quantum mutual information. By using this approach it is shown that the entropy reduction of an efficient quantum measurement is a nonnegative lower semicontinuous concave function on the set of all a priori states having continuous restrictions to subsets on which the von Neumann entropy is continuous. Monotonicity and subadditivity of the entropy reduction are also easily proved by this method. A simple continuity condition for the entropy reduction and for the mean posteriori entropy considered as functions of a pair (a priori state, measurement) is obtained. A characterization of an irreducible measurement (in the Ozawa sense) which is not efficient is considered in the Appendix.