A qubit pure state can be specified by a point on the Bloch sphere, and similarly certain quantum measurements can be specified by M points on a sphere which we refer to as an Etro sphere. A key objective of this paper is to compare the performance for discriminating between two qubit pure states using POVM designs based on the distribution of M points on the Etro sphere. We specifically address the case where the alignment of the M points relative to the coordinates of the sphere is unknown. Of particular interest is the insensitivity of the POVM designs as measured by the difference between the maximum and minimum probabilities of error over all alignments. We consider distributions of the M points corresponding to Platonic solids as well as optimal distributions with respect to several criteria including, for example, maximum nearest neighbor distance and minimum Riesz s-energy. We provide evidence through simulation of various performance tradeoffs such as the tradeoff between stability and best case performance.
A qubit pure state can be specified by a point on the Bloch sphere, and similarly certain quantum measurements can be specified by M points on a sphere which we refer to as an Etro sphere. A key objective of this paper is to compare the performance for discriminating between two qubit pure states using POVM designs based on the distribution of M points on the Etro sphere. We specifically address the case where the alignment of the M points relative to the coordinates of the sphere is unknown. Of particular interest is the insensitivity of the POVM designs as measured by the difference between the maximum and minimum probabilities of error over all alignments. We consider distributions of the M points corresponding to Platonic solids as well as optimal distributions with respect to several criteria including, for example, maximum nearest neighbor distance and minimum Riesz s-energy. We provide evidence through simulation of various performance tradeoffs such as the tradeoff between stability and best case performance.
Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success probability, measurement, POVM elements, Helstrom family of ensembles, convex optimization, conjugate states PACS Nos: 03.67.Hk, 03.65.Ta
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.
We determine the optimal measurement that maximizes the average information gain about the state of a qubit system. The qubit is prepared in one of two known states with known prior probabilities. To treat the problem analytically we employ the formalism developed for the maximum confidence quantum state discrimination strategy and obtain the POVM which optimizes the information gain for the entire parameter space of the system. We show that the optimal measurement coincides exactly with the minimum-error quantum measurement only for two pure states, or when the two states have the same Bloch radius or they are on the same diagonal of the Bloch disk.
Abstract Given an ensemble of qubits, which we are told consists of a mixture of two pure states, one with probability η 0 and one with probability η 1 , we want to find a POVM that will discriminate between the two states by measuring the qubits. We do not know the states, and for any given qubit, we do not know which of the two states it is in. This can be viewed as learning a POVM from quantum data. Once found, the POVM can be used to separate the remaining qubits in the ensemble into two groups, corresponding to the two states present in the ensemble. In order to find the POVM, we need more information about the possible states. We examine several cases. First, we suppose that we know that the Bloch vectors of the states lie in the x – z plane and their a priori probabilities are equal. We next keep the restriction to the x – z plane, but allow the a priori probabilities to be different. Finally, we consider the case in which the Bloch vectors of the states have the same z component.
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.
We study an optimum measurement for quantum state discrimination, which maximizes the probability of correct results when the probability of inconclusive results is fixed at a given value. The measurement describes minimum-error discrimination if this value is zero, while under certain conditions it corresponds to optimized maximum-confidence discrimination, or to optimum unambiguous discrimination, respectively, when the fixed value reaches a definite minimum. Using operator conditions that determine the optimum measurement, we derive analytical solutions for the discrimination of two mixed qubit states, including the case of two pure states occurring with arbitrary prior probabilities, and for the discrimination of N symmetric states, both pure and mixed. We also consider a case where the given density operators resolve the identity operator, and we specify the optimality conditions for partially symmetric states. Moreover, we show that from the complete solution for arbitrary values of the fixed rate of inconclusive results one can always obtain the optimum measurement in another strategy where the error rate is fixed, and vice versa.