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:1402.4553

Minimum Error Discrimination of Linearly Independent Pure States: Analytic Properties of POVM

Tanmay Singal, Sibasish Ghosh A

Published Feb 19, 2014• 1 citation
arXivHTMLPDF

Abstract

The optimization conditions for minimum error discrimination of linearly independent pure states comprise of two kinds: stationary conditions over the space of rank one projective measurements and the global maximization conditions. A discrete number of projective measurments will solve th former of which a unique one will solve the latter. In the case of three real linearly independent pure states we show that the stationary conditions translate to a system of simultaneous polynomial (non linear) equations in three variabes thus explaining why it's so difficult to obtain a closed-form solution for the optimal POVM. Additionally, our method suggests that as an ensemble of LI pure states is varied as a smooth function of some independent parameters, the optimal POVM will also vary smoothly as a function of the same parameters. By employing the implicit functions theorem we exploit this fact to obtain a technique to find the solution of MED of LI pure states by dragging the solution from a known example (say, pure orthogonal states) to any general linearly indepenent ensemble of pure states in the same Hilbert space. By employing RK4 to solve the first order coupled non-linear differential equations find that the resulting error is within the RK4 error performance.

DOI
10.48550/arxiv.1402.4553

Related papers

Algebraic Structure of the Minimum Error Discrimination Problem for Linearly Independent Density Matrices

Tanmay Singal, Sibasish Ghosh A

The minimum error discrimination problem for ensembles of linearly independent pure states are known to have an interesting structure; for such a given ensemble the optimal POVM is given by the pretty good measurment of another ensemble which can be related to the former ensemble by a bijective mapping $\mathscr{R}$ on the "space of ensembles". In this paper we generalize this result to ensembles of general linearly independent states (not necessarily pure) and also give an analytic expression for the inverse of the map, i.e., for $\mathscr{R}^{-1}$. In the process of proving this we also simplify the necessary and sufficient conditions that a POVM needs to satisfy to maximize the probability of success for the MED of an LI ensemble of states. This simplification is then employed to arrive at a rotationally invariant necessary and sufficient conditions of optimality. Using these rotationally invariant conditions it is established that every state of a LI mixed state ensemble can be resolved to a pure state decomposition so that the corresponding pure state ensemble (corresponding to pure states of all mixed states together) has as its optimal POVM a pure state decomposition of the optimal POVM of mixed state ensemble. This gives the necessary and sufficient conditions for the PGM of a LI ensemble to be its optimal POVM; another generalization for the pure state case. Also, these rotationally invariant conditions suggest a technique to give the optimal POVM for an ensemble of LI states. This technique is polynomial in time and outpeforms standard barrier-type interior point SDP in terms of computational complexity.

arXiv:1412.7174•Dec 22, 2014•0 citations

Minimum error discrimination for an ensemble of linearly independent pure states

Tanmay Singal, Sibasish Ghosh A

Abstract Inspired by the work done by Belavkin (1975 Stochastics 1 315 ) and independently by Mochon, (2006 Phys. Rev. A 73 032328 ), we formulate the problem of minimum error discrimination (MED) of any ensemble of n linearly independent pure states by stripping the problem of its rotational covariance and retaining only the rotationally invariant aspect of the problem. This is done by embedding the optimal conditions in a matrix equality as well as matrix inequality. Employing the implicit function theorem in these conditions we get a set of first-order coupled ordinary nonlinear differential equations which can be used to drag the solution from an initial point (where solution is known) to another point (whose solution is sought). This way of obtaining the solution can be done through a simple Taylor series expansion and analytic continuation when required. Thus, we complete the work done by Belavkin and Mochon by ultimately leading their theory to a solution for the MED problem of linearly independent pure state ensembles. We also compare the computational complexity of our technique with the barrier-type interior point method of SDP and show that our technique is computationally as efficient as (actually, a bit more than) the SDP algorithm, with the added advantage of being much simpler to implement.

arXiv:1407.5389•Journal of Physics A Mathematical and Theoretical•Mar 10, 2016•4 citations

Structure of minimum error discrimination for linearly independent states

Tanmay Singal, Eunsang Kim, Sibasish Ghosh A

In this paper we study the minimum error discrimination problem (MED) for ensembles of linearly independent (LI) states. We define a bijective map from the set of those ensembles to itself and we show that the pretty good measurement (PGM) and the optimal measurement for the MED are related by the map. In particular, the fixed points of the map are those ensembles for which the PGM is the optimal measurement. Also, we simplify the optimality conditions for the measurement of an ensemble of LI states.

