Related papers: Structure of minimum-error quantum state discrimin…
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…
We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing an orthogonal separable state ensemble. Using a bound on local minimum-error discrimination, we provide a sufficient condition for the…
This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly…
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…
We investigate the quantum state discrimination task for sets of linear independent pure states with an intrinsic ordering. This structured discrimination problems allow for a novel scheme that provides a certified level of error, that is,…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
Quantum state discrimination enables the accurate identification of quantum states, which are generally nonorthogonal. Among various strategies, minimum-error discrimination and unambiguous state discrimination exhibit…
We consider the task of distinguishing whether a quantum system is prepared in a state from one of several sets of quantum states. Assuming their convexity and stability under tensor product, we prove that the optimal error exponent for…
In this work we relate the well-known no-go theorem that two non-orthogonal (mixed) quantum states cannot be perfectly discriminated, to the general principle in physics, the no-signalling condition. In fact, we derive the minimum error in…
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…
The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed…
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…
The discrimination of non-orthogonal quantum states with reduced or without errors is a fundamental task in quantum measurement theory. In this work, we investigate a quantum measurement strategy capable of discriminating two coherent…
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 propose two experimental schemes for quantum state discrimination that achieve the optimal tradeoff between the probability of correct identification and the disturbance on the quantum state.
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task…
Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or…
We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from…
Non-orthogonal quantum states pose a fundamental challenge in quantum information processing, as they cannot be distinguished with absolute certainty. Conventionally, the focus has been on minimizing error probability in quantum state…