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:2608.01167

Perfect Discrimination of Non-Orthogonal Quantum States via Adaptive Post-Measurement Queries

Hanwool Lee, Teiko Heinosaari

quant-phSubmitted Aug 2, 2026• Announced Aug 4, 2026• 0 citations
arXivHTMLPDF

Abstract

A set of pairwise non-orthogonal quantum states cannot be perfectly discriminated, and this remains true even when one bit of classical partial information is available prior to the measurement. Contrary to the usual intuition that earlier information is at least as valuable as later information, we show that the same bit can be more useful when it arrives after the measurement. We present a framework for state discrimination in which the sender provides classical information in response to a request from the receiver, which we refer to as a query. In some cases, pairwise non-orthogonal states can be perfectly discriminated when the query is allowed to depend on the measurement outcome. We give a general method for finding the optimal strategy in this setting, which turns out to be the standard minimum-error discrimination problem for an auxiliary ensemble.

AI Summary

The paper studies state discrimination assisted by one truthful binary answer from the sender, comparing queries made before measurement, fixed queries answered afterward, and post-measurement queries chosen adaptively from the measurement outcome. The distinction is that adaptivity changes which classical information is requested, rather than merely delaying the same information. For an ensemble $\{q_x,\rho_x\}_{x=1}^n$, the optimal adaptive strategy is reduced to minimum-error discrimination of an auxiliary ensemble containing every pairwise mixture $\rho_{(x,y)}=(q_x\rho_x+q_y\rho_y)/(q_x+q_y)$, with prior $(q_x+q_y)/(n-1)$. The optimal success probabilities satisfy $P_{\mathrm{adaptive}}=(n-1)P_{\mathrm{aux}}$. The proof groups measurement outcomes by their two most likely labels; a subsequent binary query separates those labels. Uniform trine qubit states illustrate perfect adaptive discrimination: an antidistinguishing measurement excludes one state, and the answer identifies the remaining candidate. Any pre-measurement query instead achieves only $(4+\sqrt{3})/6\approx0.955$. Lifted trines retain a strict adaptive advantage without perfect discrimination. Further constructions give perfect adaptive discrimination of $d+1$ pairwise nonorthogonal states in dimension $d$, and of $\lfloor3d/2\rfloor$ states using orthogonal blocks. The latter exceeds the stated outcome-independent bound $n\le d+1$ for $d>3$. An operator-norm bound and explicit optimal measurements establish these constructions; a separate argument proves $n\le d+1$ for $d\le3$. The maximal achievable number in general dimension remains open, as does a characterization of ensembles benefiting from adaptivity. Tetrahedral and lifted-BB84 qubit examples favor pre-measurement queries; whether any ensemble of at least four qubit states exhibits an adaptive advantage is unresolved.

Little sign of AI-generated text

Error found: The claimed universal bound n ≤ d+1 for outcome-independent post-measurement queries is contradicted by six distinct states in dimension four that are perfectly identified using computational-basis measurement and a fixed binary query distinguishing basis states from two orthogonally supported superpositions.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
6+6 pages, 2 figures

Related papers

Heralded enhancement in quantum state discrimination

Qipeng Qian, Christos N. Gagatsos

Abstract The discrimination of quantum states is a central problem in quantum information science and technology. Meanwhile, partial post-selection has emerged as a valuable tool for quantum state engineering. In this work, we bring these two areas together and ask whether partial measurements can enhance the discrimination performance between two unknown and non-orthogonal pure states. Our framework is general: the two unknown states interact with the same environment—set in a pure state—via an arbitrary unitary transformation. A measurement is then performed on one of the output modes (i.e. a partial measurement), modeled by an arbitrary positive operator-valued measure (POVM). We then allow classical communication to inform the unmeasured mode of the outcome of the partial measurement, which is subsequently measured by a POVM that is optimal in the sense that the discrimination probability of error is minimized. The two POVMs act locally and classical information is exchanged between the two modes, representing a single-round (feed-forward) form of local operations with classical communication. Under these considerations, we first show that, as expected, the minimum error probability, averaged over all possible conditional states, cannot be reduced below the minimum error probability of discriminating the original input states. Then, we devise a generic setup produces specific examples where the conditional discrimination can achieve strictly lower error probabilities than the original optimal measurement, illustrating that while post-selection does not improve the average performance, it can enable better discrimination in certain post-selected ensembles.