arXiv:1901.04147•Physical Review A•May 23, 2019•8 citations

A Minimum Error Discrimination problem for Linearly independent Pure States Related Quantum Safe Cryptography

Park Tae Ryong

In this paper we study the Minimum Error Discrimination problem (MED) for ensembles of linearly independent (LI) pure states. By constructing a map from the set on those ensembles we show that the Pretty Good Measurement (PGM) and the optimal measurement for the MED are related by the map.

Journal of the Chosun Natural Science•Mar 1, 2020•0 citations

Optimal discrimination of quantum states

Graeme Weir

Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.

•Jan 1, 2018•4 citations

Optimum unambiguous discrimination of linearly independent pure states

Shengshi Pang, Shengjun Wu

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.

arXiv:0906.2990•Physical Review A•Nov 12, 2009•60 citations
The optimization conditions for minimum error discrimination of linearly independent pure states comprise of two kinds: stationary conditions over the space of rank one projective measurements and the global maximization conditions. A discrete number of projective measurments will solve th former of which a unique one will solve the latter. In the case of three real linearly independent pure states we show that the stationary conditions translate to a system of simultaneous polynomial (non linear) equations in three variabes thus explaining why it's so difficult to obtain a closed-form solution for the optimal POVM. Additionally, our method suggests that as an ensemble of LI pure states is varied as a smooth function of some independent parameters, the optimal POVM will also vary smoothly as a function of the same parameters. By employing the implicit functions theorem we exploit this fact to obtain a technique to find the solution of MED of LI pure states by dragging the solution from a known example (say, pure orthogonal states) to any general linearly indepenent ensemble of pure states in the same Hilbert space. By employing RK4 to solve the first order coupled non-linear differential equations find that the resulting error is within the RK4 error performance.
The minimum error discrimination problem for ensembles of linearly independent pure states are known to have an interesting structure; for such a given ensemble the optimal POVM is given by the pretty good measurment of another ensemble which can be related to the former ensemble by a bijective mapping R\mathscr{R}R on the "space of ensembles". In this paper we generalize this result to ensembles of general linearly independent states (not necessarily pure) and also give an analytic expression for the inverse of the map, i.e., for R−1\mathscr{R}^{-1}R−1. In the process of proving this we also simplify the necessary and sufficient conditions that a POVM needs to satisfy to maximize the probability of success for the MED of an LI ensemble of states. This simplification is then employed to arrive at a rotationally invariant necessary and sufficient conditions of optimality. Using these rotationally invariant conditions it is established that every state of a LI mixed state ensemble can be resolved to a pure state decomposition so that the corresponding pure state ensemble (corresponding to pure states of all mixed states together) has as its optimal POVM a pure state decomposition of the optimal POVM of mixed state ensemble. This gives the necessary and sufficient conditions for the PGM of a LI ensemble to be its optimal POVM; another generalization for the pure state case. Also, these rotationally invariant conditions suggest a technique to give the optimal POVM for an ensemble of LI states. This technique is polynomial in time and outpeforms standard barrier-type interior point SDP in terms of computational complexity.
Abstract Inspired by the work done by Belavkin (1975 Stochastics 1 315 ) and independently by Mochon, (2006 Phys. Rev. A 73 032328 ), we formulate the problem of minimum error discrimination (MED) of any ensemble of n linearly independent pure states by stripping the problem of its rotational covariance and retaining only the rotationally invariant aspect of the problem. This is done by embedding the optimal conditions in a matrix equality as well as matrix inequality. Employing the implicit function theorem in these conditions we get a set of first-order coupled ordinary nonlinear differential equations which can be used to drag the solution from an initial point (where solution is known) to another point (whose solution is sought). This way of obtaining the solution can be done through a simple Taylor series expansion and analytic continuation when required. Thus, we complete the work done by Belavkin and Mochon by ultimately leading their theory to a solution for the MED problem of linearly independent pure state ensembles. We also compare the computational complexity of our technique with the barrier-type interior point method of SDP and show that our technique is computationally as efficient as (actually, a bit more than) the SDP algorithm, with the added advantage of being much simpler to implement.
In this paper we study the minimum error discrimination problem (MED) for ensembles of linearly independent (LI) states. We define a bijective map from the set of those ensembles to itself and we show that the pretty good measurement (PGM) and the optimal measurement for the MED are related by the map. In particular, the fixed points of the map are those ensembles for which the PGM is the optimal measurement. Also, we simplify the optimality conditions for the measurement of an ensemble of LI states.
Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.
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.