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:0810.1919 · Journal of Physics A Mathematical and Theoretical

On the conditions for discrimination between quantum states with minimum error

Stephen M Barnett, Sarah Croke

Published Jan 14, 2009• 59 citations
arXivHTMLPDF

Abstract

We provide a simple proof for the necessity of conditions for discriminating with minimum error between a known set of quantum states.
DOI
10.1088/1751-8113/42/6/062001

Related papers

Minimum-error discrimination between two sets of similarity-transformed quantum states

M. A. Jafarizadeh, Y. Mazhari Khiavi, Y. Akbari-Kourbolagh

arXiv:1106.5883•Quantum Information Processing•Feb 7, 2013•10 citations

MINIMUM-ERROR DISCRIMINATION AMONG MIXED QUANTUM STATES

Chih‐Lung Chou

We review the problem of discriminating with minimum error among mixed quantum states, with emphasize on the analytically solved quantum ensembles.

•Oct 1, 2005•0 citations

Minimum-error quantum state discrimination based on semidefinite programming

Wang Wengang, Guohua Dong, Mingshan Li

In this paper we consider the general problem of designing the optimal quantum detection for minimum-error quantum state discrimination. Since it is hard to get an explicit solution and we must resort to numerical methods for the general case. We show the problem can be cast into a semidefinite programming(SDP) problem, we use the theory of SDP to solve it. Based on the idea, we propose a method for minimum-error discrimination by formulating the design of optimal quantum detection as a standard SDP problem; furthermore, based on the optimality conditions for SDP, we derive a set of optimality conditions for quantum detection. It is exemplified that this method is simple to implement and can be used to design optimum detection operators for minimum-error discrimination efficiently.

Chinese Control Conference (CCC)•Jul 1, 2008•4 citations

Optimal discrimination between overcomplete states

Roger B. M. Clarke, Viv M. Kendon, Erling Riis +2 more

Summary form only given. We show how to discriminate between overcomplete sets of quantum states with minimum error probabilities. It is not possible to distinguish reliably between non-orthogonal states, but given a specific set of N states (N>2 for a two-state system) one can ask how well can they be distinguished. The answer is different depending on whether you want the minimum error, or the maximum information.

Conference on Lasers and Electro-Optics•Aug 29, 2005•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

MINIMUM-ERROR DISCRIMINATION AMONG MIXED QUANTUM STATES

Chih‐Lung Chou

We review the problem of discriminating with minimum error among mixed quantum states, with emphasize on the analytically solved quantum ensembles.

International Journal of Quantum Information•Nov 1, 2005•0 citations
In this paper we consider the general problem of designing the optimal quantum detection for minimum-error quantum state discrimination. Since it is hard to get an explicit solution and we must resort to numerical methods for the general case. We show the problem can be cast into a semidefinite programming(SDP) problem, we use the theory of SDP to solve it. Based on the idea, we propose a method for minimum-error discrimination by formulating the design of optimal quantum detection as a standard SDP problem; furthermore, based on the optimality conditions for SDP, we derive a set of optimality conditions for quantum detection. It is exemplified that this method is simple to implement and can be used to design optimum detection operators for minimum-error discrimination efficiently.
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.