arXiv:2506.14105•Physica Scripta•Apr 10, 2026•0 citations

State discrimination with postmeasurement information and incompatibility of quantum measurements

Claudio Carmeli, Teiko Heinosaari, Alessandro Toigo

We discuss the following variant of the standard minimum error state discrimination problem: Alice picks the state she sends to Bob among one of several disjoint state ensembles, and she communicates him the chosen ensemble only at a later time. Two different scenarios then arise: either Bob is allowed to arrange his measurement setup after Alice has announced him the chosen ensemble, or he is forced to perform the measurement before Alice's announcement. In the latter case, he can only postprocess his measurement outcome when Alice's extra information becomes available. We compare the optimal guessing probabilities in the two scenarios, and we prove that they are the same if and only if there exist compatible (i.e., jointly measurable) optimal measurements for all of Alice's state ensembles. When this is the case, postprocessing any of the corresponding joint measurements is Bob's optimal strategy in the postmeasurement information scenario. Furthermore, we establish a connection between discrimination with postmeasurement information and the standard state discrimination. By means of this connection and exploiting the presence of symmetries, we are able to compute the various guessing probabilities in many concrete examples.

arXiv:1804.09693•Physical Review A•Jul 19, 2018•48 citations

Optimal discrimination of quantum states

Graeme Weir

Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.

•Jan 1, 2018•4 citations

Optimal Unambiguous Discrimination And Quantum Nonlocality Without Entanglement: Locking And Unlocking By Post-Measurement Information

Donghoon Ha, Jeong San Kim

Abstract The phenomenon of nonlocality without entanglement(NLWE) arises in discriminating multi-party quantum separable states. Recently, it has been found that the post-measurement information about the prepared subensemble can lock or unlock NLWE in minimum-error discrimination of non-orthogonal separable states. Thus it is natrual to ask whether the availability of the post-measurement information can influence on the occurrence of NLWE even in other state-discrimination stratigies. Here, we show that the post-measurement information can be used to lock as well as unlock the occurence of NLWE in terms of optimal nambiguous discrimination. Our results can provide a useful application for hiding or sharing information based on non-orthogonal separable states.

•Dec 8, 2021•0 citations

State Discrimination With Post-Measurement Information

Manuel A. Ballester, Stephanie Wehner, Andreas Winter

We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs), you may perform any measurement, but then store at mostqqubits of quantum information, and an unlimited amount of classical information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits, and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also give an example where the extra information does not give any advantage at all.

