Related papers: A universal programmable quantum state discriminat…
In quantum state discrimination, one aims to identify unknown states from a given ensemble by performing measurements. Different strategies such as minimum-error discrimination or unambiguous state identification find different optimal…
Quantum indistinguishability of non-orthogonal quantum states is a valuable resource in quantum information applications such as cryptography and randomness generation. In this article, we present a sequential state-discrimination scheme…
When discriminating between two pure quantum states, there exists a quantitative tradeoff between the information retrieved by the measurement and the disturbance caused on the unknown state. We derive the optimal tradeoff and provide the…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three…
Extracting information from quantum devices has long been a crucial problem in the field of quantum mechanics. By performing elaborate measurements, quantum state tomography, an important and fundamental tool in quantum science and…
Knowing and guessing, these are two essential epistemological pillars in the theory of quantum-mechanical measurement. As formulated quantum mechanics is a statistical theory. In general, a priori unknown states can be completely determined…
In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Ac\'in, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success…
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 consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the…
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…
A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal…
We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple…
We address the fundamental task of converting $n$ uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is…
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…
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…
The goal of comparison is to reveal the difference of compared objects as fast and reliably as possible. In this paper we formulate and investigate the unambiguous comparison of unknown quantum measurements represented by non-degenerate…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite…
We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the…