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:1012.3525 · Physical Review A

Multiple-copy state discrimination: Thinking globally, acting locally

Brendon L. Higgins, Andrew C. Doherty, Stephen D. Bartlett, Geoff J. Pryde, Howard M. Wiseman

Published May 17, 2011• 37 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.83.052314

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 nonorthogonal quantum states with minimum average number of copies (Conference Presentation)

Sergei Slussarenko, Morgan M. Weston, Jungang Li +3 more

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).

SPIE Quantum Information Science and Technology•Oct 11, 2018•0 citations

Mixed State Discrimination Using Optimal Control

Brendon L. Higgins, B. M. Booth, Andrew C. Doherty +3 more

We present theory and experiment for the task of discriminating two nonorthogonal states, given multiple copies. We implement several local measurement schemes, on both pure states and states mixed by depolarizing noise. We find that schemes which are optimal (or have optimal scaling) without noise perform worse with noise than simply repeating the optimal single-copy measurement. Applying optimal control theory, we derive the globally optimal local measurement strategy, which outperforms all other local schemes, and experimentally implement it for various levels of noise.

arXiv:0909.1572•Physical Review Letters•Nov 24, 2009•36 citations

Distinguishing mixed quantum states: Minimum-error discrimination versus optimum unambiguous discrimination

Ulrike Herzog, János A. Bergou

We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability.

arXiv:quant-ph/0403124•Physical Review A•Aug 5, 2004•65 citations

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

Lorcán O. Conlon, Jin Ming Koh, Biveen Shajilal +3 more

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.

arXiv:2408.06678•Physical Review A•Feb 21, 2025•5 citations

Multiple-copy two-state discrimination with individual measurements

Antonio Acín, E. Bagán, M. Baig +2 more

We address the problem of nonorthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability saturates the collective (lower) bound asymptotically. We also give the optimal strategy when adaptivity of individual von Neumann measurements is allowed (which requires classical communication) and show that the corresponding error probability is exactly equal to the collective one for any number of copies. We show that this strategy can be regarded as Bayesian updating.

arXiv:quant-ph/0410097•Physical Review A•Mar 23, 2005•89 citations
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→\ensuremath∞N\ensuremath{\rightarrow}\ensuremath{\infty}N\ensuremath→\ensuremath∞. 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.
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.
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).
We present theory and experiment for the task of discriminating two nonorthogonal states, given multiple copies. We implement several local measurement schemes, on both pure states and states mixed by depolarizing noise. We find that schemes which are optimal (or have optimal scaling) without noise perform worse with noise than simply repeating the optimal single-copy measurement. Applying optimal control theory, we derive the globally optimal local measurement strategy, which outperforms all other local schemes, and experimentally implement it for various levels of noise.
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability.
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.
We address the problem of nonorthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability saturates the collective (lower) bound asymptotically. We also give the optimal strategy when adaptivity of individual von Neumann measurements is allowed (which requires classical communication) and show that the corresponding error probability is exactly equal to the collective one for any number of copies. We show that this strategy can be regarded as Bayesian updating.