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.
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.
The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary
m quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary
m mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if
m=2, the optimal inconclusive probability of unambiguous discrimination
QU and the minimum-error probability of ambiguous discrimination
QE between arbitrary given
m mixed quantum states have the relationship
QU≥2QE. In this paper, we show that, however, if
m>2, the relationship
QU≥2QE may not hold again in general, and there may be no supremum of
QU/QE for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.
The task of quantum state discrimination provides an operational characterization of distinguishability and plays a central role in quantum information science. Since the achievable success probability in quantum state discrimination depends both on the states being discriminated and on the allowed measurements, it is natural to study discrimination under physically motivated measurement constraints. Here, we investigate minimum-error quantum state discrimination under measurements implementable by both fixed and adaptive stabilizer circuits. Given arbitrary stabilizer-state ancillas, we show that fixed stabilizer circuits provide no additional discrimination power, whereas adaptive circuits do. Then, focusing on single-qubit systems, we derive analytical expressions for the success probability across both circuit classes when supplied with arbitrary (non-stabilizer) ancillas, showing that the performance gap between fixed and adaptive circuits persists. We further consider discrimination with non-stabilizerness incorporated directly into the measurement operators. Here, the optimization is formulated as a semidefinite program, and analytical bounds interpolating between the stabilizer and Helstrom limits for qubits are derived. Finally, we illustrate applications in quantum random access codes and bounds on unitary synthesis fidelity with a finite number of magic states.
The minimum error probability for distinguishing between two quantum states is bounded by the Helstrom limit, derived under the assumption that measurement strategies are restricted to positive operator-valued measurements. We explore scenarios in which the error probability for discriminating two quantum states can be reduced below the Helstrom bound under some constrained access of resources, indicating the use of measurement operations that go beyond the standard positive operator-valued measurements framework. We refer to such measurements as non-positive operator-valued measurements. While existing literature often associates these measurements with initial entanglement between the system and an auxiliary, followed by joint projective measurement and discarding the auxiliary, we demonstrate that initial entanglement between system and auxiliary is not necessary for the emergence of such measurements in the context of state discrimination. Interestingly, even initial product states can give rise to effective non-positive measurements on the subsystem, and achieve sub-Helstrom discrimination error when discriminating quantum states of the subsystem.
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary
m mixed quantum states with given prior probabilities. When
m=2, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out an upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for ambiguously discriminating arbitrary
m mixed quantum states with the optimal failure probability for unambiguously discriminating the same states.