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

SPIE Quantum Information Science and Technology

Discriminating nonorthogonal quantum states with minimum average number of copies (Conference Presentation)

Sergei Slussarenko, Morgan M. Weston, Jungang Li, Nicholas Campbell, Howard M. Wiseman, Geoff J. Pryde

Published Oct 11, 2018• 0 citations
Publisher

Abstract

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

DOI
10.1117/12.2325485

Related papers

Quantum State Discrimination Using the Minimum Average Number of Copies

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

In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the average error probability for fixed resources. Here we introduce a new state discrimination task: minimizing the average resources for a fixed admissible error probability. We show that this new task is not performed optimally by previously known strategies, and derive and experimentally test a detection scheme that performs better.

arXiv:1605.07807•Physical Review Letters•Jan 20, 2017•22 citations

Nonclassical traits in multi-copy state discrimination

Tim Achenbach, Leevi Leppäjärvi, Hanwool Lee +1 more

Quantum state discrimination is a fundamental information processing task that serves as a key component in many applications while also carrying foundational significance. In this work, we consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared. Now the discrimination allows for measurements from multiple parties with different measurement strategies varying from global measurement strategy to ones restricted to different forms of local operations and classical communication strategies. By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies. On the other hand, we show that the classical measurement strategy does not give benefit in qubit over bit. However, we find that there are other (qu)bit-like operational theories which can outperform the best qubit strategies even with a classical measurement strategy and we are able to identify instances of different theories where different measurement strategies are optimal. In this way, we are able to find instances of nonlocality without entanglement as well as provide general bounds for bit-like operational theories.

quant-pharXiv:2604.26647•Apr 30, 2026•0 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

Discrimination of mixed quantum states: Reversible maps and unambiguous strategies

Matthias Kleinmann

The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer. Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy. If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states. A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks. As an important application of unambiguous state discrimination, unambiguous state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed. If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.

•Jan 1, 2008•0 citations

Quantum Sequential Hypothesis Testing

Esteban Martínez-Vargas, Christoph Hirche, Gael Sentís +4 more

We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular, our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold ε when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows us to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as log1/ε, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., ε=0.

arXiv:2011.10773•Physical Review Letters•May 6, 2021•37 citations

Enhanced discrimination of high-dimensional quantum states by concatenated optimal measurement strategies

M. A. Solís-Prosser, O. Jiménez, A. Delgado +1 more

Abstract The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors, while demanding certainty leads to some inconclusiveness. One of the most fundamental strategies developed for this task is the optimal unambiguous measurement. It encompasses conclusive results, which allow for error-free state retrodictions with the maximum success probability, and inconclusive results, which are discarded for not allowing perfect identifications. Interestingly, in high-dimensional Hilbert spaces the inconclusive results may contain valuable information about the input states. Here, we theoretically describe and experimentally demonstrate the discrimination of nonorthogonal states from both conclusive and inconclusive results in the optimal unambiguous strategy, by concatenating a minimum-error measurement at its inconclusive space. Our implementation comprises four- and nine-dimensional spatially encoded photonic states. By accessing the inconclusive space to retrieve the information that is wasted in the conventional protocol, we achieve significant increases of up to a factor of 2.07 and 3.73, respectively, in the overall probabilities of correct retrodictions. The concept of concatenated optimal measurements demonstrated here can be extended to other strategies and will enable one to explore the full potential of high-dimensional nonorthogonal states for quantum communication with larger alphabets.

arXiv:2112.10014•Quantum Science and Technology•Nov 9, 2021•15 citations
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).
In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the average error probability for fixed resources. Here we introduce a new state discrimination task: minimizing the average resources for a fixed admissible error probability. We show that this new task is not performed optimally by previously known strategies, and derive and experimentally test a detection scheme that performs better.
Quantum state discrimination is a fundamental information processing task that serves as a key component in many applications while also carrying foundational significance. In this work, we consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared. Now the discrimination allows for measurements from multiple parties with different measurement strategies varying from global measurement strategy to ones restricted to different forms of local operations and classical communication strategies. By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies. On the other hand, we show that the classical measurement strategy does not give benefit in qubit over bit. However, we find that there are other (qu)bit-like operational theories which can outperform the best qubit strategies even with a classical measurement strategy and we are able to identify instances of different theories where different measurement strategies are optimal. In this way, we are able to find instances of nonlocality without entanglement as well as provide general bounds for bit-like operational theories.
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.
The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer. Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy. If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states. A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks. As an important application of unambiguous state discrimination, unambiguous state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed. If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.
We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular, our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold ε when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows us to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as log1/ε, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., ε=0.
Abstract The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors, while demanding certainty leads to some inconclusiveness. One of the most fundamental strategies developed for this task is the optimal unambiguous measurement. It encompasses conclusive results, which allow for error-free state retrodictions with the maximum success probability, and inconclusive results, which are discarded for not allowing perfect identifications. Interestingly, in high-dimensional Hilbert spaces the inconclusive results may contain valuable information about the input states. Here, we theoretically describe and experimentally demonstrate the discrimination of nonorthogonal states from both conclusive and inconclusive results in the optimal unambiguous strategy, by concatenating a minimum-error measurement at its inconclusive space. Our implementation comprises four- and nine-dimensional spatially encoded photonic states. By accessing the inconclusive space to retrieve the information that is wasted in the conventional protocol, we achieve significant increases of up to a factor of 2.07 and 3.73, respectively, in the overall probabilities of correct retrodictions. The concept of concatenated optimal measurements demonstrated here can be extended to other strategies and will enable one to explore the full potential of high-dimensional nonorthogonal states for quantum communication with larger alphabets.