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/0504138 · Physical Review A

Optimal unambiguous filtering of a quantum state: An instance in mixed state discrimination

János A. Bergou, Ulrike Herzog, Mark S. Hillery

Published Apr 11, 2005• 29 citations
arXivHTMLPDF

Abstract

Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e., allow for inconclusive outcomes to occur, then unambiguous discrimination becomes possible with a certain probability of success. A variant of the problem is set discrimination: the states are grouped in sets and we want to determine to which particular set a given pure input state belongs. We consider here the simplest case, termed quantum state filtering, when the $N$ given nonorthogonal states ${\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ are divided into two sets and the first set consists of one state only while the second consists of all of the remaining states. We present the derivation of the optimal measurement strategy, in terms of a generalized measurement (positive-operator-valued measure), to distinguish $\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩$ from the set ${\ensuremath{\mid}{\ensuremath{\psi}}_{2}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ and the corresponding optimal success and failure probabilities. The results, but not the complete derivation, were presented previously [Phys. Rev. Lett. 90, 25901 (2003)] as the emphasis there was on appplication of the results to probabilistic quantum algorithms. We also show that the problem is equivalent to the discrimination of a pure state and an arbitrary mixed state.

DOI
10.1103/physreva.71.042314

Related papers

Quantum-state filtering applied to the discrimination of Boolean functions

János A. Bergou, Mark S. Hillery

Quantum-state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs. The simplest case, when the $N$ given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum-state filtering. We derived previously the optimal strategy for the case of $N$ nonorthogonal states, ${\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$, for distinguishing $\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩$ from the set ${\ensuremath{\mid}{\ensuremath{\psi}}_{2}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ and the corresponding optimal success and failure probabilities. In a previous paper [Phys. Rev. Lett. 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions.

arXiv:quant-ph/0507092•Physical Review A•Jul 5, 2005•9 citations

Distinguishing mixed quantum states: Minimum-error discrimination versus optimum unambiguous discrimination

Ulrike Herzog, János A. Bergou

We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability.

arXiv:quant-ph/0403124•Physical Review A•Aug 5, 2004•64 citations

Optimum measurement for unambiguously discriminating two mixed states: General considerations and special cases

Herzog, U, Bergou, J A

Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.

•Oct 21, 2005•2 citations

Discrimination of mixed quantum states: Reversible maps and unambiguous strategies

Matthias Kleinmann

The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer. Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy. If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states. A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks. As an important application of unambiguous state discrimination, unambiguous state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed. If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.

•Jan 1, 2008•0 citations

Optimum measurement for unambiguously discriminating two mixed states: General considerations and special cases

Ulrike Herzog, János A Bergou

Based on our previous publication [U. Herzog and J. A. Bergou, Phys. Rev. A 71 , 050301(R)(2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.

arXiv:quant-ph/0510170•Journal of Physics Conference Series•Apr 1, 2006•2 citations

From unambiguous quantum state discrimination to quantum state filtering

János A. Bergou, Ulrike Herzog, Mark S. Hillery

Abstract Unambiguous discrimination among nonorthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a new variant of that problem. Instead of discriminating among all of the N different states, we now ask for less. We want to unambiguously assign the state to one of two complementary subsets of the set of N given non‐orthogonal quantum states, each occurring with given a priori probabilities. We refer to the special case when one subset contains only one state and the other contains the remaining N‐1 states as unambiguous quantum state filtering. We present an optimal analytical solution for the special case of N=3, and discuss the optimal strategy to unambiguously distinguish |ψ1〉 from the set {|ψ2〉,|ψ3〉}. For unambiguous filtering the subsets need not be linearly independent. We briefly discuss how to construct generalized interferometers (multiports) which provide a fully linear optical implementation of the optimal strategy.

Fortschritte der Physik•Feb 26, 2003•0 citations
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e., allow for inconclusive outcomes to occur, then unambiguous discrimination becomes possible with a certain probability of success. A variant of the problem is set discrimination: the states are grouped in sets and we want to determine to which particular set a given pure input state belongs. We consider here the simplest case, termed quantum state filtering, when the NNN given nonorthogonal states \ensuremath∣\ensuremathψ1⟩,…,\ensuremath∣\ensuremathψN⟩{\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}\ensuremath∣\ensuremathψ1​⟩,…,\ensuremath∣\ensuremathψN​⟩ are divided into two sets and the first set consists of one state only while the second consists of all of the remaining states. We present the derivation of the optimal measurement strategy, in terms of a generalized measurement (positive-operator-valued measure), to distinguish \ensuremath∣\ensuremathψ1⟩\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩\ensuremath∣\ensuremathψ1​⟩ from the set \ensuremath∣\ensuremathψ2⟩,…,\ensuremath∣\ensuremathψN⟩{\ensuremath{\mid}{\ensuremath{\psi}}_{2}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}\ensuremath∣\ensuremathψ2​⟩,…,\ensuremath∣\ensuremathψN​⟩ and the corresponding optimal success and failure probabilities. The results, but not the complete derivation, were presented previously [Phys. Rev. Lett. 90, 25901 (2003)] as the emphasis there was on appplication of the results to probabilistic quantum algorithms. We also show that the problem is equivalent to the discrimination of a pure state and an arbitrary mixed state.
Quantum-state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs. The simplest case, when the NNN given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum-state filtering. We derived previously the optimal strategy for the case of NNN nonorthogonal states, ${\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$, for distinguishing $\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩$ from the set ${\ensuremath{\mid}{\ensuremath{\psi}}_{2}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ and the corresponding optimal success and failure probabilities. In a previous paper [Phys. Rev. Lett. 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions.
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability.
Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.
The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer. Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy. If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states. A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks. As an important application of unambiguous state discrimination, unambiguous state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed. If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.
Based on our previous publication [U. Herzog and J. A. Bergou, Phys. Rev. A 71 , 050301(R)(2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. Unambiguous discrimination of nonorthogonal states is possible in a probabilistic way, at the expense of a nonzero probability of inconclusive results, where the measurement fails. Along with a discussion of the general problem, we give an example illustrating our method of solution. We also provide general inequalities for the minimum achievable failure probability and discuss in more detail the necessary conditions that must be fulfilled when its absolute lower bound, proportional to the fidelity of the states, can be reached.
Abstract Unambiguous discrimination among nonorthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a new variant of that problem. Instead of discriminating among all of the N different states, we now ask for less. We want to unambiguously assign the state to one of two complementary subsets of the set of N given non‐orthogonal quantum states, each occurring with given a priori probabilities. We refer to the special case when one subset contains only one state and the other contains the remaining N‐1 states as unambiguous quantum state filtering. We present an optimal analytical solution for the special case of N=3, and discuss the optimal strategy to unambiguously distinguish |ψ1〉 from the set {|ψ2〉,|ψ3〉}. For unambiguous filtering the subsets need not be linearly independent. We briefly discuss how to construct generalized interferometers (multiports) which provide a fully linear optical implementation of the optimal strategy.