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:quant-ph/0012128 · Physical Review A

Compression of quantum-measurement operations

Andreas Winter, Serge Massar

Published Jun 11, 2001• 31 citations
arXivHTMLPDF

Abstract

We generalize the recent work of Massar and Popescu dealing with the amount of classical data that is produced by a quantum measurement on a quantum state ensemble. In the previous work it was shown that quantum measurements generally contain spurious randomness in the outcomes and that this spurious randomness can be eliminated by carrying out collective measurements on many independent copies of the system. In particular it was shown that, without decreasing the amount of knowledge the measurement provides about the quantum state, one can always reduce the amount of data produced by the measurement to the von Neumann entropy $H(\ensuremath{\rho})=\ensuremath{-}\mathrm{Tr}\ensuremath{\rho}\mathrm{log}\ensuremath{\rho}$ of the ensemble. Here we extend this result by giving a more refined description of what constitutes equivalent measurements (that is, measurements which provide the same knowledge about the quantum state) and also by considering incomplete measurements. In particular, we show that one can always associate a positive operator-valued measure (POVM) having elements ${a}_{j}$ with an equivalent POVM acting on many independent copies of the system, which produces an amount of data asymptotically equal to the entropy defect of an ensemble canonically associated with the ensemble average state \ensuremath{\rho} and the initial measurement ${(a}_{j}).$ In the case where the measurement is not maximally refined this amount of data is strictly less than the amount $H(\ensuremath{\rho})$ obtained in the previous work. We also show that this is the best achievable, i.e., it is impossible to devise a measurement equivalent to the initial measurement ${(a}_{j})$ that produces less data. We discuss the interpretation of these results. In particular, we show how they can be used to provide a precise and model-independent measure of the amount of knowledge that is obtained about a quantum state by a quantum measurement. We also discuss in detail the relation between our results and Holevo's bound, at the same time providing a self-contained proof of this fundamental inequality.

DOI
10.1103/physreva.64.012311

Related papers

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

Kurt A. 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•14 citations

Aspects of Quantum Information Compression for Pure States

Richard Jozsa

Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•1 citation

Amount of information obtained by a quantum measurement

Serge Massar, Sandu Popescu

In this paper we address the problem of how much can be learned about an unknown quantum state by a measurement. To this end we consider optimal measurements for the state estimation problem, that is measurements that maximize the expectation of a fidelity function. We then enlarge the class of optimal measurements to measurements that act collectively on blocks of input states, and in addition we only require that the fidelity of the measurement be arbitrarily close to the optimal fidelity. We then consider the Shannon information of the outputs of optimal measurements, which is the amount of data produced by the measurements. We show that in the enlarged class of optimal measurements described above one can always construct an optimal measurement so that the Shannon information of its outputs equals the von Neumann entropy of the unknown states. Since this result is valid for all choices of fidelity functions and all distributions of input states, it provides a model independent answer to the question of how much can be learned about a quantum state by a measurement. Namely, this result shows that a measurement can extract at most one meaningful bit from every qubit carried by the unknown state.

arXiv:quant-ph/9907066•Physical Review A•May 12, 2000•33 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•13 citations

Classical randomness in quantum measurements

Giacomo Mauro D’Ariano, Paoloplacido Lo Presti, Paolo Perinotti

Similarly to quantum states, also quantum measurements can be 'mixed', corresponding to a random choice within an ensemble of measuring apparatuses. Such mixing is equivalent to a sort of hidden variable, which produces a noise of purely classical nature. It is then natural to ask which apparatuses are indecomposable , i.e. do not correspond to any random choice of apparatuses. This problem is interesting not only for foundations, but also for applications, since most optimization strategies give optimal apparatuses that are indecomposable. Mathematically the problem is posed describing each measuring apparatus by a positive operator-valued measure (POVM), which gives the statistics of the outcomes for any input state. The POVMs form a convex set, and in this language the indecomposable apparatuses are represented by extremal points—the analogous of 'pure states' in the convex set of states. Differently from the case of states, however, indecomposable POVMs are not necessarily rank-one, e.g. von Neumann measurements. In this paper we give a complete classification of indecomposable apparatuses (for discrete spectrum), by providing different necessary and sufficient conditions for extremality of POVMs, along with a simple general algorithm for the decomposition of a POVM into extremals. As an interesting application, 'informationally complete' measurements are analysed in this respect. The convex set of POVMs is fully characterized by determining its border in terms of simple algebraic properties of the corresponding POVMs.

arXiv:quant-ph/0408115•Journal of Physics A Mathematical and General•Jun 15, 2005•198 citations

Relative Entropy of Coherence Quantifies Performance in Bayesian Metrology

Ruvi Lecamwasam, Syed M. Assad, J. J. Hope +3 more

The ability of quantum states to be in superposition is one of the key features that sets them apart from the classical world. This “coherence” is rigorously quantified by resource theories, which aim to understand how such properties may be exploited in quantum technologies. There has been much research on what the resource theory of coherence can reveal about quantum metrology, almost all of which has been from the viewpoint of Fisher information. We prove, however, that the relative entropy of coherence, and its recent generalization to positive operator-valued measures (POVMs), naturally quantify the performance of Bayesian metrology. In particular, we show how a coherence measure can be applied to an ensemble of states. We then prove that during parameter estimation, the ensemble relative entropy of coherence (C) is equal to the difference between the optimal Holevo information (X), and the mutual information attained by a measurement (I). We call this relation the CXI equality. The ensemble coherence lets us visualize how much information is locked away in superposition and hence is inaccessible with a given measurement scheme and quantifies the advantage that would be gained by using a joint measurement on multiple states. Our results hold regardless of how the parameter is encoded in the state, encompassing unitary, dissipative, and discrete settings. We consider both projective measurements and general POVMs. This work suggests new directions for research in coherence, provides a novel operation interpretation for the relative entropy of coherence and its POVM generalization, and introduces a new tool to study the role of quantum features in metrology. Published by the American Physical Society 2024

