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:0711.4286 · Physical Review A

Quantum state discrimination: A geometric approach

Damian Markham, Jarosław Adam Miszczak, Zbigniew Puchała, Karol Życzkowski

Published Apr 16, 2008• 57 citations
arXivHTMLPDF

Abstract

We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.

DOI
10.1103/physreva.77.042111

Related papers

Geometric quantum discord with Bures distance: the qubit case

Dominique Spehner, M Orszag

The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in terms of the eigenvalues of a (2 n B ) × (2 n B ) Hermitian matrix, n B being the Hilbert space dimension of the other subsystem B . As a first application, we calculate the geometric discord for the output state of the DQC1 algorithm. We find that it takes its highest value when the unitary matrix from which the algorithm computes the trace has its eigenvalues uniformly distributed on the unit circle modulo a symmetry with respect to the origin. As a second application, we derive an explicit formula for the geometric discord of a two-qubit state ρ with maximally mixed marginals and compare it with other measures of quantum correlations. We also determine the closest classical states to ρ.

arXiv:1308.5005•Journal of Physics A Mathematical and Theoretical•Dec 20, 2013•54 citations

A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States

Yonina C. Eldar

Abstract—In this paper, we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint. Index Terms—Compound geometrically uniform (CGU) quantum states, equal-probability measurement (EPM), geometrically uniform (GU) quantum states, quantum detection, semidefinite programming, unambiguous discrimination. I.

•Jun 14, 2002•87 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

An efficient geometric approach to quantum-inspired classifications

Roberto Leporini, Davide Pastorello

Optimal measurements for the discrimination of quantum states are useful tools for classification problems. In order to exploit the potential of quantum computers, feature vectors have to be encoded into quantum states represented by density operators. However, quantum-inspired classifiers based on nearest mean and on Helstrom state discrimination are implemented on classical computers. We show a geometric approach that improves the efficiency of quantum-inspired classification in terms of space and time acting on quantum encoding and allows one to compare classifiers correctly in the presence of multiple preparations of the same quantum state as input. We also introduce the nearest mean classification based on Bures distance, Hellinger distance and Jensen-Shannon distance comparing the performance with respect to well-known classifiers applied to benchmark datasets.

Scientific Reports•May 24, 2022•9 citations

On the distinguishability of geometrically uniform quantum states

Juntai Zhou, Stefano Chessa, Eric Chitambar +1 more

