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

Physics Letters A

An upper bound on the success probability of minimum-error discrimination

Xin Lü

Published Sep 26, 2022• 5 citations
Publisher
DOI
10.1016/j.physleta.2022.128461

Related papers

Upper bound on the success probability for unambiguous discrimination

Daowen Qiu

Physics Letters A•Oct 1, 2002•26 citations

General lower and upper bounds under minimum-error quantum state discrimination

Elena R. Loubenets

For the optimal success probability under minimum-error discrimination between $r\ensuremath{\ge}2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these new general bounds and the known general bounds, lower and upper. We also present the example where the values of the new general lower and upper bounds on the optimal success probability are tighter than the values of most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to $r>2$ the form of the Helstrom bound. For $r=2$, each of our new bounds, lower and upper, reduces to the Helstrom bound.

arXiv:2105.06076•Physical Review A•Mar 4, 2022•14 citations

Bound on local minimum-error discrimination of bipartite quantum states

Donghoon Ha, Jeong San Kim

We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using an example.

arXiv:2112.14424•Physical Review A•Mar 10, 2022•8 citations

The minimal error discrimination based on the square root measurement

Wang Wenhua, Cao Huai-xin

陕西师范大学学报:自然科学版•Jan 1, 2016•0 citations

A simple approximation of minimum error probability using trace distance

Shungo Asano, Tsuyoshi Sasaki Usuda

International Symposium on Information Theory and its Applications•Dec 11, 2014•0 citations

Minimum-error discrimination between mixed quantum states

Daowen Qiu

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.

arXiv:0707.3970•Physical Review A•Jan 23, 2008•68 citations
For the optimal success probability under minimum-error discrimination between $r\ensuremath{\ge}2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these new general bounds and the known general bounds, lower and upper. We also present the example where the values of the new general lower and upper bounds on the optimal success probability are tighter than the values of most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to r>2r>2r>2 the form of the Helstrom bound. For r=2r=2r=2, each of our new bounds, lower and upper, reduces to the Helstrom bound.
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary mmm mixed quantum states with given prior probabilities. When m=2m=2m=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 mmm mixed quantum states with the optimal failure probability for unambiguously discriminating the same states.