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:1207.1197 · Quantum Information and Computation

Comparisons between quantum state distinguishability measures

Koenraad M. R. Audenaert

Published Jan 1, 2014• 51 citations
arXivHTMLPDF

Abstract

We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these inequalities are already known, but new or more general proofs are given, whereas other inequalities are new. We also supply cases of equality to show that all inequalities are indeed the sharpest possible.

DOI
10.26421/qic14.1-2-2

Related papers

A ‘Pretty Good’ Measurement for Distinguishing Quantum States

Paul A. Hausladen, William K. Wootters

We address the problem of extracting information from a single quantum system whose state is known to be in one of several possible states. In the generic case, it is notoriously difficult to find the optimal measurement, that is the measurement that provides the most possible information about the system's state. We consider a simple general prescription for a measurement that is typically not optimal but appears to be quite good. It seems to be particularly good when the states to be distinguished are equally likely and almost orthogonal.

Journal of Modern Optics•Dec 1, 1994•337 citations

Distinguishing sets of quantum states

Rahul Jain

Given two sets finite $S_0$ and $S_1$ of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.

arXiv:quant-ph/0506205•Jun 24, 2005•5 citations

Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality

Iman Marvian

Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.

arXiv:2003.05984•Mar 12, 2020•20 citations

About quantum state characterization

Tatiana Alieva, André M. Barbé

Examples of different pure quantum states which are not distinguishable by the finite set of their marginal distributions are presented.

Journal of Physics A Mathematical and General•Oct 2, 1998•0 citations

Data processing for the sandwiched Rényi divergence: a condition for equality

Felix Leditzky, Cambyse Rouzé, Nilanjana Datta

The $$\alpha $$ -sandwiched Rényi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for $$\alpha \ge 1/2$$ . In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the $$\alpha $$ -sandwiched Rényi divergence for all $$\alpha \ge 1/2$$ . For the range $$\alpha \in [1/2,1)$$ , our result provides the only condition for equality obtained thus far. To prove our result, we first consider the special case of partial trace and derive a condition for equality based on the original proof of the data processing inequality by Frank and Lieb (J Math Phys 54(12):122201, 2013) using a strict convexity/concavity argument. We then generalize to arbitrary quantum operations via the Stinespring Representation Theorem. As applications of our condition for equality in the data processing inequality, we deduce conditions for equality in various entropic inequalities. We formulate a Rényi version of the Araki–Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb (Lett Math Phys 101(1):1–11, 2012) about equality in the original Araki–Lieb inequality. Furthermore, we prove a general lower bound on a Rényi version of the entanglement of formation and observe that it is attained by states saturating the Rényi version of the Araki–Lieb inequality. Finally, we prove that the known upper bound on the entanglement fidelity in terms of the usual fidelity is saturated only by pure states.

arXiv:1604.02119•Letters in Mathematical Physics•Nov 15, 2016•30 citations

Ordering of Entangled States for Different Entanglement Measures

Jennie Sköld

Quantum entanglement is a phenomenon which has shown great potential use in modern technical implementations, but there is still much development needed in the field. One major problem is how to measure the amount of entanglement present in a given entangled state. There are numerous different entanglement measures suggested, all satisfying some conditions being of either operational, or more abstract, mathematical nature. However, in contradiction to what one might expect, the measures show discrepancies in the ordering of entangled states. Concretely this means that with respect to one measure, a state can be more entangled than another state, but the ordering may be opposite for the same states using another measure. In this thesis we take a closer look at some of the most commonly occurring entanglement measures, and find examples of states showing inequivalent entanglement ordering for the different measures.

•Jan 1, 2014•0 citations
We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these inequalities are already known, but new or more general proofs are given, whereas other inequalities are new. We also supply cases of equality to show that all inequalities are indeed the sharpest possible.
We address the problem of extracting information from a single quantum system whose state is known to be in one of several possible states. In the generic case, it is notoriously difficult to find the optimal measurement, that is the measurement that provides the most possible information about the system's state. We consider a simple general prescription for a measurement that is typically not optimal but appears to be quite good. It seems to be particularly good when the states to be distinguished are equally likely and almost orthogonal.
Given two sets finite S0S_0S0​ and S1S_1S1​ of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.
Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.
The α\alpha α -sandwiched Rényi divergence satisfies the data processing inequality, i.e. monotonicity under quantum operations, for α≥1/2\alpha \ge 1/2α≥1/2 . In this article, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality for the α\alpha α -sandwiched Rényi divergence for all α≥1/2\alpha \ge 1/2α≥1/2 . For the range α∈[1/2,1)\alpha \in [1/2,1)α∈[1/2,1) , our result provides the only condition for equality obtained thus far. To prove our result, we first consider the special case of partial trace and derive a condition for equality based on the original proof of the data processing inequality by Frank and Lieb (J Math Phys 54(12):122201, 2013) using a strict convexity/concavity argument. We then generalize to arbitrary quantum operations via the Stinespring Representation Theorem. As applications of our condition for equality in the data processing inequality, we deduce conditions for equality in various entropic inequalities. We formulate a Rényi version of the Araki–Lieb inequality and analyze the case of equality, generalizing a result by Carlen and Lieb (Lett Math Phys 101(1):1–11, 2012) about equality in the original Araki–Lieb inequality. Furthermore, we prove a general lower bound on a Rényi version of the entanglement of formation and observe that it is attained by states saturating the Rényi version of the Araki–Lieb inequality. Finally, we prove that the known upper bound on the entanglement fidelity in terms of the usual fidelity is saturated only by pure states.
Quantum entanglement is a phenomenon which has shown great potential use in modern technical implementations, but there is still much development needed in the field. One major problem is how to measure the amount of entanglement present in a given entangled state. There are numerous different entanglement measures suggested, all satisfying some conditions being of either operational, or more abstract, mathematical nature. However, in contradiction to what one might expect, the measures show discrepancies in the ordering of entangled states. Concretely this means that with respect to one measure, a state can be more entangled than another state, but the ordering may be opposite for the same states using another measure. In this thesis we take a closer look at some of the most commonly occurring entanglement measures, and find examples of states showing inequivalent entanglement ordering for the different measures.