One of the fundamental tenets of quantum mechanics is that nonorthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than nonentangling measurements. The error probability that can be attained using a collective measurement on a finite number of copies of the unknown state is given by the Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the attainable error probability. It is natural to ask, then, what strategies can be employed to reach these two bounds---is entanglement across all available modes always necessary or can other, experimentally more simple measurements saturate these bounds? In this work we address this question. We find analytic expressions for the Helstrom bound for arbitrarily many copies of the unknown state in simple qubit examples. Using these analytic expressions, we investigate whether the quantum Chernoff bound can be saturated by repeatedly implementing the $M$-copy Helstrom measurement. We also investigate the necessary conditions to saturate the $M$-copy Helstrom bound. It is known that a collective measurement on all $M$ copies of the unknown state is always sufficient to saturate the $M$-copy Helstrom bound. However, general conditions for when such a measurement is necessary to saturate the Helstrom bound remain unknown. We investigate specific measurement strategies which involve entangling operations on fewer than all $M$ copies of the unknown state. For many regimes we find that a collective measurement on all $M$ copies of the unknown state is necessary to saturate the $M$-copy Helstrom bound.
One of the fundamental tenets of quantum mechanics is that nonorthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between the different copies of the unknown state, can achieve a lower error probability than nonentangling measurements. The error probability that can be attained using a collective measurement on a finite number of copies of the unknown state is given by the Helstrom bound. In the limit where we can perform a collective measurement on asymptotically many copies of the quantum state, the quantum Chernoff bound gives the attainable error probability. It is natural to ask, then, what strategies can be employed to reach these two bounds---is entanglement across all available modes always necessary or can other, experimentally more simple measurements saturate these bounds? In this work we address this question. We find analytic expressions for the Helstrom bound for arbitrarily many copies of the unknown state in simple qubit examples. Using these analytic expressions, we investigate whether the quantum Chernoff bound can be saturated by repeatedly implementing the M-copy Helstrom measurement. We also investigate the necessary conditions to saturate the M-copy Helstrom bound. It is known that a collective measurement on all M copies of the unknown state is always sufficient to saturate the M-copy Helstrom bound. However, general conditions for when such a measurement is necessary to saturate the Helstrom bound remain unknown. We investigate specific measurement strategies which involve entangling operations on fewer than all M copies of the unknown state. For many regimes we find that a collective measurement on all M copies of the unknown state is necessary to saturate the M-copy Helstrom bound.
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, nonorthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability of successful discrimination allowed by quantum theory. For mixed states, it is known that only collective schemes can perform optimally, so it might be expected that these schemes are more resilient to preparation noise. We calculate the probability of success for two schemes, a local scheme based on Bayesian updating and quantum data gathering, the simplest possible collective measurement, and consider imperfect preparation fidelity. We find two surprising results. First, both schemes converge upon the same many-copy limit, which is less than unity. Second, the local scheme performs better in all cases. This highlights the point that one should take into account noise when designing state discrimination schemes.
Abstract It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. In general, the optimal measurement for distinguishing such states is a collective measurement. However, to the best our knowledge, collective measurements have not been used to enhance quantum state discrimination to date. One of the main reasons for this is the fact that, in the usual state discrimination setting with equal prior probabilities, at least three copies of a quantum state are required to be measured collectively to outperform separable measurements. This is very challenging experimentally. In this work, by considering unequal prior probabilities, we propose and experimentally demonstrate a protocol for distinguishing two copies of single qubit states using collective measurements which achieves a lower probability of error than can be achieved by any non-entangling measurement. Additionally, we implemented collective measurements on three and four copies of the unknown state and found they performed poorly.
We consider the problem of detecting the true quantum state among r possible ones, based of measurements performed on n copies of a finite-dimensional quantum system. A special case is the problem of discriminating between r probability measures on a finite sample space, using n i.i.d. observations. In this classical setting, it is known that the averaged error probability decreases exponentially with exponent given by the worst case binary Chernoff bound between any possible pair of the r probability measures. Define analogously the multiple quantum Chernoff bound, considering all possible pairs of states. Recently, it has been shown that this asymptotic error bound is attainable in the case of r pure states, and that it is unimprovable in general. Here we extend the attainability result to a larger class of r-tuples of states which are possibly mixed, but pairwise linearly independent. We also construct a quantum detector which universally attains the multiple quantum Chernoff bound up to a factor 1/3.
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 the two given and completely known states, ρ or σ. In general, it is not possible to decide the identity of the true state with certainty, and the optimal measurement strategy depends on whether the two possible errors (mistaking ρ for σ, or the other way around) are treated as of equal importance or not. Results on the quantum Chernoff and Hoeffding bounds and the quantum Stein's lemma show that, if several copies of the system are available then the optimal error probabilities decay exponentially in the number of copies, and the decay rate is given by a certain statistical distance between ρ and σ (the Chernoff distance, the Hoeffding distances, and the relative entropy, respectively). While these results provide a complete solution to the asymptotic problem, they are not completely satisfying from a practical point of view. Indeed, in realistic scenarios one has access only to finitely many copies of a system, and therefore it is desirable to have bounds on the error probabilities for finite sample size. In this paper we provide finite-size bounds on the so-called Stein errors, the Chernoff errors, the Hoeffding errors, and the mixed error probabilities related to the Chernoff and the Hoeffding errors.
The minimum error probability for distinguishing between two quantum states is bounded by the Helstrom limit, derived under the assumption that measurement strategies are restricted to positive operator-valued measurements. We explore scenarios in which the error probability for discriminating two quantum states can be reduced below the Helstrom bound under some constrained access of resources, indicating the use of measurement operations that go beyond the standard positive operator-valued measurements framework. We refer to such measurements as non-positive operator-valued measurements. While existing literature often associates these measurements with initial entanglement between the system and an auxiliary, followed by joint projective measurement and discarding the auxiliary, we demonstrate that initial entanglement between system and auxiliary is not necessary for the emergence of such measurements in the context of state discrimination. Interestingly, even initial product states can give rise to effective non-positive measurements on the subsystem, and achieve sub-Helstrom discrimination error when discriminating quantum states of the subsystem.
Quantum measurement and control science provides a toolkit for implementing quantum information protocols, overcoming noisy operation and minimizing the use of costly quantum resources. The importance of finding optimal measurement and control strategies is revealed in the task of quantum state discrimination, a characteristic feature of quantum mechanics and a primitive for quantum information science and technology. When a quantum system is prepared in one of two known nonorthogonal quantum states, no measurement can deterministically tell which state the system is in. Two strategies can be applied to discriminate non-orthogonal states efficiently. Unambiguous state discrimination (USD) is strategy that provides a guess which is either correct, or inconclusive [1]. Alternatively, minimum error discrimination (MED) strategy will always provide a conclusive answer, which can sometimes be incorrect [2]. Perfect nonorthogonal state discrimination is still impossible even when multiple copies of the system are available, although different strategies increase the chance of having conclusive (for USD), or correct (for MED) result. Multiple-copy measurement strategies can be either collective, when a single measurement involves all the copies of the system, or local, when each copy of the system is measured separately. The latter can be further divided into fixed, where the measurement applied to each copy is the same, or adaptive, where the measurement on each subsequent copy depends on the outcomes of the previous measurements [3,4]. A multiple-copy MED strategy is defined by its goal of minimizing the average error for fixed resources, i.e. the number of copies of the system. An alternative approach we consider, is to minimize the average resources required, while keeping errors below a given bound [5]. This approach is central for fault-tolerant quantum computing and has been applied to a number of quantum control strategies [6,7]. We call the corresponding state discrimination task the guaranteed bounded error discrimination (GBED) task. Intuitively, one may assume that the multiple-copy strategies optimal for MED would be also optimal for GBED. We experimentally apply two known local non-adaptive strategies, previously considered for the MED task, to the two-state GBED problem [5]. We then derive and experimentally demonstrate a new local strategy, designed specifically for the GBED task that outperforms other strategies. Moreover, it performs usually better than, and in the regime of small error, scales better than, the theoretical performance of the optimal adaptive strategy for the MED task. The discovered reversal in the performance of schemes when swapping the task definition from performance-maximization to resource-minimization, is similar to that previously observed in state purification [6], suggesting that this phenomenon is a generic one. [1] I. D. Ivanovic, Phys. Lett. A 123, 257 (1987). [2] C. W. Helstrom, Quantum detection and estimation theory (1976). [3] A. Acín, et al., Phys. Rev. A 71, 032338 (2005). [4] B. L. Higgins, et al., Phys. Rev. Lett. 103, 220503 (2009). [5] S. Slussarenko, et al., PRL 118, 030502 (2017). [6] H. M. Wiseman and J. F. Ralph. New J. Phys. 8, 90 (2006). [7] J. Combes, et al., Phys. Rev. Lett. 100, 160503 (2008).