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:1512.01893

Mixed Form of Ambiguous and Unambiguous Discriminations

Sunho Kim, Junde Wu, Minhyung Cho

Published Dec 7, 2015• 0 citations
arXivHTMLPDF

Abstract

In this paper, we introduce a mixed form of ambiguous and unambiguous quantum state discriminations, and show that the mixed form has higher success probability than the unambiguous quantum state discriminations.
DOI
10.48550/arxiv.1512.01893

Related papers

Unambiguous discrimination of mixed states: A description based on system-ancilla coupling

Xiang-Fa Zhou, Yong-Sheng Zhang, Guan-Can Guo

We propose a general description on the unambiguous discrimination of mixed states according to the system-environment coupling. In the two states case, we present a series of new bounds of the total success probability.

International Conference on Quantum Information•Jan 1, 2007•1 citation

Unambiguous discrimination of mixed states

Terry Rudolph, Robert W. Spekkens, Peter S. Turner

We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special cases exactly, and demonstrate how the problems of state filtering and state comparison can be recast as problems of mixed state unambiguous discrimination.

arXiv:quant-ph/0303071•Physical Review A•Jul 17, 2003•148 citations

Unambiguous discrimination of mixed quantum states: Optimal solution and case study

Matthias Kleinmann, Hermann Kampermann, Dagmar Bruß

We present a generic study of the unambiguous discrimination between two mixed quantum states. We derive operational optimality conditions and show that the optimal measurements can be classified according to their rank. In Hilbert space dimensions less than or equal to $5$, this leads to the complete optimal solution. We demonstrate our method with a physical example, namely, the unambiguous comparison of $n$ quantum states, and find the optimal success probability.

arXiv:0807.3923•Physical Review A•Feb 24, 2010•26 citations

Petal-shape probability areas: complete quantum state discrimination

Luis Roa, Carla Hermann-Avigliano, Roberto Salazar +3 more

We find the allowed complex numbers associated with the inner product of N equally separated pure quantum states. The allowed areas on the unitary complex plane have the form of petals. A point inside the petal-shape represents a set of N linearly independent (LI) pure states, and a point on the edge of that area represents a set of N linearly dependent (LD) pure states. For each one of those LI sets we study the complete discrimination of its N equi-separated states combining sequentially the two known strategies: first the unambiguous identification protocol for LI states, followed, if necessary, by the error-minimizing measurement scheme for LD states. We find that the probabilities of success for both unambiguous and ambiguous discrimination procedures depend on both the module and the phase of the involved inner product complex number. We show that, with respect to the phase-parameter, the maximal probability of discriminating unambiguously the N non-orthogonal pure states holds just when there no longer be probability of obtaining ambiguously information about the prepared state by applying the second protocol if the first one was not successful.

arXiv:0808.0725•Aug 5, 2008•2 citations

Minimum-error discrimination of quantum states: New bounds and comparison

Daowen Qiu, Lvjun Li

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 $Q_{U}$ and the minimum-error probability of ambiguous discrimination $Q_{E}$ between arbitrary given $m$ mixed quantum states have the relationship $Q_{U}\geq 2Q_{E}$. In this paper, we show that, however, if $m>2$, the relationship $Q_{U}\geq 2Q_{E}$ may not hold again in general, and there may be no supremum of $Q_{U}/Q_{E}$ 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.

arXiv:0812.2378•Dec 12, 2008•4 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
We present a generic study of the unambiguous discrimination between two mixed quantum states. We derive operational optimality conditions and show that the optimal measurements can be classified according to their rank. In Hilbert space dimensions less than or equal to 555, this leads to the complete optimal solution. We demonstrate our method with a physical example, namely, the unambiguous comparison of nnn quantum states, and find the optimal success probability.
We find the allowed complex numbers associated with the inner product of N equally separated pure quantum states. The allowed areas on the unitary complex plane have the form of petals. A point inside the petal-shape represents a set of N linearly independent (LI) pure states, and a point on the edge of that area represents a set of N linearly dependent (LD) pure states. For each one of those LI sets we study the complete discrimination of its N equi-separated states combining sequentially the two known strategies: first the unambiguous identification protocol for LI states, followed, if necessary, by the error-minimizing measurement scheme for LD states. We find that the probabilities of success for both unambiguous and ambiguous discrimination procedures depend on both the module and the phase of the involved inner product complex number. We show that, with respect to the phase-parameter, the maximal probability of discriminating unambiguously the N non-orthogonal pure states holds just when there no longer be probability of obtaining ambiguously information about the prepared state by applying the second protocol if the first one was not successful.
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 mmm 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 mmm 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=2m=2m=2, the optimal inconclusive probability of unambiguous discrimination QUQ_{U}QU​ and the minimum-error probability of ambiguous discrimination QEQ_{E}QE​ between arbitrary given mmm mixed quantum states have the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​. In this paper, we show that, however, if m>2m>2m>2, the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​ may not hold again in general, and there may be no supremum of QU/QEQ_{U}/Q_{E}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.