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:quant-ph/0304179 · Physical Review A

Reduction theorems for optimal unambiguous state discrimination of density matrices

Philippe Raynal, Norbert Lütkenhaus, S. J. van Enk

Published Aug 20, 2003• 78 citations
arXivHTMLPDF

Abstract

We present reduction theorems for the problem of optimal unambiguous state discrimination of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank n and are described in a Hilbert space of dimensions $2n.$ We also show how to use the reduction theorems to discriminate unambiguously between N mixed states $(N>~2).$

DOI
10.1103/physreva.68.022308

Related papers

Unambiguous State Discrimination of two density matrices in Quantum Information Theory

Philippe Raynal

In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $r$ in a 2$r$-dimensional Hilbert space. These reduction theorems also allow us to reduce USD problems to simpler ones for which the solution might be known. As an application, we consider the unambiguous comparison of $n$ linearly independent pure states with a simple symmetry. Moreover, lower bounds on the optimal failure probability have been derived. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. We also construct the corresponding optimal measurement. With this result, we provide analytical solutions for unambiguously discriminating a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. We however show that examples exist where the bounds cannot be reached. Next, we derive properties on the rank and the spectrum of an optimal USD measurement. This finally leads to a second class of exact solutions. Indeed we present the optimal failure probability as well as the optimal measurement for unambiguously discriminating any pair of geometrically uniform mixed states in four dimensions. This class of problems includes for example the discrimination of both the basis and the bit value mixed states in the BB84 QKD protocol with coherent states.

arXiv:quant-ph/0611133•Nov 12, 2006•20 citations

Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions

Philippe Raynal, Norbert Lütkenhaus

Recently the problem of unambiguous state discrimination of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [T. Rudolph, R. W. Spekkens, and P. S. Turner, Phys. Rev. A 68, 010301(R) (2003)]. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. Moreover we construct the corresponding optimal measurement strategies. With this result, we provide analytical solutions for unambiguous discrimination of a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. Additionally, we show that examples exist where the bounds cannot be reached.

arXiv:quant-ph/0502165•Physical Review A•Aug 29, 2005•44 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•23 citations

Structural approach to unambiguous discrimination of two mixed quantum states

Matthias Kleinmann, Hermann Kampermann, Dagmar Bruß

We analyze the optimal unambiguous discrimination of two arbitrary mixed quantum states. We show that the optimal measurement is unique and we present this optimal measurement for the case where the rank of the density operator of one of the states is at most 2 (“solution in four dimensions”). The solution is illustrated by some examples. The optimality conditions proven by Eldar et al. [Phys. Rev. A 69, 062318 (2004)] are simplified to an operational form. As an application we present optimality conditions for the measurement, when only one of the two states is detected. The current status of optimal unambiguous state discrimination is summarized via a general strategy.

arXiv:0803.1083•Journal of Mathematical Physics•Mar 1, 2010•15 citations

Unambiguous discrimination between two rank-2 mixed quantum states

Mihailo Stojnic, Babak Hassibi

In this paper we consider the problem of the optimal quantum unambiguous detection between two mixed quantum states. More specifically, we consider two mixed quantum states of rank 2 which lie in a Hilbert space of dimension 4. Using duality theory we explicitly characterize the optimal measurement operators. Furthermore, as a by-product of our framework we obtain a closed form solution of unambiguous discrimination between a pure and a mixed quantum state.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•1 citation

Optimal unambiguous state discrimination of two density matrices: A second class of exact solutions

Philippe Raynal, Norbert Lütkenhaus

We consider the unambiguous state discrimination (USD) of two mixed quantum states. We study the rank and the spectrum of the elements of an optimal USD measurement. This naturally leads to a partial fourth reduction theorem. This theorem shows that either the failure probability equals its overall lower bound given in terms of the fidelity or a two-dimensional subspace can be split off from the original Hilbert space. We then use this partial reduction theorem to derive the optimal solution for any two equally probable geometrically uniform states ${\ensuremath{\rho}}_{0}$ and ${\ensuremath{\rho}}_{1}=U{\ensuremath{\rho}}_{0}{U}^{\ifmmode\dagger\else\textdagger\fi{}}$, ${U}^{2}=\mathbb{1}$, in a four-dimensional Hilbert space. This represents a second class of analytical solutions for USD problems that cannot be reduced to some pure state cases. We apply our result to answer two questions that are relevant in implementations of the Bennett and Brassard 1984 quantum key distribution protocol using weak coherent states.

arXiv:quant-ph/0702022•Physical Review A•Nov 21, 2007•22 citations
We present reduction theorems for the problem of optimal unambiguous state discrimination of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank n and are described in a Hilbert space of dimensions 2n.2n.2n. We also show how to use the reduction theorems to discriminate unambiguously between N mixed states (N> 2).(N>~2).(N> 2).
In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank rrr in a 2rrr-dimensional Hilbert space. These reduction theorems also allow us to reduce USD problems to simpler ones for which the solution might be known. As an application, we consider the unambiguous comparison of nnn linearly independent pure states with a simple symmetry. Moreover, lower bounds on the optimal failure probability have been derived. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. We also construct the corresponding optimal measurement. With this result, we provide analytical solutions for unambiguously discriminating a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. We however show that examples exist where the bounds cannot be reached. Next, we derive properties on the rank and the spectrum of an optimal USD measurement. This finally leads to a second class of exact solutions. Indeed we present the optimal failure probability as well as the optimal measurement for unambiguously discriminating any pair of geometrically uniform mixed states in four dimensions. This class of problems includes for example the discrimination of both the basis and the bit value mixed states in the BB84 QKD protocol with coherent states.
Recently the problem of unambiguous state discrimination of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [T. Rudolph, R. W. Spekkens, and P. S. Turner, Phys. Rev. A 68, 010301(R) (2003)]. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. Moreover we construct the corresponding optimal measurement strategies. With this result, we provide analytical solutions for unambiguous discrimination of a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. Additionally, we show that examples exist where the bounds cannot be reached.
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 analyze the optimal unambiguous discrimination of two arbitrary mixed quantum states. We show that the optimal measurement is unique and we present this optimal measurement for the case where the rank of the density operator of one of the states is at most 2 (“solution in four dimensions”). The solution is illustrated by some examples. The optimality conditions proven by Eldar et al. [Phys. Rev. A 69, 062318 (2004)] are simplified to an operational form. As an application we present optimality conditions for the measurement, when only one of the two states is detected. The current status of optimal unambiguous state discrimination is summarized via a general strategy.
We consider the unambiguous state discrimination (USD) of two mixed quantum states. We study the rank and the spectrum of the elements of an optimal USD measurement. This naturally leads to a partial fourth reduction theorem. This theorem shows that either the failure probability equals its overall lower bound given in terms of the fidelity or a two-dimensional subspace can be split off from the original Hilbert space. We then use this partial reduction theorem to derive the optimal solution for any two equally probable geometrically uniform states ${\ensuremath{\rho}}_{0}$ and ${\ensuremath{\rho}}_{1}=U{\ensuremath{\rho}}_{0}{U}^{\ifmmode\dagger\else\textdagger\fi{}}$, U2=1{U}^{2}=\mathbb{1}U2=1, in a four-dimensional Hilbert space. This represents a second class of analytical solutions for USD problems that cannot be reduced to some pure state cases. We apply our result to answer two questions that are relevant in implementations of the Bennett and Brassard 1984 quantum key distribution protocol using weak coherent states.