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

Discrimination with an error margin among three symmetric states of a qubit

H. Sugimoto, Y. Taninaka, A. Hayashi

Published Oct 10, 2012• 11 citations
arXivHTMLPDF

Abstract

We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three symmetric pure states of a qubit. The measurements are classified into three types, and one of the three types is optimal depending on the value of the error margin. The problem is formulated as one of semidefinite programming. Starting with the dual problem derived from the primal one, we analytically obtain the optimal success probability and the optimal measurement that attains it in each domain of the error margin. Moreover, we analyze the case of three symmetric mixed states of a qubit.

DOI
10.1103/physreva.86.042311

Related papers

Optimal state discrimination with an error margin of pure and mixed symmetric states: irreducible qudit and reducible qubit states

M. A. Jafarizadeh, Payman Mahmoudi, Derakhshan Akhgar +1 more

Abstract Minimum error discrimination (MED) and Unambiguous discrimination (UD) are two common strategies for quantum state discrimination that can be modified by imposing a finite error margin on the error probability. Error margins 0 and 1 correspond to two common strategies. In this paper, for an arbitrary error margin m , the discrimination problem of equiprobable quantum symmetric states is analytically solved for four distinct cases. A generating set of irreducible and reducible representations of a subgroup of a unitary group are considered, separately, as unitary operators that produce one set of the symmetric states. In the irreducible case, for N ⩾ d mixed and pure qudit states, one critical m which divides the parameter space into two domains is obtained. The number of critical values m in the reducible case is two, for both N mixed and pure qubit states. The reason for this difference between numbers of critical values m is explained. The optimal set of measurements and corresponding maximum success probability in fully analytical form are determined for all values of the error margin. The relationship between the amount of error that is imposed on error probability and geometrical situation of states with changes in rank of element corresponding to inconclusive result is determined. The behaviors of elements of measurement are explained geometrically in order to decrease the error probability in each domain. Furthermore, the problem of the discrimination with error margin among elements of two different sets of symmetric quantum states is studied. The number of critical values m is equivalent to one set in both reducible and irreducible cases. In addition, optimal measurements in each domain are obtained.

Journal of Physics A Mathematical and Theoretical•Mar 28, 2017•1 citation

State discrimination with error margin and its locality

A. Hayashi, T. Hashimoto, M. Horibe

There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous discrimination where errors are not allowed but the inconclusive result ``I do not know'' is possible. We investigate a discrimination problem with a finite margin imposed on the error probability. The two common settings correspond to the error margins 1 and 0. For arbitrary error margin, we determine the optimal discrimination probability for two pure states with equal occurrence probabilities. We also consider the case where the states to be discriminated are multipartite and show that the optimal discrimination probability can be achieved by local operations and classical communication.

arXiv:0804.4349•Physical Review A•Jul 18, 2008•54 citations

Discrimination with error margin between two states: Case of general occurrence probabilities

H. Sugimoto, T. Hashimoto, M. Horibe +1 more

We investigate a state discrimination problem which interpolates minimum error and unambiguous discrimination by introducing a margin for the probability of error. We closely analyze discrimination of two pure states with general occurrence probabilities. The optimal measurements are classified into three types. One of the three types of measurement is optimal depending on parameters (occurrence probabilities and error margin). We determine the three domains in the parameter space and the optimal discrimination success probability in each domain in a fully analytic form. It is also shown that when the states to be discriminated are multipartite, the optimal success probability can be attained by local operations and classical communication. For discrimination of two mixed states, an upper bound of the optimal success probability is obtained.

arXiv:0906.4884•Physical Review A•Nov 17, 2009•44 citations

Optimal state discrimination with a fixed rate of inconclusive results: Analytical solutions and relation to state discrimination with a fixed error rate

Ulrike Herzog

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.

arXiv:1206.4412•Physical Review A•Sep 14, 2012•45 citations

Programmable discrimination with an error margin

Gael Sentís, E. Bagán, John Calsamiglia +1 more