arXiv:quant-ph/0608014•IEEE Transactions on Information Theory•Aug 27, 2008•42 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
A set of pairwise non-orthogonal quantum states cannot be perfectly discriminated, and this remains true even when one bit of classical partial information is available prior to the measurement. Contrary to the usual intuition that earlier information is at least as valuable as later information, we show that the same bit can be more useful when it arrives after the measurement. We present a framework for state discrimination in which the sender provides classical information in response to a request from the receiver, which we refer to as a query. In some cases, pairwise non-orthogonal states can be perfectly discriminated when the query is allowed to depend on the measurement outcome. We give a general method for finding the optimal strategy in this setting, which turns out to be the standard minimum-error discrimination problem for an auxiliary ensemble.
The paper studies state discrimination assisted by one truthful binary answer from the sender, comparing queries made before measurement, fixed queries answered afterward, and post-measurement queries chosen adaptively from the measurement outcome. The distinction is that adaptivity changes which classical information is requested, rather than merely delaying the same information.
For an ensemble {qx,ρx}x=1n\{q_x,\rho_x\}_{x=1}^n{qx​,ρx​}x=1n​, the optimal adaptive strategy is reduced to minimum-error discrimination of an auxiliary ensemble containing every pairwise mixture ρ(x,y)=(qxρx+qyρy)/(qx+qy)\rho_{(x,y)}=(q_x\rho_x+q_y\rho_y)/(q_x+q_y)ρ(x,y)​=(qx​ρx​+qy​ρy​)/(qx​+qy​), with prior (qx+qy)/(n−1)(q_x+q_y)/(n-1)(qx​+qy​)/(n−1). The optimal success probabilities satisfy Padaptive=(n−1)PauxP_{\mathrm{adaptive}}=(n-1)P_{\mathrm{aux}}Padaptive​=(n−1)Paux​. The proof groups measurement outcomes by their two most likely labels; a subsequent binary query separates those labels.
Uniform trine qubit states illustrate perfect adaptive discrimination: an antidistinguishing measurement excludes one state, and the answer identifies the remaining candidate. Any pre-measurement query instead achieves only (4+3)/6≈0.955(4+\sqrt{3})/6\approx0.955(4+3​)/6≈0.955. Lifted trines retain a strict adaptive advantage without perfect discrimination. Further constructions give perfect adaptive discrimination of d+1d+1d+1 pairwise nonorthogonal states in dimension ddd, and of ⌊3d/2⌋\lfloor3d/2\rfloor⌊3d/2⌋ states using orthogonal blocks. The latter exceeds the stated outcome-independent bound n≤d+1n\le d+1n≤d+1 for d>3d>3d>3. An operator-norm bound and explicit optimal measurements establish these constructions; a separate argument proves n≤d+1n\le d+1n≤d+1 for d≤3d\le3d≤3.
The maximal achievable number in general dimension remains open, as does a characterization of ensembles benefiting from adaptivity. Tetrahedral and lifted-BB84 qubit examples favor pre-measurement queries; whether any ensemble of at least four qubit states exhibits an adaptive advantage is unresolved.
Abstract The discrimination of quantum states is a central problem in quantum information science and technology. Meanwhile, partial post-selection has emerged as a valuable tool for quantum state engineering. In this work, we bring these two areas together and ask whether partial measurements can enhance the discrimination performance between two unknown and non-orthogonal pure states. Our framework is general: the two unknown states interact with the same environment—set in a pure state—via an arbitrary unitary transformation. A measurement is then performed on one of the output modes (i.e. a partial measurement), modeled by an arbitrary positive operator-valued measure (POVM). We then allow classical communication to inform the unmeasured mode of the outcome of the partial measurement, which is subsequently measured by a POVM that is optimal in the sense that the discrimination probability of error is minimized. The two POVMs act locally and classical information is exchanged between the two modes, representing a single-round (feed-forward) form of local operations with classical communication. Under these considerations, we first show that, as expected, the minimum error probability, averaged over all possible conditional states, cannot be reduced below the minimum error probability of discriminating the original input states. Then, we devise a generic setup produces specific examples where the conditional discrimination can achieve strictly lower error probabilities than the original optimal measurement, illustrating that while post-selection does not improve the average performance, it can enable better discrimination in certain post-selected ensembles.
We discuss the following variant of the standard minimum error state discrimination problem: Alice picks the state she sends to Bob among one of several disjoint state ensembles, and she communicates him the chosen ensemble only at a later time. Two different scenarios then arise: either Bob is allowed to arrange his measurement setup after Alice has announced him the chosen ensemble, or he is forced to perform the measurement before Alice's announcement. In the latter case, he can only postprocess his measurement outcome when Alice's extra information becomes available. We compare the optimal guessing probabilities in the two scenarios, and we prove that they are the same if and only if there exist compatible (i.e., jointly measurable) optimal measurements for all of Alice's state ensembles. When this is the case, postprocessing any of the corresponding joint measurements is Bob's optimal strategy in the postmeasurement information scenario. Furthermore, we establish a connection between discrimination with postmeasurement information and the standard state discrimination. By means of this connection and exploiting the presence of symmetries, we are able to compute the various guessing probabilities in many concrete examples.
Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.
Abstract The phenomenon of nonlocality without entanglement(NLWE) arises in discriminating multi-party quantum separable states. Recently, it has been found that the post-measurement information about the prepared subensemble can lock or unlock NLWE in minimum-error discrimination of non-orthogonal separable states. Thus it is natrual to ask whether the availability of the post-measurement information can influence on the occurrence of NLWE even in other state-discrimination stratigies. Here, we show that the post-measurement information can be used to lock as well as unlock the occurence of NLWE in terms of optimal nambiguous discrimination. Our results can provide a useful application for hiding or sharing information based on non-orthogonal separable states.
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs), you may perform any measurement, but then store at mostqqubits of quantum information, and an unlimited amount of classical information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits, and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also give an example where the extra information does not give any advantage at all.
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.