Abstract A geometrically uniform (GU) ensemble is a uniformly weighted quantum state ensemble generated from a fixed state by a unitary representation of a finite group G. In this work we analyze the problem of discriminating GU ensembles from various angles. Assuming that the representation of G is irreducible, we first show that a particular optimal measurement can be understood as the limit of weighted ‘pretty good measurements’ (PGMs). This naturally provides examples of state discrimination for which the unweighted PGM is provably sub-optimal. We extend this analysis to certain reducible representations, and use Schur–Weyl duality to discuss two particular examples of GU ensembles in terms of Werner-type and permutation-invariant generator states. For the case of pure-state GU ensembles we give a streamlined proof of optimality of the PGM first proved in Eldar et al (2004 IEEE Trans. Inf. Theory 50 1198–207). We use this result to give simplified proofs of the optimality of the PGM, along with expressions for the corresponding success probabilities, for two tasks: the hidden subgroup problem (HSP) over semidirect product groups (first proved in Bacon et al (2005 46th Annual IEEE Symp. Foundations of Computer Science (FOCS’05) pp 469–78), and port-based teleportation (first proved in Mozrzymas et al (2019 New J. Phys. 20 053006) and Leditzky (2022 Lett. Math. Phys. 112 98). Finally, we consider the n-copy setting and adapt a result of Montanaro (2007 Commun. Math. Phys. 273 619–36) to derive a compact and easily evaluated lower bound on the success probability of the PGM for this task. This result can be applied to the HSP to obtain a new proof for an upper bound on the sample complexity by Hayashi et al (2006 Quantum Inf. Comput. 8 345–58).

arXiv:2501.12376•Journal of Physics A Mathematical and Theoretical•Sep 23, 2025•6 citations

Discrimination of geometrically uniform states and the no-signaling principle

Xin Lü

Abstract The link between quantum state discrimination and the no-signaling principle is applied to discriminating geometrically uniform states. Specifically, the original discrimination problem is converted to constructing the complementary matrix with predetermined off-diagonal entries. Two such constructions are given explicitly, and therefore three upper bounds on the success probability are derived. Those upper bounds are then employed to estimate the robustness of coherence, where we establish a larger class of states with equal robustness of coherence and l 1 -norm of coherence, and provide the exact answer of the robustness of coherence for any states that are diagonalized by Hadamard matrices.

Physica Scripta•Apr 20, 2023•0 citations
We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.
The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in terms of the eigenvalues of a (2 n B ) × (2 n B ) Hermitian matrix, n B being the Hilbert space dimension of the other subsystem B . As a first application, we calculate the geometric discord for the output state of the DQC1 algorithm. We find that it takes its highest value when the unitary matrix from which the algorithm computes the trace has its eigenvalues uniformly distributed on the unit circle modulo a symmetry with respect to the origin. As a second application, we derive an explicit formula for the geometric discord of a two-qubit state ρ with maximally mixed marginals and compare it with other measures of quantum correlations. We also determine the closest classical states to ρ.
Abstract—In this paper, we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint. Index Terms—Compound geometrically uniform (CGU) quantum states, equal-probability measurement (EPM), geometrically uniform (GU) quantum states, quantum detection, semidefinite programming, unambiguous discrimination. I.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
Optimal measurements for the discrimination of quantum states are useful tools for classification problems. In order to exploit the potential of quantum computers, feature vectors have to be encoded into quantum states represented by density operators. However, quantum-inspired classifiers based on nearest mean and on Helstrom state discrimination are implemented on classical computers. We show a geometric approach that improves the efficiency of quantum-inspired classification in terms of space and time acting on quantum encoding and allows one to compare classifiers correctly in the presence of multiple preparations of the same quantum state as input. We also introduce the nearest mean classification based on Bures distance, Hellinger distance and Jensen-Shannon distance comparing the performance with respect to well-known classifiers applied to benchmark datasets.
Abstract A geometrically uniform (GU) ensemble is a uniformly weighted quantum state ensemble generated from a fixed state by a unitary representation of a finite group G. In this work we analyze the problem of discriminating GU ensembles from various angles. Assuming that the representation of G is irreducible, we first show that a particular optimal measurement can be understood as the limit of weighted ‘pretty good measurements’ (PGMs). This naturally provides examples of state discrimination for which the unweighted PGM is provably sub-optimal. We extend this analysis to certain reducible representations, and use Schur–Weyl duality to discuss two particular examples of GU ensembles in terms of Werner-type and permutation-invariant generator states. For the case of pure-state GU ensembles we give a streamlined proof of optimality of the PGM first proved in Eldar et al (2004 IEEE Trans. Inf. Theory 50 1198–207). We use this result to give simplified proofs of the optimality of the PGM, along with expressions for the corresponding success probabilities, for two tasks: the hidden subgroup problem (HSP) over semidirect product groups (first proved in Bacon et al (2005 46th Annual IEEE Symp. Foundations of Computer Science (FOCS’05) pp 469–78), and port-based teleportation (first proved in Mozrzymas et al (2019 New J. Phys. 20 053006) and Leditzky (2022 Lett. Math. Phys. 112 98). Finally, we consider the n-copy setting and adapt a result of Montanaro (2007 Commun. Math. Phys. 273 619–36) to derive a compact and easily evaluated lower bound on the success probability of the PGM for this task. This result can be applied to the HSP to obtain a new proof for an upper bound on the sample complexity by Hayashi et al (2006 Quantum Inf. Comput. 8 345–58).
Abstract The link between quantum state discrimination and the no-signaling principle is applied to discriminating geometrically uniform states. Specifically, the original discrimination problem is converted to constructing the complementary matrix with predetermined off-diagonal entries. Two such constructions are given explicitly, and therefore three upper bounds on the success probability are derived. Those upper bounds are then employed to estimate the robustness of coherence, where we establish a larger class of states with equal robustness of coherence and l 1 -norm of coherence, and provide the exact answer of the robustness of coherence for any states that are diagonalized by Hadamard matrices.