The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed with a number of identically prepared qubits---the data and the programs. The device aims at correctly identifying the data state with one of the two program states. This scheme has the unambiguous and the minimum-error schemes as extremal cases, when the error margin is set to zero or it is sufficiently large, respectively. Analytical results are given in the two situations where the margin is imposed on the average error probability---weak condition---or it is imposed separately on the two probabilities of assigning the state of the data to the wrong program---strong condition. It is a general feature of our scheme that the success probability rises sharply as soon as a small error margin is allowed, thus providing a significant gain over the unambiguous scheme while still having high confidence results.

arXiv:1308.1378•Physical Review A•Nov 7, 2013•14 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

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.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•81 citations
We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three symmetric pure states of a qubit. The measurements are classified into three types, and one of the three types is optimal depending on the value of the error margin. The problem is formulated as one of semidefinite programming. Starting with the dual problem derived from the primal one, we analytically obtain the optimal success probability and the optimal measurement that attains it in each domain of the error margin. Moreover, we analyze the case of three symmetric mixed states of a qubit.
Abstract Minimum error discrimination (MED) and Unambiguous discrimination (UD) are two common strategies for quantum state discrimination that can be modified by imposing a finite error margin on the error probability. Error margins 0 and 1 correspond to two common strategies. In this paper, for an arbitrary error margin m , the discrimination problem of equiprobable quantum symmetric states is analytically solved for four distinct cases. A generating set of irreducible and reducible representations of a subgroup of a unitary group are considered, separately, as unitary operators that produce one set of the symmetric states. In the irreducible case, for N ⩾ d mixed and pure qudit states, one critical m which divides the parameter space into two domains is obtained. The number of critical values m in the reducible case is two, for both N mixed and pure qubit states. The reason for this difference between numbers of critical values m is explained. The optimal set of measurements and corresponding maximum success probability in fully analytical form are determined for all values of the error margin. The relationship between the amount of error that is imposed on error probability and geometrical situation of states with changes in rank of element corresponding to inconclusive result is determined. The behaviors of elements of measurement are explained geometrically in order to decrease the error probability in each domain. Furthermore, the problem of the discrimination with error margin among elements of two different sets of symmetric quantum states is studied. The number of critical values m is equivalent to one set in both reducible and irreducible cases. In addition, optimal measurements in each domain are obtained.
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous discrimination where errors are not allowed but the inconclusive result ``I do not know'' is possible. We investigate a discrimination problem with a finite margin imposed on the error probability. The two common settings correspond to the error margins 1 and 0. For arbitrary error margin, we determine the optimal discrimination probability for two pure states with equal occurrence probabilities. We also consider the case where the states to be discriminated are multipartite and show that the optimal discrimination probability can be achieved by local operations and classical communication.
We investigate a state discrimination problem which interpolates minimum error and unambiguous discrimination by introducing a margin for the probability of error. We closely analyze discrimination of two pure states with general occurrence probabilities. The optimal measurements are classified into three types. One of the three types of measurement is optimal depending on parameters (occurrence probabilities and error margin). We determine the three domains in the parameter space and the optimal discrimination success probability in each domain in a fully analytic form. It is also shown that when the states to be discriminated are multipartite, the optimal success probability can be attained by local operations and classical communication. For discrimination of two mixed states, an upper bound of the optimal success probability is obtained.
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 NNN 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.
The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed with a number of identically prepared qubits---the data and the programs. The device aims at correctly identifying the data state with one of the two program states. This scheme has the unambiguous and the minimum-error schemes as extremal cases, when the error margin is set to zero or it is sufficiently large, respectively. Analytical results are given in the two situations where the margin is imposed on the average error probability---weak condition---or it is imposed separately on the two probabilities of assigning the state of the data to the wrong program---strong condition. It is a general feature of our scheme that the success probability rises sharply as soon as a small error margin is allowed, thus providing a significant gain over the unambiguous scheme while still having high confidence results.
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.