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/0205155

Information-disturbance tradeoff in quantum measurement on the uniform ensemble and on the mutually unbiased bases

Howard Barnum

Published May 24, 2002• 27 citations
arXivHTMLPDF

Abstract

I consider the tradeoff between the information gained about an initially unknown quantum state, and the disturbance caused to that state by the measurement process. I show that for any distribution of initial states, the information-disturbance frontier is convex, and disturbance is nondecreasing with information gain. I consider the most general model of quantum measurements, and all post-measurement dynamics compatible with a given measurement. For the uniform initial distribution over states, I show that the least-disturbing way of making any measurement is with conditional dynamics satisfying a generalization of the projection postulate, the ``square-root dynamics.'' Thus, procedures for achieving a point on the information-disturbance frontier may be assumed to involve such conditional dynamics. Also, the information-disturbance frontier for the uniform ensemble may be achieved with ``isotropic'' (unitarily covariant) dynamics. This results in a significant simplification of the optimization problem for calculating the tradeoff in this case, giving hope for a closed-form solution. I also show that the discrete ensembles uniform on the d(d+1) vectors of a certain set of d+1 ``mutually unbiased'' or conjugate bases in d dimensions form spherical 2-designs in CP_{d-1} when d is a power of an odd prime. This implies that many of the results of the paper apply also to these discrete ensembles.

DOI
10.48550/arxiv.quant-ph/0205155

Related papers

Information-disturbance tradeoff in quantum measurement on the uniform ensemble

Howard Barnum

The author considers the tradeoff between information gained about a quantum state and disturbance caused by the measurement providing the information. For every measurement, he finds the way of making it which is least-disturbing, on average, when the initial quantum state is completely unknown.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•8 citations

Quantum state determination: estimates for information gain and some exact calculations

Manas K. Patra

It is known that mutually unbiased bases (MUBs), whenever they exist, are optimal in an information theoretic sense for the determination of the unknown state of a quantum ensemble. Such bases may not exist for most dimensions. The present paper deals with information gain in some generalizations and approximations of MUBs. We give estimates of the information loss (relative to MUBs) in these suboptimal choice of bases. For some generalization of MUBs we give exact calculations for the information gain. It is calculated directly in terms of transition probabilities among the measurement bases. We also give the formal solutions for the problem of quantum state tomography in these casesSome of the results in this paper was reported in the proceedings of EQIS 2005. A large part of this work was done at CQCT, Macquarie University, Sydney..

Journal of Physics A Mathematical and Theoretical•Aug 14, 2007•6 citations

Information Gain versus State Disturbance for a Single Qubit

Konrad Banaszek

The trade-off between the information gain and the state disturbance is derived for quantum operations on a single qubit prepared in a uniformly distributed pure state. The derivation is valid for a class of measures quantifying the state disturbance and the information gain which satisfy certain invariance conditions. This class includes in particular the Shannon entropy versus the operation fidelity. The central role in the derivation is played by efficient quantum operations, which leave the system in a pure output state for any measurement outcome. It is pointed out that the optimality of efficient quantum operations among those inducing a given operator-valued measure is related to Davies' characterization of convex invariant functions on hermitian operators.

arXiv:quant-ph/0006062•Open Systems & Information Dynamics•Mar 1, 2006•21 citations

Tradeoff relations for two-valued qubit measurements

Huarui Xing, Shuming Cheng, Lijun Liu

Quantum measurement is essentially taken to gain information encoded in quantum states, however, it also inevitably disturbs the measured state such that the postmeasurement state loses its quantum information partially or fully. Thus, it is an important issue to characterise such information gain and state disturbance associated with measurement. In this work, we study the relationships between the information gain and measurement disturbance for two-valued qubit measurements. In particular, we employ a powerful tradeoff relation between the measurement strength and reversibility to obtain, generalise, and even strengthen certain well-known tradeoff relations between information gain and measurement disturbance of qubit measurements. Moreover, it is pointed out that our results are useful to understand the measurement effects at the fundamental level as they are state-independent. Hence, our work is helpful for designing quantum information processing tasks aided by measurement.

Chinese Control Conference (CCC)•Jul 26, 2021•0 citations

State Discrimination with Post-Measurement Information

Manuel A. Ballester, Stephanie Wehner, Andreas Winter

We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also exhibit an example where the extra information does not give any advantage at all. Interestingly, choosing the string x uniformly at random is not always the hardest distribution, even when f is balanced.

•Aug 1, 2006•28 citations

Information disturbance tradeoff in bidirectional QKD

Nur Rahimah Sakinah Abdul Salam, Jesni Shamsul Shaari, Stefano Mancini

