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

Optimum unambiguous discrimination of linearly independent pure states

Shengshi Pang, Shengjun Wu

Published Nov 12, 2009• 58 citations
arXivHTMLPDF

Abstract

Given $n$ linearly independent pure states and their prior probabilities, we study the optimum unambiguous state discrimination problem. We derive the conditions for the optimum measurement strategy to achieve the maximum average success probability and establish two sets of equations that must be satisfied by the optimum solution in different situations. We also provide the detailed steps to find the optimum measurement strategy. The method and results we obtain are given a geometrical illustration with a numerical example. Furthermore, using these equations, we derive a formula which shows a clear analytical relation between the optimum solution and the $n$ states to be discriminated. We also solve a generalized equal-probability measurement problem analytically. Finally, as another application of our result, the unambiguous discrimination problem of three pure states is studied in detail and analytical solutions are obtained for some interesting cases.

DOI
10.1103/physreva.80.052320

Related papers

A semidefinite programming approach to optimal unambiguous discrimination of quantum states

Yonina C. Eldar

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.

arXiv:quant-ph/0206093•IEEE Transactions on Information Theory•Feb 1, 2003•129 citations

Optimum unambiguous identification of d unknown pure qudit states

Ulrike Herzog, János A. Bergou

We address the problem of unambiguously identifying the state of a probe qudit with the state of one of $d$ reference qudits. The $d$ reference states are assumed pure and linearly independent but we have no knowledge of them. The state of the probe qudit is assumed to coincide equally likely with either one of the $d$ unknown reference states. We derive the optimum measurement strategy that maximizes the success probability of unambiguous identification and find that the optimum strategy is a generalized measurement. We give both the measurement operators and the optimum success probability explicitly. Technically, the problem we solve amounts to the optimum unambiguous discrimination of $d$ known mixed quantum states.

arXiv:0809.4884•Physical Review A•Sep 17, 2008•17 citations

Unambiguous discrimination of linearly independent pure quantum states: Optimal average probability of success

Somshubhro Bandyopadhyay

We consider the problem of unambiguous (error-free) discrimination of $N$ linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that for any $N\ensuremath{\ge}2$ an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.

arXiv:1404.3574•Physical Review A•Sep 5, 2014•12 citations

Optimum unambiguous discrimination between subsets of nonorthogonal quantum states

Yuqing Sun, János A. Bergou, Mark S. Hillery

It is known that unambiguous discrimination among nonorthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three nonorthogonal states, ${|{\ensuremath{\psi}}_{1}〉,|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉},$ we show that the optimal strategy to distinguish $|{\ensuremath{\psi}}_{1}〉$ from the set ${|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉}$ has a higher success rate than if we wish to discriminate among all three states. Somewhat surprisingly, for unambiguous discrimination the subsets need not be linearly independent. A fully analytical solution is presented, and we also show how to construct generalized interferometers (multiport) which provide an optical implementation of the optimal strategy.

arXiv:quant-ph/0112051•Physical Review A•Sep 23, 2002•73 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

Optimum measurement for unambiguously discriminating two mixed states: General considerations and special cases

Herzog, U, Bergou, J A

Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.

•Oct 21, 2005•2 citations
Given nnn linearly independent pure states and their prior probabilities, we study the optimum unambiguous state discrimination problem. We derive the conditions for the optimum measurement strategy to achieve the maximum average success probability and establish two sets of equations that must be satisfied by the optimum solution in different situations. We also provide the detailed steps to find the optimum measurement strategy. The method and results we obtain are given a geometrical illustration with a numerical example. Furthermore, using these equations, we derive a formula which shows a clear analytical relation between the optimum solution and the nnn states to be discriminated. We also solve a generalized equal-probability measurement problem analytically. Finally, as another application of our result, the unambiguous discrimination problem of three pure states is studied in detail and analytical solutions are obtained for some interesting cases.
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.
We address the problem of unambiguously identifying the state of a probe qudit with the state of one of ddd reference qudits. The ddd reference states are assumed pure and linearly independent but we have no knowledge of them. The state of the probe qudit is assumed to coincide equally likely with either one of the ddd unknown reference states. We derive the optimum measurement strategy that maximizes the success probability of unambiguous identification and find that the optimum strategy is a generalized measurement. We give both the measurement operators and the optimum success probability explicitly. Technically, the problem we solve amounts to the optimum unambiguous discrimination of ddd known mixed quantum states.
We consider the problem of unambiguous (error-free) discrimination of NNN linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that for any $N\ensuremath{\ge}2$ an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.
It is known that unambiguous discrimination among nonorthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three nonorthogonal states, ${|{\ensuremath{\psi}}_{1}〉,|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉},$ we show that the optimal strategy to distinguish $|{\ensuremath{\psi}}_{1}〉$ from the set ${|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉}$ has a higher success rate than if we wish to discriminate among all three states. Somewhat surprisingly, for unambiguous discrimination the subsets need not be linearly independent. A fully analytical solution is presented, and we also show how to construct generalized interferometers (multiport) which provide an optical implementation of the optimal strategy.
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.
Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.