Related papers: Nonlocality in unambiguous pure-state identificati…

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…

We consider unambiguous discrimination of two separable bipartite states, one being pure and the other being a rank-2 mixed state. There is a gap between the optimal success probability under global measurements and the one achieved by…

Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state…

Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but…

The problem of unambiguous state discrimination consists of determining which of a set of known quantum states a particular system is in. One is allowed to fail, but not to make a mistake. The optimal procedure is the one with the lowest…

Entanglement is an useful resource because some global operations cannot be locally implemented using classical communication. We prove a number of results about what is and is not locally possible. We focus on orthogonal states, which can…

We analyze the difference in the local distinguishability among the following three restrictions; (i) Local operations and only one-way classical communications (one-way LOCC) are permitted. (ii) Local operations and two-way classical…

We consider different settings of the task to distinguish pure orthogonal quantum states under local operations and a limited amount of classical communication. In the first setting, the spatially separated parties are allowed to perform…

We examine the problem of using local operations and classical communication (LOCC) to distinguish a known pure state from an unknown (possibly mixed) state, bounding the error probability from above and below. We study the asymptotic rate…

A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown…

We study the discrimination of multipartite quantum states by local operations and classical communication. We derive that any optimal discrimination of quantum states spanning a two-dimensional Hilbert space in which each party's space is…

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 consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show…

We address the problem of unambiguously identifying the state of a probe qudit with the state of one of d reference qudits. The reference states are assumed pure and linearly independent but we have no knowledge of them. The state of the…

We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive…

We investigate the extent to which we can establish whether or not two quantum systems have been prepared in the same state. We investigate the possibility of universal unambiguous state comparison. We show that it is impossible to…

We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is…

A universal programmable discriminator can perform the discrimination between two unknown states, and the optimal solution can be approached via the discrimination between the two averages over the uniformly distributed unknown input pure…

We consider one copy of a quantum system prepared in one of two non-orthogonal pure product states of multipartite distributed among separated parties. We show that there exist protocols which obtain optimal probability in the sense of…

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total…