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/0410228 · AIP conference proceedings

Results in Optimal Discrimination

Kieran Hunter

Published Jan 1, 2004• 17 citations
arXivHTMLPDF

Abstract

We study the problem of discriminating between non‐orthogonal quantum states with least probability of error. We demonstrate that this problem can be simplified if we solve for the error itself rather than solving directly for the optimal measurement. This method enables us to derive solutions directly and thus make definite statements about the uniqueness of an optimal strategy. This approach immediately leads us to a state‐discrimination analogue of Davies Theorem.In the course of this, a complete solution for distinguishing equally likely pure qubit states is presented.

DOI
10.1063/1.1834388

Related papers

Finding Optimal Solutions for Generalized Quantum State Discrimination Problems

Kenji Nakahira, Tsuyoshi Sasaki Usuda, Kentaro Kato

We study an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average success probability with and without a fixed rate of inconclusive results and the problem of finding an optimal measurement in the Neyman-Pearson strategy. We show that for any generalized quantum state discrimination problem, there is a corresponding minimum error discrimination problem sharing the same optimal measurement. We propose an approach in which the optimal measurement is obtained by solving the corresponding minimum error discrimination problem, and clarify the relationship between optimal solutions to the original and the corresponding problems, with which one can obtain an optimal solution to the original problem in some cases. Moreover, as an example of application of our approach, we present an algorithm for numerically obtaining optimal solutions to generalized quantum state discrimination problems.

arXiv:1510.05202•IEEE Transactions on Information Theory•Dec 24, 2016•8 citations

Optimal measurements for the discrimination of quantum states with a fixed rate of inconclusive results

Ulrike Herzog

We study the discrimination of $N$ mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination of $N$ states in a $d$-dimensional Hilbert space, we focus on the discrimination of qubit states. We develop a method to determine an optimal measurement for discriminating arbitrary qubit states, taking into account that often the optimal measurement is not unique and the maximum probability of correct results can be achieved by several different measurements. Analytical results are derived for a number of examples, mostly for the discrimination between qubit states which possess a partial symmetry, but also for discriminating $N$ equiprobable qubit states and for the dicrimination between a pure and a uniformly mixed state in $d$ dimensions. In the special case where the fixed rate of inconclusive results is equal to zero, our method provides a treatment for the minimum-error discrimination of arbitrary qubit states which differs from previous approaches.

arXiv:1504.03917•Physical Review A•Apr 29, 2015•24 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•65 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

Minimax quantum-state discrimination

Giacomo Mauro D’Ariano, Massimiliano Federico Sacchi, Jonas Kahn

We derive the optimal measurement for quantum-state discrimination without a priori probabilities, i.e., in a minimax strategy instead of the usually considered Bayesian one. We consider both minimal-error and unambiguous discrimination problems, and provide the relation between the optimal measurements according to the two schemes. We show that there are instances in which the minimum risk cannot be achieved by an orthogonal measurement, and this is a common feature of the minimax estimation strategy.

arXiv:quant-ph/0504048•Physical Review A•Sep 8, 2005•54 citations

Measurement does not always aid state discrimination

Kieran Hunter

We have investigated the problem of discriminating between nonorthogonal quantum states with the least probability of error. We have determined that the best strategy for some sets of states is to make no measurement at all and simply to always assign the most commonly occurring state. Conditions that describe such sets of states have been derived.

arXiv:quant-ph/0211148•Physical Review A•Jul 9, 2003•44 citations
We study the problem of discriminating between non‐orthogonal quantum states with least probability of error. We demonstrate that this problem can be simplified if we solve for the error itself rather than solving directly for the optimal measurement. This method enables us to derive solutions directly and thus make definite statements about the uniqueness of an optimal strategy. This approach immediately leads us to a state‐discrimination analogue of Davies Theorem.In the course of this, a complete solution for distinguishing equally likely pure qubit states is presented.
We study an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average success probability with and without a fixed rate of inconclusive results and the problem of finding an optimal measurement in the Neyman-Pearson strategy. We show that for any generalized quantum state discrimination problem, there is a corresponding minimum error discrimination problem sharing the same optimal measurement. We propose an approach in which the optimal measurement is obtained by solving the corresponding minimum error discrimination problem, and clarify the relationship between optimal solutions to the original and the corresponding problems, with which one can obtain an optimal solution to the original problem in some cases. Moreover, as an example of application of our approach, we present an algorithm for numerically obtaining optimal solutions to generalized quantum state discrimination problems.
We study the discrimination of NNN mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination of NNN states in a ddd-dimensional Hilbert space, we focus on the discrimination of qubit states. We develop a method to determine an optimal measurement for discriminating arbitrary qubit states, taking into account that often the optimal measurement is not unique and the maximum probability of correct results can be achieved by several different measurements. Analytical results are derived for a number of examples, mostly for the discrimination between qubit states which possess a partial symmetry, but also for discriminating NNN equiprobable qubit states and for the dicrimination between a pure and a uniformly mixed state in ddd dimensions. In the special case where the fixed rate of inconclusive results is equal to zero, our method provides a treatment for the minimum-error discrimination of arbitrary qubit states which differs from previous approaches.
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.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
We derive the optimal measurement for quantum-state discrimination without a priori probabilities, i.e., in a minimax strategy instead of the usually considered Bayesian one. We consider both minimal-error and unambiguous discrimination problems, and provide the relation between the optimal measurements according to the two schemes. We show that there are instances in which the minimum risk cannot be achieved by an orthogonal measurement, and this is a common feature of the minimax estimation strategy.