Related papers: Unambiguous discrimination of mixed states
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum…
We investigate the unambiguous comparison of quantum states in a scenario that is more general than the one that was originally suggested by Barnett et al. First, we find the optimal solution for the comparison of two states taken from a…
We consider the problem of designing an optimal quantum detector that distinguishes unambiguously between a collection of mixed quantum states. Using arguments of duality in vector space optimization, we derive necessary and sufficient…
A set of quantum states can be unambiguously discriminated if and only if they are linearly independent. However, for a linearly dependent set, if C copies of the state are available, then the resulting C particle states may form a linearly…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
We show a geometric formulation for minimum-error discrimination of qubit states, that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal…
The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed…
The problem of discriminating with minimum error between two mixed quantum states is reviewed, with emphasize on the detection operators necessary for performing the measurement. An analytical result is derived for the minimum probability…
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able…
We consider the problem of minimum-error quantum state discrimination for single-qubit mixed states. We present a method which uses the Helstrom conditions constructively and analytically; this algebraic approach is complementary to…
We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and…
We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are…
Quantum mechanics forbids deterministic discrimination among non-orthogonal states. Nonetheless, the capability to distinguish nonorthogonal states unambiguously is an important primitive in quantum information processing. In this work, we…
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the cases of single use and multiple uses…
We obtain a necessary and sufficient condition for a finite set of states of a finite dimensional multiparticle quantum system to be amenable to unambiguous discrimination using local operations and classical communication. This condition…
We provide necessary and sufficient conditions for separability of mixed states. As a result we obtain a simple criterion of separability for $2\times2$ and $2\times3$ systems. Here, the positivity of the partial transposition of a state is…
We provide a simple proof for the necessity of conditions for discriminating with minimum error between a known set of quantum states.
We address the following state comparison problem: is it possible to design an experiment enabling us to unambiguously decide (based on the observed outcome statistics) on the sameness or difference of two unknown state preparations without…
In this paper, we shall show that the question of quanum state unambiguous discrimination can be solved by reducing it to the known problem of quantum states filtering.
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…