Related papers: Generalized quantum Chernoff bound
In quantum information processing, {using a receiver device to differentiate between two nonorthogonal states leads to a quantum error probability. The minimum possible error is} known as the Helstrom bound. In this work we study and…
In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a…
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability…
The quantum prepare-and-measure scenario has been studied under various physical assumptions on the emitted states. Here, we first discuss how different assumptions are conceptually and formally related. We then identify one that can serve…
The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to…
Properties of random mixed states of order $N$ distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large $N$, due to the concentration of measure, the trace distance between two random states…
Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior…
The generalized quantum Stein's lemma characterizes the optimal asymptotic exponent of the type-II error in quantum hypothesis testing for an independent and identically distributed (IID) null hypothesis against a composite alternative…
The optimal error exponents of binary composite i.i.d. state discrimination are trivially bounded by the worst-case pairwise exponents of discriminating individual elements of the sets representing the two hypotheses, and in the…
When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the…
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…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
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…
We derive a bound on the precision of state estimation for finite dimensional quantum systems and prove its attainability in the generic case where the spectrum is non-degenerate. Our results hold under an assumption called local asymptotic…
One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this…
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…
This paper develops an optimal Chernoff type bound for the probabilities of large deviations of sums $\sum_{k=1}^n f (X_k)$ where $f$ is a real-valued function and $(X_k)_{k \in \mathbb{Z}_{\ge 0}}$ is a finite state Markov chain with an…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We consider multipartite quantum state discrimination and show that the minimum-error discrimination by separable measurements is closely related to the concept of entanglement witness. Based on the properties of entanglement witness, we…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…