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:2111.13568 · Scientific Reports

Training a quantum measurement device to discriminate unknown non-orthogonal quantum states

Daniel Concha, Luís Pereira, L. Zambrano, A. Delgado

Published May 8, 2023• 4 citations
arXivHTMLPDF

Abstract

Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. We demonstrate the training method in the case of minimum-error discrimination strategy and show that it achieves error probabilities very close to the optimal one. In particular, in the case of two unknown pure states, our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the phase flip channel reaching an accurate value of the optimal error probability.

DOI
10.1038/s41598-023-34327-0

Related papers

Optimal Quantum State Discrimination with Fixed Measurements

Maison Clouâtré, Stefano Maranò, Andrea Conti +2 more

Given an unknown quantum state described by one of two possible density operators, the Helstrom bound provides the minimum discrimination error probability (DEP) by optimizing over all possible quantum measurements. However, it is unrealistic to implement arbitrary measurements in practice due to physical limitations of measurement apparatuses. This paper considers a quantum state discrimination scenario where a fixed measurement apparatus is available. In this setting, we advocate the use of quantum pre-processing (QPP) to realize effectively different measurements from that of the fixed apparatus. Applying optimal QPP prior to measurement with the fixed apparatus allows one to minimize the DEP. This paper derives the minimum DEP, determines the QPP required to achieve it, and provides necessary and sufficient conditions for this minimum DEP with optimal QPP to coincide with the Helstrom bound.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

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

Hanwool Lee, Teiko Heinosaari

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.

quant-pharXiv:2608.01167•Aug 4, 2026•0 citations

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

Quantum learning: asymptotically optimal classification of qubit states

Mădălin Guţǎ, Wojciech Kotłowski

Pattern recognition is a central topic in learning theory, with numerous applications such as voice and text recognition, image analysis and computer diagnosis. The statistical setup in classification is the following: we are given an i.i.d. training set ( X 1 , Y 1 ), ... , ( X n , Y n ), where X i represents a feature and Y i ∊{0, 1} is a label attached to that feature. The underlying joint distribution of ( X , Y ) is unknown, but we can learn about it from the training set, and we aim at devising low error classifiers f: X → Y used to predict the label of new incoming features. In this paper, we solve a quantum analogue of this problem, namely the classification of two arbitrary unknown mixed qubit states. Given a number of 'training' copies from each of the states, we would like to 'learn' about them by performing a measurement on the training set. The outcome is then used to design measurements for the classification of future systems with unknown labels. We found the asymptotically optimal classification strategy and show that typically it performs strictly better than a plug-in strategy, which consists of estimating the states separately and then discriminating between them using the Helstrom measurement. The figure of merit is given by the excess risk equal to the difference between the probability of error and the probability of error of the optimal measurement for known states. We show that the excess risk scales as n −1 and compute the exact constant of the rate.

arXiv:1004.2468•New Journal of Physics•Dec 23, 2010•54 citations

Quantum Detection Over Quantum Channels With Uncertainty

Jeremy Johnston, Xiaodong Wang

In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution under two design scenarios, joint design and two-stage design. We consider various design objectives, including the detection probability and mutual information, with the latter leading to a hybrid scheme consisting of von Neumann measurement and classical hypothesis test. Furthermore, we introduce a channel discrimination scheme which leverages the isometric extension of a quantum channel which increases the channel distinguishability, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. In addition, we apply amortized optimization to train a recurrent neural network in order to improve the convergence speed of the proposed algorithms. Finally, we apply the proposed algorithms to multi-copy channel discrimination as well as a novel joint channel-state discrimination scenario.

IEEE Transactions on Quantum Engineering•Oct 27, 2025•0 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
Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. We demonstrate the training method in the case of minimum-error discrimination strategy and show that it achieves error probabilities very close to the optimal one. In particular, in the case of two unknown pure states, our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the phase flip channel reaching an accurate value of the optimal error probability.
Given an unknown quantum state described by one of two possible density operators, the Helstrom bound provides the minimum discrimination error probability (DEP) by optimizing over all possible quantum measurements. However, it is unrealistic to implement arbitrary measurements in practice due to physical limitations of measurement apparatuses. This paper considers a quantum state discrimination scenario where a fixed measurement apparatus is available. In this setting, we advocate the use of quantum pre-processing (QPP) to realize effectively different measurements from that of the fixed apparatus. Applying optimal QPP prior to measurement with the fixed apparatus allows one to minimize the DEP. This paper derives the minimum DEP, determines the QPP required to achieve it, and provides necessary and sufficient conditions for this minimum DEP with optimal QPP to coincide with the Helstrom bound.
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.
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.
Pattern recognition is a central topic in learning theory, with numerous applications such as voice and text recognition, image analysis and computer diagnosis. The statistical setup in classification is the following: we are given an i.i.d. training set ( X 1 , Y 1 ), ... , ( X n , Y n ), where X i represents a feature and Y i ∊{0, 1} is a label attached to that feature. The underlying joint distribution of ( X , Y ) is unknown, but we can learn about it from the training set, and we aim at devising low error classifiers f: X → Y used to predict the label of new incoming features. In this paper, we solve a quantum analogue of this problem, namely the classification of two arbitrary unknown mixed qubit states. Given a number of 'training' copies from each of the states, we would like to 'learn' about them by performing a measurement on the training set. The outcome is then used to design measurements for the classification of future systems with unknown labels. We found the asymptotically optimal classification strategy and show that typically it performs strictly better than a plug-in strategy, which consists of estimating the states separately and then discriminating between them using the Helstrom measurement. The figure of merit is given by the excess risk equal to the difference between the probability of error and the probability of error of the optimal measurement for known states. We show that the excess risk scales as n −1 and compute the exact constant of the rate.
In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution under two design scenarios, joint design and two-stage design. We consider various design objectives, including the detection probability and mutual information, with the latter leading to a hybrid scheme consisting of von Neumann measurement and classical hypothesis test. Furthermore, we introduce a channel discrimination scheme which leverages the isometric extension of a quantum channel which increases the channel distinguishability, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. In addition, we apply amortized optimization to train a recurrent neural network in order to improve the convergence speed of the proposed algorithms. Finally, we apply the proposed algorithms to multi-copy channel discrimination as well as a novel joint channel-state discrimination scenario.
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.