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

Optimal discrimination of quantum sequences

Tathagata Gupta, Shayeef Murshid, Vincent Russo, Somshubhro Bandyopadhyay

Published Dec 30, 2024• 2 citations
arXivHTMLPDF

Abstract

A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely, quantum sequence discrimination, appears in various quantum information processing tasks, the objective being to determine the state of a finite sequence of quantum states. Since such a sequence is a composite quantum system, the fundamental question is whether an optimal measurement is local, i.e., comprising measurements on the individual members, or collective, i.e., requiring joint measurement(s). In some known instances of this problem, the optimal measurement is local, whereas in others, it is collective. But, so far, a definite prescription based solely on the problem description has been lacking. In this paper, we prove that if the members of a given sequence are secretly and independently drawn from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence, and no collective measurement is necessary. This holds for both minimum-error and unambiguous state discrimination paradigms.

DOI
10.1103/physreva.110.062426

Related papers

Unambiguous discrimination of sequences of quantum states

Tathagata Gupta, Shayeef Murshid, Somshubhro Bandyopadhyay

We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the property that their mutual inner products are all real and equal. This problem can be posed as an instance of unambiguous state discrimination where the states correspond to that of all possible sequences having the same length as the given one. We calculate the optimum probability by solving the optimality conditions of a semidefinite program. The optimum value is achievable by measuring individual members of the sequence, and no collective measurement is necessary.

arXiv:2402.06365•Physical Review A•May 22, 2024•4 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

Sequential Discrimination Between Non-Orthogonal Quantum States

Dov Fields

The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.

•Jan 1, 2019•0 citations

Factorizability of optimal quantum sequence discrimination under maximum-confidence measurements

Donghoon Ha, Jeong San Kim

We consider the discrimination of quantum sequences under maximum-confidence measurements and show that the optimal discrimination of a quantum sequence ensemble can always be factorized into that of each individual ensemble. In other words, the optimal quantum sequence discrimination under maximum-confidence measurements can be achieved just by performing a maximum-confidence discrimination independently at each step of the quantum sequence. We also show that the maximum confidence of identifying a quantum sequence is to achieve the maximum confidence of identifying each state comprising the quantum sequence. We further provide a necessary and sufficient condition for the optimal quantum state discrimination under maximum-confidence measurements.

arXiv:2510.20311•Physical Review A•Feb 9, 2026•0 citations

Contextuality in Sequential State Discrimination

Nyan Raess, Farid Shahandeh

Generalized contextuality is known to be required in optimal strategies for quantum state discrimination protocols. More recently, sequential discrimination tasks have been studied; n players attempt to determine in which state a qubit was prepared, in such a way that they all have a finite probability of success. We consider the extent to which contextuality plays a role in sequential versions of both unambiguous and minimum error discrimination. In the standard nonsequential case where n = 1, we use the COPE formalism to demonstrate that the presence of contextuality is guaranteed not only for the optimal measurement, but for a specific set of nonoptimal measurements as well. In the sequential case n > 1, we show that the presence of contextuality depends on which states are prepared, and on the protocol (unambiguous or minimum error) selected.

quant-pharXiv:2608.04099•Aug 6, 2026•0 citations

Quantum nonlocality without entanglement and state discrimination measures

Shayeef Murshid, Tathagata Gupta, Vincent Russo +1 more

An ensemble of product states is said to exhibit “quantum nonlocality without entanglement” if it cannot be optimally discriminated using local operations and classical communication (LOCC). We show that this property can depend on the chosen discrimination measure. Specifically, we construct a family of ensembles, each consisting of six linearly independent, equally probable bipartite product states, for which LOCC fails to achieve optimal minimum-error discrimination but succeeds in achieving optimal unambiguous discrimination. We further extend our construction to multipartite systems and provide strong numerical evidence that a similar separation between local and global optima is present for minimum-error discrimination, but not for unambiguous discrimination.

arXiv:2506.20560•Quantum•Jul 23, 2026•0 citations
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely, quantum sequence discrimination, appears in various quantum information processing tasks, the objective being to determine the state of a finite sequence of quantum states. Since such a sequence is a composite quantum system, the fundamental question is whether an optimal measurement is local, i.e., comprising measurements on the individual members, or collective, i.e., requiring joint measurement(s). In some known instances of this problem, the optimal measurement is local, whereas in others, it is collective. But, so far, a definite prescription based solely on the problem description has been lacking. In this paper, we prove that if the members of a given sequence are secretly and independently drawn from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence, and no collective measurement is necessary. This holds for both minimum-error and unambiguous state discrimination paradigms.
We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the property that their mutual inner products are all real and equal. This problem can be posed as an instance of unambiguous state discrimination where the states correspond to that of all possible sequences having the same length as the given one. We calculate the optimum probability by solving the optimality conditions of a semidefinite program. The optimum value is achievable by measuring individual members of the sequence, and no collective measurement is necessary.
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.
The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.
We consider the discrimination of quantum sequences under maximum-confidence measurements and show that the optimal discrimination of a quantum sequence ensemble can always be factorized into that of each individual ensemble. In other words, the optimal quantum sequence discrimination under maximum-confidence measurements can be achieved just by performing a maximum-confidence discrimination independently at each step of the quantum sequence. We also show that the maximum confidence of identifying a quantum sequence is to achieve the maximum confidence of identifying each state comprising the quantum sequence. We further provide a necessary and sufficient condition for the optimal quantum state discrimination under maximum-confidence measurements.
Generalized contextuality is known to be required in optimal strategies for quantum state discrimination protocols. More recently, sequential discrimination tasks have been studied; n players attempt to determine in which state a qubit was prepared, in such a way that they all have a finite probability of success. We consider the extent to which contextuality plays a role in sequential versions of both unambiguous and minimum error discrimination. In the standard nonsequential case where n = 1, we use the COPE formalism to demonstrate that the presence of contextuality is guaranteed not only for the optimal measurement, but for a specific set of nonoptimal measurements as well. In the sequential case n > 1, we show that the presence of contextuality depends on which states are prepared, and on the protocol (unambiguous or minimum error) selected.
An ensemble of product states is said to exhibit “quantum nonlocality without entanglement” if it cannot be optimally discriminated using local operations and classical communication (LOCC). We show that this property can depend on the chosen discrimination measure. Specifically, we construct a family of ensembles, each consisting of six linearly independent, equally probable bipartite product states, for which LOCC fails to achieve optimal minimum-error discrimination but succeeds in achieving optimal unambiguous discrimination. We further extend our construction to multipartite systems and provide strong numerical evidence that a similar separation between local and global optima is present for minimum-error discrimination, but not for unambiguous discrimination.