Related papers: Exponential error rates in multiple state discrimi…
Given two families of quantum states $A$ and $B$, called the null and the alternative hypotheses, quantum hypothesis testing is the task of determining whether an unknown quantum state belongs to $A$ or $B$. Mistaking $A$ for $B$ is a type…
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication…
The trade-off between the two types of errors in binary state discrimination may be quantified in the asymptotics by various error exponents. In the case of simple i.i.d. hypotheses, each of these exponents is equal to a divergence…
A measurement strategy is developed for a new kind of hypothesis testing. It assigns, with minimum probability of error, the state of a quantum system to one or the other of two complementary subsets of a set of N given non-orthogonal…
We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we…
One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between…
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…
The trade-offs between error probabilities in quantum hypothesis testing are by now well-understood in the centralized setting, but much less is known for distributed settings. Here, we study a distributed binary hypothesis testing problem…
We provide a bound on the minimum error when discriminating among quantum states, using the no-signaling principle. The bound is general in that it depends on neither dimensions nor specific structures of given quantum states to be…
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…
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous…
In the asymptotic theory of quantum hypothesis testing, the minimal error probability of the first kind jumps sharply from zero to one when the error exponent of the second kind passes by the point of the relative entropy of the two states…
Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples.…
By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the…
Using the necessary and sufficient conditions, minimum error discrimination among two sets of similarity transformed equiprobable quantum qudit states is investigated. In the case that the unitary operators are generating sets of two…
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,…
The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable…
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 present a quantum extension of a version of Sanov's theorem focussing on a hypothesis testing aspect of the theorem: There exists a sequence of typical subspaces for a given set $\Psi$ of stationary quantum product states asymptotically…
We study an optimum measurement for quantum state discrimination, which maximizes the probability of correct results when the probability of inconclusive results is fixed at a given value. The measurement describes minimum-error…