Related papers: Certified answers for ordered quantum discriminati…
Quantum steering refers to the non-classical correlations that can be observed between the outcomes of measurements applied on half of an entangled state and the resulting post-measured states that are left with the other party. From an…
In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of two given and completely known states, rho or sigma. In…
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…
Quantum state discrimination underlies various applications in quantum information processing tasks. It essentially describes the distinguishability of quantum systems in different states, and the general process of extracting classical…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science. Self-testing is a method to infer the underlying physics of a quantum experiment only from the measured statistics. While all…
In this article we propose a method to estimate with high accuracy pure quantum states of a single qudit. Our method is based on the minimization of the squared error between the complex probability amplitudes of the unknown state and its…
To obtain a complete description of a quantum system, one usually employs standard quantum state tomography, which however requires exponential number of measurements to perform and hence is impractical when the system's size grows large.…
A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a…
We consider a device which can be programmed using coherent states of light to approximate a given projective measurement on an input coherent state. We provide and discuss three practical implementations of this programmable projective…
The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of…
We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.
We consider passive imaging tasks involving discrimination between known candidate objects and investigate the best possible accuracy with which the correct object can be identified. We analytically compute quantum-limited error bounds for…
This paper deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator $\rho_0$. It is well-known that the minimal error probability is given by…
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…
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…
The estimation of the density matrix of a $k$-level quantum system is studied when the parametrization is given by the real and imaginary part of the entries and they are estimated by independent measurements. It is established that the…
Measuring the distinguishability between quantum states is a basic problem in quantum information theory. In this paper, we develop optimal quantum algorithms that estimate both the trace distance and the (square root) fidelity between pure…
We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…
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…