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:1511.02309 · Advances in Mathematical Physics

Entropic Lower Bound for Distinguishability of Quantum States

Seungho Yang, Jinhyoung Lee, Hyunseok Jeong

Published Jan 1, 2015• 0 citations
arXivHTMLPDF

Abstract

For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.

DOI
10.1155/2015/683658

Related papers

Entropic Lower Bound for Distinguishability of Quantum States

Seung-Ho Yang, Jinhyoung Lee, Hyunseok Jeong

For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.

•Jan 1, 2015•2 citations

Lower bound for accessible information in quantum mechanics

Richard Jozsa, Daniel Robb, William K. Wootters

It has long been known that the von Neumann entropy S is an upper bound on the information one can extract from a quantum system in an unknown pure state. In this paper we define the ``subentropy'' Q, which we prove to be a lower bound on this information. Moreover, just as the von Neumann entropy is the best upper bound that depends only on the density matrix, we show that Q is the best lower bound that depends only on the density matrix. Other parallels between S and Q are also demonstrated.

Physical Review A•Feb 1, 1994•159 citations

Entropy of Quantum States

Paolo Facchi A, Giovanni Gramegna, Arturo Konderak

Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so-defined satisfies all the desirable thermodynamic properties and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.

arXiv:2104.12611•Entropy•May 21, 2021•10 citations

Distinguishability of states and von Neumann entropy

Richard Jozsa, J. Schlienz

Let ${|{\ensuremath{\psi}}_{1}〉,\dots{},|{\ensuremath{\psi}}_{n}〉{;p}_{1},\dots{}{,p}_{n}}$ be an ensemble of pure quantum states. We show that it is possible to increase all of the pairwise overlaps $|〈{\ensuremath{\psi}}_{i}|{\ensuremath{\psi}}_{j}〉|,$ i.e., make each constituent pair of the states more parallel (while keeping the prior probabilities the same), in such a way that the von Neumann entropy S is increased, and dually, make all pairs more orthogonal while decreasing S. We show that this phenomenon cannot occur for ensembles in two dimensions but that it is a feature of almost all ensembles of three states in three dimensions. It is known that the von Neumann entropy characterizes the classical and quantum information capacities of the ensemble and we argue that information capacity, in turn, is a manifestation of the distinguishability of the signal states. Hence, our result shows that the notion of distinguishability within an ensemble is a global property that cannot be reduced to considering distinguishability of each constituent pair of states.

arXiv:quant-ph/9911009•Physical Review A•Jun 5, 2000•101 citations

Generalized entropic criterion for separability

R. Rossignoli, N. Canosa

We discuss the entropic criterion for separability of compound quantum systems for general nonadditive entropic forms based on arbitrary concave functions f. For any separable state, the generalized entropy of the whole system is shown to be not smaller than that of the subsystems, for any choice of f, providing thus a necessary criterion for separability. Nevertheless, the criterion is not sufficient and examples of entangled states with the same property are provided. This entails, in particular, that the conjecture about the positivity of the conditional Tsallis entropy for all q, a more stringent requirement than the positivity of the conditional von Neumann entropy, is actually a necessary but not sufficient condition for separability in general. The direct relation between the entropic criterion and the largest eigenvalues of the full and reduced density operators of the system is also discussed.

arXiv:1505.03608•Physical Review A•Oct 11, 2002•62 citations

On the distinguishability of random quantum states

Ashley Montanaro

We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum states in d dimensions, where n/d approaches a constant. In particular, for almost all ensembles of n states in n dimensions, p>0.72. An application to distinguishing Boolean functions (the "oracle identification problem") in quantum computation is given.

•Jan 1, 2006•42 citations
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are all pure, acquiring the entropic lower bound requires only the density operator and the number of the possible states. This entropic bound shows a relation between the von Neumann entropy and the distinguishability.
It has long been known that the von Neumann entropy S is an upper bound on the information one can extract from a quantum system in an unknown pure state. In this paper we define the ``subentropy'' Q, which we prove to be a lower bound on this information. Moreover, just as the von Neumann entropy is the best upper bound that depends only on the density matrix, we show that Q is the best lower bound that depends only on the density matrix. Other parallels between S and Q are also demonstrated.
Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so-defined satisfies all the desirable thermodynamic properties and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.
Let ${|{\ensuremath{\psi}}_{1}〉,\dots{},|{\ensuremath{\psi}}_{n}〉{;p}_{1},\dots{}{,p}_{n}}$ be an ensemble of pure quantum states. We show that it is possible to increase all of the pairwise overlaps $|〈{\ensuremath{\psi}}_{i}|{\ensuremath{\psi}}_{j}〉|,$ i.e., make each constituent pair of the states more parallel (while keeping the prior probabilities the same), in such a way that the von Neumann entropy S is increased, and dually, make all pairs more orthogonal while decreasing S. We show that this phenomenon cannot occur for ensembles in two dimensions but that it is a feature of almost all ensembles of three states in three dimensions. It is known that the von Neumann entropy characterizes the classical and quantum information capacities of the ensemble and we argue that information capacity, in turn, is a manifestation of the distinguishability of the signal states. Hence, our result shows that the notion of distinguishability within an ensemble is a global property that cannot be reduced to considering distinguishability of each constituent pair of states.
We discuss the entropic criterion for separability of compound quantum systems for general nonadditive entropic forms based on arbitrary concave functions f. For any separable state, the generalized entropy of the whole system is shown to be not smaller than that of the subsystems, for any choice of f, providing thus a necessary criterion for separability. Nevertheless, the criterion is not sufficient and examples of entangled states with the same property are provided. This entails, in particular, that the conjecture about the positivity of the conditional Tsallis entropy for all q, a more stringent requirement than the positivity of the conditional von Neumann entropy, is actually a necessary but not sufficient condition for separability in general. The direct relation between the entropic criterion and the largest eigenvalues of the full and reduced density operators of the system is also discussed.
We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum states in d dimensions, where n/d approaches a constant. In particular, for almost all ensembles of n states in n dimensions, p>0.72. An application to distinguishing Boolean functions (the "oracle identification problem") in quantum computation is given.