Related papers: Pretty simple bounds on quantum state discriminati…
Bounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for…
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 derive a new lower bound on the success probability of the Pretty Good Measurement (PGM) for worst-case quantum state discrimination among $m$ pure states. Our bound is strictly tighter than the previously known Gram-matrix-based bound…
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…
We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the…
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…
Quantum fidelity is a central tool in quantum information, quantifying how much two quantum states are similar. Here we propose a limit formula for the quantum fidelity between a mixed state and a pure state. As an example of an…
We consider the problem of estimating the state of a large but finite number $N$ of identical quantum systems. In the limit of large $N$ the problem simplifies. In particular the only relevant measure of the quality of the estimation is the…
Quantum state discrimination depicts the general progress of extracting classical information from quantum systems. We show that quantum state discrimination can be realized in a device-independent scenario using tools of self-testing…
We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…
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 present an application of particle statistics to the problem of optimal ambiguous discrimination of quantum states. The states to be discriminated are encoded in the internal degrees of freedom of identical particles, and we use the…
We investigate the ability of a quantum measurement device to discriminate two states or, generically, two hypothesis. In full generality, the measurement can be performed a number $n$ of times, and arbitrary pre-processing of the states…
The quantum state discrimination problem has Alice sending a quantum state to Bob who wins if he correctly identifies the state. The pretty good measurement, also known as the square root measurement, performs pretty well at this task. We…
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…
We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two…
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…
In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be…
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…