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

IEEE International Symposium on Information Theory (ISIT)

Optimal measurements for symmetric quantum states with applications to optical quantum communication

Hari Krovi, Saikat Guha, Zachary Dutton, Marcus Palmer Da Silva

Published Jun 1, 2014• 1 citation
Publisher

Abstract

Minimum probability of error (MPE) measurements are quantum mechanical measurements that discriminate between a set of candidate states and achieve the minimum error allowed by quantum mechanics. Conditions for a measurement to be an MPE measurement have been derived by Yuen, Kennedy and Lax. But finding explicit measurements that satisfy these conditions is a hard problem in general and even in cases where an explicit measurement is known, calculating the MPE of the measurement is not easy. In some cases, MPE measurements have been found such as when the states form a single orbit under a group action i.e., there is a transitive group action on the states. For such state sets, termed Geometrically Uniform (GU) in [1], it was shown that the `pretty good measurement' (PGM) is optimal. However, calculating the MPE and other performance metrics for the PGM involves inverting large matrices, and it is therefore not easy in general to evaluate. Our first contribution is a formula for the MPE and conditional probabilities of GU sets using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). CGU sets appear in many practical problems in quantum communication and imaging. For example, they include all linear codes formed using pure-state modulation constellations, which are known to achieve the ultimate (Holevo) capacity of optical communication. Optimal (MPE) measurement for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the optimal measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many group representations (such as those of several practical good linear codes), this is much more tractable than solving large semi-definite programs-which is what is needed to solve for MPE measurements for an arbitrary set of pure states using the Yuen-Kennedy-Lax conditions [2]. We show examples of the evaluation of optimal measurements for CGU states.

DOI
10.1109/isit.2014.6874850

Related papers

Optimal measurements for symmetric quantum states with applications to optical communication

Hari Krovi, Saikat Guha, Zachary Dutton +1 more

The minimum probability of error (MPE) measurement discriminates between a set of candidate quantum states with the minimum average error probability allowed by quantum mechanics. Conditions for a measurement to be MPE were derived by Yuen, Kennedy, and Lax [H. P. Yuen et al., IEEE Trans. Info. Theory IT-21, 125134 (1975)]. MPE measurements have been found for states that form a single orbit under a group action, i.e., there is a transitive group action on the states in the set. For such state sets, termed geometrically uniform (GU) previously, it was shown that the ``pretty good measurement'' attains the MPE. Even so, evaluating the actual probability of error (and other performance metrics) attained by the pretty good measurement on a GU set involves inverting large matrices and is not easy in general. Our first contribution is a formula for the MPE and conditional probabilities of GU sets, using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). MPE measurements for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the MPE measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many common group representations (such as those of several practical good linear codes), this is much more tractable than solving large semidefinite programs---which is what is needed to solve the Yuen-Kennedy-Lax conditions numerically for arbitrary state sets. We show how to evaluate MPE measurements for CGU states in some examples relevant to quantum-limited classical optical communication.

arXiv:1507.04737•Physical Review A•Dec 21, 2015•26 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•83 citations

Optimal Detection of Symmetric Mixed Quantum States

Yonina C. Eldar, Alexandre Megretski, George C. Verghese

We develop a sufficient condition for the least-squares measurement (LSM), or the square-root measurement, to minimize the probability of a detection error when distinguishing between a collection of mixed quantum states. Using this condition we derive the optimal measurement for state sets with a broad class of symmetries. We first consider geometrically uniform (GU) state sets with a possibly non-Abelian generating group, and show that if the generator satisfies a weighted norm constraint, then the LSM is optimal. In particular, for pure-state GU ensembles, the LSM is shown to be optimal. For arbitrary GU state sets we show that the optimal measurement operators are GU with generator that can be computed very efficiently in polynomial time, within any desired accuracy. We then consider compound GU (CGU) state sets which consist of subsets that are GU. When the generators satisfy a certain constraint, the LSM is again optimal. For arbitrary CGU state sets, the optimal measurement operators are shown to be CGU with generators that can be computed efficiently in polynomial time.

arXiv:quant-ph/0211111•IEEE Transactions on Information Theory•Jun 1, 2004•151 citations

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•120 citations

Optimality of square-root measurements in quantum state discrimination

Nicola Dalla Pozza, Gianfranco L. Pierobon

Distinguishing assigned quantum states with assigned probabilities via quantum measurements is a crucial problem for the transmission of classical information through quantum channels. Measurement operators maximizing the probability of correct discrimination have been characterized by Helstrom, Holevo, and Yuen since the 1970s. On the other hand, closed-form solutions are available only for particular situations enjoying high degrees of symmetry. As a suboptimal solution to the problem, measurement operators, directly determined from states and probabilities and known as square-root measurements (SRMs), were introduced by Hausladen and Wootters. These operators were also recognized to be optimal for pure states equipped with geometrical uniform symmetry (GUS). In this paper we discuss the optimality of the SRM and find necessary and sufficient conditions in order that SRM maximize the correct decision probabilities for the set of states formed by several constellations of GUS states. The results are applied to some specific examples concerning double constellations of quantum phase-shift keying and pulse-position modulation states, with possible applications to practical systems of quantum communications.

arXiv:1504.04908•Physical Review A•Apr 27, 2015•56 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•0 citations
Minimum probability of error (MPE) measurements are quantum mechanical measurements that discriminate between a set of candidate states and achieve the minimum error allowed by quantum mechanics. Conditions for a measurement to be an MPE measurement have been derived by Yuen, Kennedy and Lax. But finding explicit measurements that satisfy these conditions is a hard problem in general and even in cases where an explicit measurement is known, calculating the MPE of the measurement is not easy. In some cases, MPE measurements have been found such as when the states form a single orbit under a group action i.e., there is a transitive group action on the states. For such state sets, termed Geometrically Uniform (GU) in [1], it was shown that the `pretty good measurement' (PGM) is optimal. However, calculating the MPE and other performance metrics for the PGM involves inverting large matrices, and it is therefore not easy in general to evaluate. Our first contribution is a formula for the MPE and conditional probabilities of GU sets using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). CGU sets appear in many practical problems in quantum communication and imaging. For example, they include all linear codes formed using pure-state modulation constellations, which are known to achieve the ultimate (Holevo) capacity of optical communication. Optimal (MPE) measurement for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the optimal measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many group representations (such as those of several practical good linear codes), this is much more tractable than solving large semi-definite programs-which is what is needed to solve for MPE measurements for an arbitrary set of pure states using the Yuen-Kennedy-Lax conditions [2]. We show examples of the evaluation of optimal measurements for CGU states.
The minimum probability of error (MPE) measurement discriminates between a set of candidate quantum states with the minimum average error probability allowed by quantum mechanics. Conditions for a measurement to be MPE were derived by Yuen, Kennedy, and Lax [H. P. Yuen et al., IEEE Trans. Info. Theory IT-21, 125134 (1975)]. MPE measurements have been found for states that form a single orbit under a group action, i.e., there is a transitive group action on the states in the set. For such state sets, termed geometrically uniform (GU) previously, it was shown that the ``pretty good measurement'' attains the MPE. Even so, evaluating the actual probability of error (and other performance metrics) attained by the pretty good measurement on a GU set involves inverting large matrices and is not easy in general. Our first contribution is a formula for the MPE and conditional probabilities of GU sets, using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). MPE measurements for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the MPE measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many common group representations (such as those of several practical good linear codes), this is much more tractable than solving large semidefinite programs---which is what is needed to solve the Yuen-Kennedy-Lax conditions numerically for arbitrary state sets. We show how to evaluate MPE measurements for CGU states in some examples relevant to quantum-limited classical optical communication.
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.
We develop a sufficient condition for the least-squares measurement (LSM), or the square-root measurement, to minimize the probability of a detection error when distinguishing between a collection of mixed quantum states. Using this condition we derive the optimal measurement for state sets with a broad class of symmetries. We first consider geometrically uniform (GU) state sets with a possibly non-Abelian generating group, and show that if the generator satisfies a weighted norm constraint, then the LSM is optimal. In particular, for pure-state GU ensembles, the LSM is shown to be optimal. For arbitrary GU state sets we show that the optimal measurement operators are GU with generator that can be computed very efficiently in polynomial time, within any desired accuracy. We then consider compound GU (CGU) state sets which consist of subsets that are GU. When the generators satisfy a certain constraint, the LSM is again optimal. For arbitrary CGU state sets, the optimal measurement operators are shown to be CGU with generators that can be computed efficiently in polynomial time.
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.
Distinguishing assigned quantum states with assigned probabilities via quantum measurements is a crucial problem for the transmission of classical information through quantum channels. Measurement operators maximizing the probability of correct discrimination have been characterized by Helstrom, Holevo, and Yuen since the 1970s. On the other hand, closed-form solutions are available only for particular situations enjoying high degrees of symmetry. As a suboptimal solution to the problem, measurement operators, directly determined from states and probabilities and known as square-root measurements (SRMs), were introduced by Hausladen and Wootters. These operators were also recognized to be optimal for pure states equipped with geometrical uniform symmetry (GUS). In this paper we discuss the optimality of the SRM and find necessary and sufficient conditions in order that SRM maximize the correct decision probabilities for the set of states formed by several constellations of GUS states. The results are applied to some specific examples concerning double constellations of quantum phase-shift keying and pulse-position modulation states, with possible applications to practical systems of quantum communications.
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).