Abstract Making use of the Quantum Network formalism of Phys. Rev. A, 82 (2010) 062 305, we present the case for quantum networks with finite outcomes, more specifically one which could distinguish only between specific unitary operators in a given basis for operators. Despite its simplicity, we proceed to build a network derived from the optimal strategy in Phys. Rev. A, 82 (2010) 062 305 and show that the information-disturbance tradeoff in distinguishing between two operators acting on qubits, selected from mutually unbiased unitary bases is equal to the case of estimating an operator selected randomly from the set of SU(2) based on the Haar measure. This suggests that such strategies in distinguishing between mutually unbiased operators is not any easier than estimating an operator derived from an infinite set. We then show how this network can be used as a natural attack strategy against a bidirectional quantum cryptographic protocol.

arXiv:2403.19156•Physica Scripta•Sep 10, 2024•1 citation
I consider the tradeoff between the information gained about an initially unknown quantum state, and the disturbance caused to that state by the measurement process. I show that for any distribution of initial states, the information-disturbance frontier is convex, and disturbance is nondecreasing with information gain. I consider the most general model of quantum measurements, and all post-measurement dynamics compatible with a given measurement. For the uniform initial distribution over states, I show that the least-disturbing way of making any measurement is with conditional dynamics satisfying a generalization of the projection postulate, the square-root dynamics.'' Thus, procedures for achieving a point on the information-disturbance frontier may be assumed to involve such conditional dynamics. Also, the information-disturbance frontier for the uniform ensemble may be achieved with isotropic'' (unitarily covariant) dynamics. This results in a significant simplification of the optimization problem for calculating the tradeoff in this case, giving hope for a closed-form solution. I also show that the discrete ensembles uniform on the d(d+1) vectors of a certain set of d+1 ``mutually unbiased'' or conjugate bases in d dimensions form spherical 2-designs in CP_{d-1} when d is a power of an odd prime. This implies that many of the results of the paper apply also to these discrete ensembles.
It is known that mutually unbiased bases (MUBs), whenever they exist, are optimal in an information theoretic sense for the determination of the unknown state of a quantum ensemble. Such bases may not exist for most dimensions. The present paper deals with information gain in some generalizations and approximations of MUBs. We give estimates of the information loss (relative to MUBs) in these suboptimal choice of bases. For some generalization of MUBs we give exact calculations for the information gain. It is calculated directly in terms of transition probabilities among the measurement bases. We also give the formal solutions for the problem of quantum state tomography in these casesSome of the results in this paper was reported in the proceedings of EQIS 2005. A large part of this work was done at CQCT, Macquarie University, Sydney..
The trade-off between the information gain and the state disturbance is derived for quantum operations on a single qubit prepared in a uniformly distributed pure state. The derivation is valid for a class of measures quantifying the state disturbance and the information gain which satisfy certain invariance conditions. This class includes in particular the Shannon entropy versus the operation fidelity. The central role in the derivation is played by efficient quantum operations, which leave the system in a pure output state for any measurement outcome. It is pointed out that the optimality of efficient quantum operations among those inducing a given operator-valued measure is related to Davies' characterization of convex invariant functions on hermitian operators.
Quantum measurement is essentially taken to gain information encoded in quantum states, however, it also inevitably disturbs the measured state such that the postmeasurement state loses its quantum information partially or fully. Thus, it is an important issue to characterise such information gain and state disturbance associated with measurement. In this work, we study the relationships between the information gain and measurement disturbance for two-valued qubit measurements. In particular, we employ a powerful tradeoff relation between the measurement strength and reversibility to obtain, generalise, and even strengthen certain well-known tradeoff relations between information gain and measurement disturbance of qubit measurements. Moreover, it is pointed out that our results are useful to understand the measurement effects at the fundamental level as they are state-independent. Hence, our work is helpful for designing quantum information processing tasks aided by measurement.
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also exhibit an example where the extra information does not give any advantage at all. Interestingly, choosing the string x uniformly at random is not always the hardest distribution, even when f is balanced.
Abstract Making use of the Quantum Network formalism of Phys. Rev. A, 82 (2010) 062 305, we present the case for quantum networks with finite outcomes, more specifically one which could distinguish only between specific unitary operators in a given basis for operators. Despite its simplicity, we proceed to build a network derived from the optimal strategy in Phys. Rev. A, 82 (2010) 062 305 and show that the information-disturbance tradeoff in distinguishing between two operators acting on qubits, selected from mutually unbiased unitary bases is equal to the case of estimating an operator selected randomly from the set of SU(2) based on the Haar measure. This suggests that such strategies in distinguishing between mutually unbiased operators is not any easier than estimating an operator derived from an infinite set. We then show how this network can be used as a natural attack strategy against a bidirectional quantum cryptographic protocol.