相关论文: Success probabilities for universal unambiguous di…

We propose a notion of state distinguishability that does not refer to probabilities, but rather to the ability of a set of states to serve as programs for a desired set of gates. Using this notion, we reconstruct the structural features of…

The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without…

We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…

We try to find an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average correct probability with and without a fixed rate of…

Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there…

We address the problem of non-orthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability…

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.

In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the…

We consider online strategies for discriminating between symmetric pure states with zero error when $n$ copies of the states are provided. Optimized online strategies involve local, possibly adaptive measurements on each copy and are…

We consider a protocol to perform the optimal quantum state discrimination of $N$ linearly independent non-orthogonal pure quantum states and present a computational code. Through the extension of the original Hilbert space, it is possible…

We present an experimental implementation of optimum measurements for quantum state discrimination. Optimum maximum-confidence discrimination and optimum unambiguous discrimination of two mixed single-photon polarization states were…

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…

This paper explores the role of a priori knowledge in the optimization of quantum information processing by investigating optimum unambiguous discrimination problems for both the qubit and qutrit states. In general, a priori knowledge in…

This article investigates the difference between the true detection probability and the subjective probability of a uniformly optimal search plan. Its main contributions are multi-fold. First, it provides a set of examples to show that, in…

In this paper, we introduce a mixed form of ambiguous and unambiguous quantum state discriminations, and show that the mixed form has higher success probability than the unambiguous quantum state discriminations.

We discuss the disturbance by measurements which unambiguously discriminate between given candidate states. We prove that such an optimal measurement necessarily changes distinguishable states indistinguishable when the inconclusive outcome…

We investigate unambiguous discrimination between given quantum states with a sequential measurement, which is restricted to local measurements and one-way classical communication. If the given states are binary or those each of whose…

A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum…

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…

An algorithm of searching a zero of an unknown undimensional function is considered, measured at a point x with some error. The step sizes are random positive values and are calculated according to the rule: if two consecutive iterations…