Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2408.06678 · Physical Review A

Attainability of quantum state discrimination bounds with collective measurements on finite copies

Lorcán O. Conlon, Jin Ming Koh, Biveen Shajilal, Jasminder S. Sidhu, Ping Koy Lam, Syed M. Assad

Published Feb 21, 2025• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.111.022438

Related papers

Multiple-copy state discrimination of noisy qubits

Kieran Flatt, Stephen Mark Barnett, Sarah Croke

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.

arXiv:1906.11212•Physical Review A•Sep 26, 2019•9 citations

Discriminating mixed qubit states with collective measurements

Lorcán O. Conlon, Falk X. Eilenberger, Ping Koy Lam +1 more

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.

arXiv:2302.08882•Communications Physics•Nov 22, 2023•23 citations

Quantum state discrimination bounds for finite sample size

Koenraad M. R. Audenaert, Milán Mosonyi, Frank Verstraete

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.

arXiv:1204.0711•Journal of Mathematical Physics•Dec 1, 2012•47 citations

An asymptotic error bound for testing multiple quantum hypotheses

Michael Nussbaum, Arleta Szkoła

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.

arXiv:1112.1529•The Annals of Statistics•Dec 1, 2011•21 citations

Minimum-error discrimination of quantum states: New bounds and comparison

Daowen Qiu, Lvjun Li

The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary $m$ quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary $m$ mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if $m=2$, the optimal inconclusive probability of unambiguous discrimination $Q_{U}$ and the minimum-error probability of ambiguous discrimination $Q_{E}$ between arbitrary given $m$ mixed quantum states have the relationship $Q_{U}\geq 2Q_{E}$. In this paper, we show that, however, if $m>2$, the relationship $Q_{U}\geq 2Q_{E}$ may not hold again in general, and there may be no supremum of $Q_{U}/Q_{E}$ for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.

arXiv:0812.2378•Dec 12, 2008•4 citations

Multiple-copy state discrimination: Thinking globally, acting locally

Brendon L. Higgins, Andrew C. Doherty, Stephen D. Bartlett +2 more

We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular, we examine the difference that local and global optimization of local measurements makes to the probability of obtaining an erroneous result, in the regime of finite numbers of copies $N$, and in the asymptotic limit as $N\ensuremath{\rightarrow}\ensuremath{\infty}$. Five schemes are considered: optimal collective measurements over all copies, locally optimal local measurements in a fixed single-qubit measurement basis, globally optimal fixed local measurements, locally optimal adaptive local measurements, and globally optimal adaptive local measurements. Here an adaptive measurement is one in which the measurement basis can depend on prior measurement results. For each of these measurement schemes we determine the probability of error (for finite $N$) and the scaling of this error in the asymptotic limit. In the asymptotic limit, it is known analytically (and we verify numerically) that adaptive schemes have no advantage over the optimal fixed local scheme. Here we show moreover that, in this limit, the most naive scheme (locally optimal fixed local measurements) is as good as any noncollective scheme except for states with less than 2% mixture. For finite $N$, however, the most sophisticated local scheme (globally optimal adaptive local measurements) is better than any other noncollective scheme for any degree of mixture.

arXiv:1012.3525•Physical Review A•May 17, 2011•37 citations
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 MMM-copy Helstrom measurement. We also investigate the necessary conditions to saturate the MMM-copy Helstrom bound. It is known that a collective measurement on all MMM copies of the unknown state is always sufficient to saturate the MMM-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 MMM copies of the unknown state. For many regimes we find that a collective measurement on all MMM copies of the unknown state is necessary to saturate the MMM-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.
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.
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.
The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary mmm quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary mmm mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if m=2m=2m=2, the optimal inconclusive probability of unambiguous discrimination QUQ_{U}QU​ and the minimum-error probability of ambiguous discrimination QEQ_{E}QE​ between arbitrary given mmm mixed quantum states have the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​. In this paper, we show that, however, if m>2m>2m>2, the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​ may not hold again in general, and there may be no supremum of QU/QEQ_{U}/Q_{E}QU​/QE​ for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.
We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular, we examine the difference that local and global optimization of local measurements makes to the probability of obtaining an erroneous result, in the regime of finite numbers of copies NNN, and in the asymptotic limit as $N\ensuremath{\rightarrow}\ensuremath{\infty}$. Five schemes are considered: optimal collective measurements over all copies, locally optimal local measurements in a fixed single-qubit measurement basis, globally optimal fixed local measurements, locally optimal adaptive local measurements, and globally optimal adaptive local measurements. Here an adaptive measurement is one in which the measurement basis can depend on prior measurement results. For each of these measurement schemes we determine the probability of error (for finite NNN) and the scaling of this error in the asymptotic limit. In the asymptotic limit, it is known analytically (and we verify numerically) that adaptive schemes have no advantage over the optimal fixed local scheme. Here we show moreover that, in this limit, the most naive scheme (locally optimal fixed local measurements) is as good as any noncollective scheme except for states with less than 2% mixture. For finite NNN, however, the most sophisticated local scheme (globally optimal adaptive local measurements) is better than any other noncollective scheme for any degree of mixture.