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

Zhongguo kexue. Wulixue Lixue Tianwenxue

Universal programmable maximum confidence quantum measurement of two unknown states

Shouya Wang, Xiaodong Zheng, Wenhai Zhang

Published Oct 30, 2024• 0 citations
Publisher

Abstract

In this study, the universal programmable maximum confidence quantum measurement of two unknown states is investigated. The set of measurement operators includes the correct operators and an inconclusive operator. We first determine the two correct operators of the optimal positive-operator valued measure, from which the individual correct probabilities can be obtained. In order to evaluate the efficiency of the correct operators, the average confidence probability is defined. In terms of the positivity of an inconclusive operator, we calculate the value of the average confidence probability and present the explicit expression of the maximum of the average confidence probability. Finally, the application of the research results to quantum key distribution is discussed.

DOI
10.1360/sspma-2024-0381

Related papers

Universal programmable unambiguous discrimination of two unknown states with two copies

Shouya Wang, Wen‐Hai Zhang

We investigate the universal programmable unambiguous discrimination of two unknown quantum states with two copies. We first present the optimal positive-operator valued measure (POVM) elements that determine the individual success probabilities. In terms of the positivity of an inconclusive operator, we derive the average success probability, which is higher than the average success probability of discriminating two unknown states with one copy given in the reference [Bergou and Hillery, Phys. Rev. Lett. 94, 160501 (2005)].

AIP Advances•Oct 1, 2024•0 citations

Discrimination of two mixed quantum states with maximum confidence and minimum probability of inconclusive results

Ulrike Herzog

We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the detection operators associated with the two different conclusive outcomes does not exceed unity, we obtain a general solution. As an application, we consider the discrimination of two mixed qubit states. Moreover, for the case of higher-rank detection operators we give a solution for particular states. The relation of the optimized measurement to other discrimination schemes is also discussed.

arXiv:0812.3174•Physical Review A•Mar 19, 2009•25 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•49 citations

Maximum Confidence Quantum Measurements

Sarah Croke, Erika Andersson, Stephen Mark Barnett +2 more

We consider the problem of discriminating between states of a specified set with maximum confidence. For a set of linearly independent states unambiguous discrimination is possible if we allow for the possibility of an inconclusive result. For linearly dependent sets an analogous measurement is one which allows us to be as confident as possible that when a given state is identified on the basis of the measurement result, it is indeed the correct state.

arXiv:quant-ph/0604026•Physical Review Letters•Feb 22, 2006•151 citations

Designing an optimal, universal, programmable, and unambiguous discriminator for N unknown qubits

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

The universal programmable discriminator is a device for discrimination between unknown quantum states. It has two kinds of registers: the program register and the data register. The states that are stored in registers are all unknown. It is assured that the data state is identical with one of the program states with the certain probability. The aim is to optimally identify the state stored in the data register with one of the program states that it is done by discriminating between unknown states of the combined system contains program and data registers. We design an optimal universal unambiguous programmable discriminator that has $N$ qubit systems in the program register, to unambiguously identify the qubit state of data with one of $N$ program qubit states. All unknown qubit states are pure and ${N}_{D}$ copies of the data state are available. We determine the optimal positive-operator valued measure (POVM) elements in two different ways. First, we find optimal POVMs that maximize the average of the overall success probability of discrimination between $N$ unknown pure states of the combined system. In another way, the problem of discrimination between $N$ unknown pure states of the combined system is reduced to discrimination between $N$ known average mixed states. It is shown that theses two different ways lead to the same results. We show that at least $N\ensuremath{-}1$ copies of the data state are necessary for discriminating between $N$ unknown states of the combined system.

Physical Review A•Nov 9, 2017•9 citations

Optimized maximum-confidence discrimination of N mixed quantum states and application to symmetric states

Ulrike Herzog

We study an optimized measurement which discriminates $N$ mixed quantum states occurring with given prior probabilities. The measurement yields the maximum achievable confidence for each of the $N$ conclusive outcomes, thereby keeping the overall probability of inconclusive outcomes as small as possible. It corresponds to optimum unambiguous discrimination when for each outcome the confidence is equal to unity. Necessary and sufficient optimality conditions are derived and general properties of the optimum measurement are obtained. The results are applied to the optimized maximum-confidence discrimination of $N$ equiprobable symmetric mixed states. Analytical solutions are presented for a number of examples, including the discrimination of $N$ symmetric pure states spanning a $d$-dimensional Hilbert space ($d\ensuremath{\leqslant}N$) and the discrimination of $N$ symmetric mixed qubit states.

arXiv:1202.5435•Physical Review A•Mar 12, 2012•16 citations
In this study, the universal programmable maximum confidence quantum measurement of two unknown states is investigated. The set of measurement operators includes the correct operators and an inconclusive operator. We first determine the two correct operators of the optimal positive-operator valued measure, from which the individual correct probabilities can be obtained. In order to evaluate the efficiency of the correct operators, the average confidence probability is defined. In terms of the positivity of an inconclusive operator, we calculate the value of the average confidence probability and present the explicit expression of the maximum of the average confidence probability. Finally, the application of the research results to quantum key distribution is discussed.
We investigate the universal programmable unambiguous discrimination of two unknown quantum states with two copies. We first present the optimal positive-operator valued measure (POVM) elements that determine the individual success probabilities. In terms of the positivity of an inconclusive operator, we derive the average success probability, which is higher than the average success probability of discriminating two unknown states with one copy given in the reference [Bergou and Hillery, Phys. Rev. Lett. 94, 160501 (2005)].
We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the detection operators associated with the two different conclusive outcomes does not exceed unity, we obtain a general solution. As an application, we consider the discrimination of two mixed qubit states. Moreover, for the case of higher-rank detection operators we give a solution for particular states. The relation of the optimized measurement to other discrimination schemes is also discussed.
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 universal programmable discriminator is a device for discrimination between unknown quantum states. It has two kinds of registers: the program register and the data register. The states that are stored in registers are all unknown. It is assured that the data state is identical with one of the program states with the certain probability. The aim is to optimally identify the state stored in the data register with one of the program states that it is done by discriminating between unknown states of the combined system contains program and data registers. We design an optimal universal unambiguous programmable discriminator that has NNN qubit systems in the program register, to unambiguously identify the qubit state of data with one of NNN program qubit states. All unknown qubit states are pure and ND{N}_{D}ND​ copies of the data state are available. We determine the optimal positive-operator valued measure (POVM) elements in two different ways. First, we find optimal POVMs that maximize the average of the overall success probability of discrimination between NNN unknown pure states of the combined system. In another way, the problem of discrimination between NNN unknown pure states of the combined system is reduced to discrimination between NNN known average mixed states. It is shown that theses two different ways lead to the same results. We show that at least $N\ensuremath{-}1$ copies of the data state are necessary for discriminating between NNN unknown states of the combined system.
We study an optimized measurement which discriminates NNN mixed quantum states occurring with given prior probabilities. The measurement yields the maximum achievable confidence for each of the NNN conclusive outcomes, thereby keeping the overall probability of inconclusive outcomes as small as possible. It corresponds to optimum unambiguous discrimination when for each outcome the confidence is equal to unity. Necessary and sufficient optimality conditions are derived and general properties of the optimum measurement are obtained. The results are applied to the optimized maximum-confidence discrimination of NNN equiprobable symmetric mixed states. Analytical solutions are presented for a number of examples, including the discrimination of NNN symmetric pure states spanning a ddd-dimensional Hilbert space ($d\ensuremath{\leqslant}N$) and the discrimination of NNN symmetric mixed qubit states.