arXiv:2401.16020•PRX Quantum•Jul 3, 2024•17 citations
We generalize the recent work of Massar and Popescu dealing with the amount of classical data that is produced by a quantum measurement on a quantum state ensemble. In the previous work it was shown that quantum measurements generally contain spurious randomness in the outcomes and that this spurious randomness can be eliminated by carrying out collective measurements on many independent copies of the system. In particular it was shown that, without decreasing the amount of knowledge the measurement provides about the quantum state, one can always reduce the amount of data produced by the measurement to the von Neumann entropy H(\ensuremathρ)=\ensuremath−Tr\ensuremathρlog\ensuremathρH(\ensuremath{\rho})=\ensuremath{-}\mathrm{Tr}\ensuremath{\rho}\mathrm{log}\ensuremath{\rho}H(\ensuremathρ)=\ensuremath−Tr\ensuremathρlog\ensuremathρ of the ensemble. Here we extend this result by giving a more refined description of what constitutes equivalent measurements (that is, measurements which provide the same knowledge about the quantum state) and also by considering incomplete measurements. In particular, we show that one can always associate a positive operator-valued measure (POVM) having elements aj{a}_{j}aj​ with an equivalent POVM acting on many independent copies of the system, which produces an amount of data asymptotically equal to the entropy defect of an ensemble canonically associated with the ensemble average state \ensuremath{\rho} and the initial measurement (aj).{(a}_{j}).(aj​). In the case where the measurement is not maximally refined this amount of data is strictly less than the amount H(\ensuremathρ)H(\ensuremath{\rho})H(\ensuremathρ) obtained in the previous work. We also show that this is the best achievable, i.e., it is impossible to devise a measurement equivalent to the initial measurement (aj){(a}_{j})(aj​) that produces less data. We discuss the interpretation of these results. In particular, we show how they can be used to provide a precise and model-independent measure of the amount of knowledge that is obtained about a quantum state by a quantum measurement. We also discuss in detail the relation between our results and Holevo's bound, at the same time providing a self-contained proof of this fundamental inequality.
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.
Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
In this paper we address the problem of how much can be learned about an unknown quantum state by a measurement. To this end we consider optimal measurements for the state estimation problem, that is measurements that maximize the expectation of a fidelity function. We then enlarge the class of optimal measurements to measurements that act collectively on blocks of input states, and in addition we only require that the fidelity of the measurement be arbitrarily close to the optimal fidelity. We then consider the Shannon information of the outputs of optimal measurements, which is the amount of data produced by the measurements. We show that in the enlarged class of optimal measurements described above one can always construct an optimal measurement so that the Shannon information of its outputs equals the von Neumann entropy of the unknown states. Since this result is valid for all choices of fidelity functions and all distributions of input states, it provides a model independent answer to the question of how much can be learned about a quantum state by a measurement. Namely, this result shows that a measurement can extract at most one meaningful bit from every qubit carried by the unknown state.
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.
Similarly to quantum states, also quantum measurements can be 'mixed', corresponding to a random choice within an ensemble of measuring apparatuses. Such mixing is equivalent to a sort of hidden variable, which produces a noise of purely classical nature. It is then natural to ask which apparatuses are indecomposable , i.e. do not correspond to any random choice of apparatuses. This problem is interesting not only for foundations, but also for applications, since most optimization strategies give optimal apparatuses that are indecomposable. Mathematically the problem is posed describing each measuring apparatus by a positive operator-valued measure (POVM), which gives the statistics of the outcomes for any input state. The POVMs form a convex set, and in this language the indecomposable apparatuses are represented by extremal points—the analogous of 'pure states' in the convex set of states. Differently from the case of states, however, indecomposable POVMs are not necessarily rank-one, e.g. von Neumann measurements. In this paper we give a complete classification of indecomposable apparatuses (for discrete spectrum), by providing different necessary and sufficient conditions for extremality of POVMs, along with a simple general algorithm for the decomposition of a POVM into extremals. As an interesting application, 'informationally complete' measurements are analysed in this respect. The convex set of POVMs is fully characterized by determining its border in terms of simple algebraic properties of the corresponding POVMs.
The ability of quantum states to be in superposition is one of the key features that sets them apart from the classical world. This “coherence” is rigorously quantified by resource theories, which aim to understand how such properties may be exploited in quantum technologies. There has been much research on what the resource theory of coherence can reveal about quantum metrology, almost all of which has been from the viewpoint of Fisher information. We prove, however, that the relative entropy of coherence, and its recent generalization to positive operator-valued measures (POVMs), naturally quantify the performance of Bayesian metrology. In particular, we show how a coherence measure can be applied to an ensemble of states. We then prove that during parameter estimation, the ensemble relative entropy of coherence (C) is equal to the difference between the optimal Holevo information (X), and the mutual information attained by a measurement (I). We call this relation the CXI equality. The ensemble coherence lets us visualize how much information is locked away in superposition and hence is inaccessible with a given measurement scheme and quantifies the advantage that would be gained by using a joint measurement on multiple states. Our results hold regardless of how the parameter is encoded in the state, encompassing unitary, dissipative, and discrete settings. We consider both projective measurements and general POVMs. This work suggests new directions for research in coherence, provides a novel operation interpretation for the relative entropy of coherence and its POVM generalization, and introduces a new tool to study the role of quantum features in metrology. Published by the American Physical Society 2024