Related papers: Optimal state discrimination and unstructured sear…
We solve the unstructured search problem in constant time by computing with a physically motivated nonlinearity of the Gross-Pitaevskii type. This speedup comes, however, at the novel expense of increasing the time-measurement precision.…
Evolution by the Gross-Pitaevskii equation, which describes Bose-Einstein condensates under certain conditions, solves the unstructured search problem more efficiently than does the Schr\"odinger equation, because it includes a cubic…
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 propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and…
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…
Although quant mech is linear, there are nevertheless quant sys with multiple interacting particles in which the effective evo of a single particle is governed by a nonlinear eq. This includes Bose-Einstein condensates, which are gov by the…
Roa et al. showed that quantum state discrimination between two nonorthogonal quantum states does not require quantum entanglement but quantum dissonance only. We find that quantum coherence can also be utilized for unambiguous quantum…
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and…
Given a finite set of linearly independent quantum states, an observer who examines a single quantum system may sometimes identify its state with certainty. However, unless these quantum states are orthogonal, there is a finite probability…
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…
It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of…
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…
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is conclusive discrimination with a minimum probability of inferring an erroneous result, and the second is…
Enhancing quantum illumination with highly entangled probes remains an active area of research. In this context, non-Gaussian operations provide an effective route for engineering probe states that can surpass the standard two-mode squeezed…
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…
Nonlinear mean field dynamics enables quantum information processing operations that are impossible in linear one-particle quantum mechanics. In this approach, a register of bosonic qubits (such as neutral atoms or polaritons) is…
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…
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to…
In this paper we present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying…
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…