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:2010.15753 · Physical Review Research

Ultimate limits of approximate unambiguous discrimination

Quntao Zhuang

Published Nov 23, 2020• 3 citations
arXivHTMLPDF

Abstract

Quantum hypothesis testing is an important tool for quantum information processing.Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained.In both scenarios, the testing between quantum states is relatively well understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channels is less understood.Although the ultimate limit of minimum error discrimination between channels has been explored recently, the corresponding limit of unambiguous discrimination is unknown.In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels.In particular, in the channel case, our lower bound of the inconclusive probability holds for arbitrary adaptive sensing protocols.For the special class of "teleportation-covariant" channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.

DOI
10.1103/physrevresearch.2.043276

Related papers

Ultimate Limits for Multiple Quantum Channel Discrimination

Quntao Zhuang, Stefano Pirandola

Quantum hypothesis testing is a central task in the entire field of quantum information theory. Understanding its ultimate limits will give insight into a wide range of quantum protocols and applications, from sensing to communication. Although the limits of hypothesis testing between quantum states have been completely clarified by the pioneering works of Helstrom in the 1970s, the more difficult problem of hypothesis testing with quantum channels, i.e., channel discrimination, is less understood. This is mainly due to the complications coming from the use of input entanglement and the possibility of employing adaptive strategies. In this Letter, we establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries. As an example, we apply our results to the problem of channel position finding, where the goal is to identify the location of a target channel among multiple background channels. In this general setting, we find that the use of entanglement offers a great advantage over strategies without entanglement, with nontrivial implications for data readout, target detection, and quantum spectroscopy.

arXiv:2007.14566•Physical Review Letters•Aug 21, 2020•56 citations

Fundamental limits to quantum channel discrimination

Stefano Pirandola, Riccardo Laurenza, Cosmo Lupo +1 more

Abstract What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.

arXiv:1803.02834•npj Quantum Information•Jun 5, 2019•150 citations

Beyond Hoeffding and Chernoff: Trading conclusiveness for advantages in quantum hypothesis testing

Kaiyuan Ji, Bartosz Regula

The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing protocols that are permitted a probability of producing an inconclusive discrimination outcome, and investigate their performance when this probability is suitably constrained. We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded. This completely circumvents the conventional trade-offs between error exponents in hypothesis testing while incurring only a vanishingly small overhead over conventional approaches. Such improvements over standard state discrimination are robust and can be obtained even when an exponentially vanishing probability of inconclusive outcomes is demanded. Relaxing the constraints on the inconclusive probability can enable even larger advantages, but this comes at a price. We show a 'strong converse' property of this setting: targeting error exponents beyond those achievable with vanishing inconclusiveness necessarily forces the probability of inconclusive outcomes to converge to one. By exactly quantifying the rate of this convergence, we give a complete characterisation of the trade-offs between error exponents and rates of conclusive outcome probabilities. Overall, our results provide a comprehensive asymptotic picture of how the allowance for inconclusive measurement outcomes reshapes optimal quantum hypothesis testing.

arXiv:2510.07601•Oct 8, 2025•6 citations

Minimum-error discrimination of quantum states: New bounds and comparison

Daowen Qiu, Lvjun Li

The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary $m$ quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary $m$ mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if $m=2$, the optimal inconclusive probability of unambiguous discrimination $Q_{U}$ and the minimum-error probability of ambiguous discrimination $Q_{E}$ between arbitrary given $m$ mixed quantum states have the relationship $Q_{U}\geq 2Q_{E}$. In this paper, we show that, however, if $m>2$, the relationship $Q_{U}\geq 2Q_{E}$ may not hold again in general, and there may be no supremum of $Q_{U}/Q_{E}$ for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.

arXiv:0812.2378•Dec 12, 2008•4 citations

Unambiguous discrimination of the change point for quantum channels

Kenji Nakahira

Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where the process consists of a sequence of quantum channels; however, obtaining analytical solutions for quantum process discrimination is generally extremely challenging. In this paper, we propose a method to derive lower and upper bounds on the maximum average success probability in unambiguous discrimination. In particular, when the channels before and after the change are unitary, we show that the maximum average success probability can be analytically expressed in terms of the length of the channel sequence and the discrimination limits for the two channels.

arXiv:2508.06785•Physical Review A•Feb 13, 2026•2 citations

Relation between minimum-error discrimination and optimum unambiguous discrimination

Daowen Qiu, Lvjun Li

In this paper, we investigate the relationship between the minimum-error probability ${Q}_{E}$ of ambiguous discrimination and the optimal inconclusive probability ${Q}_{U}$ of unambiguous discrimination. It is known that for discriminating two states, the inequality ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ has been proved in the literature. The main technical results are as follows: (1) We show that, for discriminating more than two states, ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ may not hold again, but the infimum of ${Q}_{U}/{Q}_{E}$ is $1,$ and there is no supremum of ${Q}_{U}/{Q}_{E}$, which implies that the failure probabilities of the two schemes for discriminating some states may be narrowly or widely gapped. (2) We derive two concrete formulas of the minimum-error probability ${Q}_{E}$ and the optimal inconclusive probability ${Q}_{U}$, respectively, for ambiguous discrimination and unambiguous discrimination among arbitrary $m$ simultaneously diagonalizable mixed quantum states with given prior probabilities. In addition, we show that ${Q}_{E}$ and ${Q}_{U}$ satisfy the relationship that ${Q}_{U}\ensuremath{\geqslant}\frac{m}{m\ensuremath{-}1}{Q}_{E}$.

Physical Review A•Sep 29, 2010•8 citations
Quantum hypothesis testing is an important tool for quantum information processing.Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained.In both scenarios, the testing between quantum states is relatively well understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channels is less understood.Although the ultimate limit of minimum error discrimination between channels has been explored recently, the corresponding limit of unambiguous discrimination is unknown.In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels.In particular, in the channel case, our lower bound of the inconclusive probability holds for arbitrary adaptive sensing protocols.For the special class of "teleportation-covariant" channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.
Quantum hypothesis testing is a central task in the entire field of quantum information theory. Understanding its ultimate limits will give insight into a wide range of quantum protocols and applications, from sensing to communication. Although the limits of hypothesis testing between quantum states have been completely clarified by the pioneering works of Helstrom in the 1970s, the more difficult problem of hypothesis testing with quantum channels, i.e., channel discrimination, is less understood. This is mainly due to the complications coming from the use of input entanglement and the possibility of employing adaptive strategies. In this Letter, we establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries. As an example, we apply our results to the problem of channel position finding, where the goal is to identify the location of a target channel among multiple background channels. In this general setting, we find that the use of entanglement offers a great advantage over strategies without entanglement, with nontrivial implications for data readout, target detection, and quantum spectroscopy.
Abstract What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.
The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing protocols that are permitted a probability of producing an inconclusive discrimination outcome, and investigate their performance when this probability is suitably constrained. We show that even by allowing an arbitrarily small probability of inconclusiveness, the limits imposed by the quantum Hoeffding and Chernoff bounds can be significantly exceeded. This completely circumvents the conventional trade-offs between error exponents in hypothesis testing while incurring only a vanishingly small overhead over conventional approaches. Such improvements over standard state discrimination are robust and can be obtained even when an exponentially vanishing probability of inconclusive outcomes is demanded. Relaxing the constraints on the inconclusive probability can enable even larger advantages, but this comes at a price. We show a 'strong converse' property of this setting: targeting error exponents beyond those achievable with vanishing inconclusiveness necessarily forces the probability of inconclusive outcomes to converge to one. By exactly quantifying the rate of this convergence, we give a complete characterisation of the trade-offs between error exponents and rates of conclusive outcome probabilities. Overall, our results provide a comprehensive asymptotic picture of how the allowance for inconclusive measurement outcomes reshapes optimal quantum hypothesis testing.
The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary mmm quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary mmm mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if m=2m=2m=2, the optimal inconclusive probability of unambiguous discrimination QUQ_{U}QU​ and the minimum-error probability of ambiguous discrimination QEQ_{E}QE​ between arbitrary given mmm mixed quantum states have the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​. In this paper, we show that, however, if m>2m>2m>2, the relationship QU≥2QEQ_{U}\geq 2Q_{E}QU​≥2QE​ may not hold again in general, and there may be no supremum of QU/QEQ_{U}/Q_{E}QU​/QE​ for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.
Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where the process consists of a sequence of quantum channels; however, obtaining analytical solutions for quantum process discrimination is generally extremely challenging. In this paper, we propose a method to derive lower and upper bounds on the maximum average success probability in unambiguous discrimination. In particular, when the channels before and after the change are unitary, we show that the maximum average success probability can be analytically expressed in terms of the length of the channel sequence and the discrimination limits for the two channels.
In this paper, we investigate the relationship between the minimum-error probability QE{Q}_{E}QE​ of ambiguous discrimination and the optimal inconclusive probability QU{Q}_{U}QU​ of unambiguous discrimination. It is known that for discriminating two states, the inequality ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ has been proved in the literature. The main technical results are as follows: (1) We show that, for discriminating more than two states, ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ may not hold again, but the infimum of QU/QE{Q}_{U}/{Q}_{E}QU​/QE​ is 1,1,1, and there is no supremum of QU/QE{Q}_{U}/{Q}_{E}QU​/QE​, which implies that the failure probabilities of the two schemes for discriminating some states may be narrowly or widely gapped. (2) We derive two concrete formulas of the minimum-error probability QE{Q}_{E}QE​ and the optimal inconclusive probability QU{Q}_{U}QU​, respectively, for ambiguous discrimination and unambiguous discrimination among arbitrary mmm simultaneously diagonalizable mixed quantum states with given prior probabilities. In addition, we show that QE{Q}_{E}QE​ and QU{Q}_{U}QU​ satisfy the relationship that ${Q}_{U}\ensuremath{\geqslant}\frac{m}{m\ensuremath{-}1}{Q}_{E}$.