Under the unitary evolutions it is always possible to distinguish different Hamiltonians with zero-error probability within a finite time. At the presence of noises, however, the error probability does not always go to zero within a finite time. In this article, we give a necessary and sufficient condition for Markovian dynamics to achieve zero-error quantum hypothesis testing in a finite time. We show that when the condition fails, the maximal fidelity of the output states under two different Hamiltonians, aided with arbitrary control operations, is always lower bounded by an exponential function, which remains positive at any finite time; zero-error quantum hypothesis testing thus cannot be achieved within any finite time. However, when the condition holds, quantum error corrections can be used to correct the noises and partially maintain the coherent evolutions, zero-error quantum hypothesis testing can then be achieved within a finite time.
Under the unitary evolutions it is always possible to distinguish different Hamiltonians with zero-error probability within a finite time. At the presence of noises, however, the error probability does not always go to zero within a finite time. In this article, we give a necessary and sufficient condition for Markovian dynamics to achieve zero-error quantum hypothesis testing in a finite time. We show that when the condition fails, the maximal fidelity of the output states under two different Hamiltonians, aided with arbitrary control operations, is always lower bounded by an exponential function, which remains positive at any finite time; zero-error quantum hypothesis testing thus cannot be achieved within any finite time. However, when the condition holds, quantum error corrections can be used to correct the noises and partially maintain the coherent evolutions, zero-error quantum hypothesis testing can then be achieved within a finite time.
We characterize the exact error-exponent trade-off in binary quantum hypothesis testing with a rejection option for faithful states on a finite-dimensional Hilbert space. The probabilities of rejection under the two hypotheses are required to vanish exponentially, with exponents at least K and L. We show that a quadruple (a,b,K,L) of positive error and rejection exponents is achievable if and only if it satisfies three single-letter conditions: two conditions involve Petz--Rényi quantities and coincide with the converse bound conjectured to be tight by Ji and Regula; the third involves the α--z Rényi quantities on the triangle max{α,1−α}≤z≤1. The proof combines a sector decomposition inside Schur--Weyl blocks, an explicit one-shot measurement construction, and an exact minimax argument.
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the error probability tends to zero. This leads to the identification of the quantum generalisation of the classical Chernoff distance, which is the corresponding quantity in classical symmetric hypothesis testing. The proof relies on two new techniques introduced by the authors, which are also well suited to tackle the corresponding problem in asymmetric hypothesis testing, yielding the quantum generalisation of the classical Hoeffding bound. This has been done by Hayashi and Nagaoka for the special case where the states have full support. The goal of this paper is to present the proofs of these results in a unified way and in full generality, allowing hypothesis states with different supports. From the quantum Hoeffding bound, we then easily derive quantum Stein’s Lemma and quantum Sanov’s theorem. We give an in-depth treatment of the properties of the quantum Chernoff distance, and argue that it is a natural distance measure on the set of density operators, with a clear operational meaning.
The fundamental task of quantum hypothesis testing, which consists in discriminating quantum objects, has been extensively studied for quantum states and channels. Here, we investigate the fundamental limits of discriminating an arbitrary pair of quantum Markovian dynamics generated by Lindbladians, focusing on the roles of total exposure time and temporal resolution. We allow adaptive choices of evolution durations and arbitrary instantaneous controls between them. We characterise the optimal type-II error exponent (Stein exponent) as the largest instantaneous increase of quantum relative entropy, and give an algebraic criterion for its finiteness in terms of the Lindbladians. Remarkably, an infinite exponent is equivalent to a vanishing type-II error probability at sufficiently large finite total time, for every positive type-I tolerance. While some dynamics admit a finite protocol with zero type-II error, others require increasingly fine temporal control. For the latter, the error vanishes as the minimum allowed evolution duration, or resolution time, tends to zero at fixed sufficiently large total time, but remains bounded away from zero at every fixed positive resolution time. We achieve this using quantum Zeno protocols, establishing temporal resolution as a resource for discrimination. When the null hypothesis is the identity semigroup, an infinite asymptotic error exponent has a stronger consequence: at a fixed finite total exposure time, the type-II error can be made arbitrarily small while keeping the type-I error exactly zero. This is impossible in the corresponding classical setting. Discriminating the identity semigroup from generalised amplitude damping on a qubit provides examples of all three regimes: a finite asymptotic error exponent, zero type-II error attainable at positive resolution time, and vanishing type-II error requiring the resolution time to tend to zero.
Previous studies in quantum information have recognized that specific types of noise can encode information in certain applications. However, the role of noise in quantum hypothesis testing, traditionally assumed to undermine performance, has not been thoroughly explored. Our study provides sufficient conditions for general noisy dynamics to surpass noiseless (unitary) dynamics within certain time interval. We then design and experimentally implement a noise-assisted quantum hypothesis testing protocol on ultralow-field nuclear magnetic resonance systems, which demonstrates that the success probability under certain noisy dynamics can indeed surpass the ceiling set by unitary evolution. Moreover, we show that in cases where noise initially hampers performance, strategic application of coherent controls on the system can transform those previously detrimental noises into advantageous ones. Our results, both theoretical and experimental, demonstrates the potential to leveraging noise in quantum hypothesis testing, which pushes the boundaries of quantum hypothesis testing and general quantum information processing. In quantum science, quantum hypothesis testing (QHT) is used to determine the model of a given quantum system, but normally the presence of inherent quantum noise hampers perfect hypothesis testing. The authors theoretically and experimentally explore the potential of leveraging noise in quantum hypothesis testing (QHT) to surpass the success probabilities achievable under noiseless dynamics.
This expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional Hilbert spaces. Optimal measurement strategy for testing binary quantum hypotheses, which result in minimum error probability, is discussed. Collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario, with various upper and lower bounds on error probability, are outlined. A brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is given.
Abstract Quantum hypothesis testing plays a pivotal role in quantum technologies, making decisions or drawing conclusions about quantum systems based on observed data. Recently, quantum control techniques have been successfully applied to quantum hypothesis testing, enabling the reduction of error probabilities in the task of distinguishing magnetic fields in presence of environmental noise. In real-world physical systems, such control is prone to various channels of inaccuracies. Therefore improving the robustness of quantum control in the context of quantum hypothesis testing is crucial. In this work, we utilize optimal control methods to compare scenarios with and without accounting for the effects of signal frequency inaccuracies. For parallel dephasing and spontaneous emission, the optimal control inherently demonstrates a certain level of robustness, while in the case of transverse dephasing with an imperfect signal, it may result in a higher error probability compared to the uncontrolled scheme. To overcome these limitations, we introduce a robust control approach optimized for a range of signal noise, demonstrating superior robustness beyond the predefined tolerance window. On average, both the optimal control and robust control show improvements over the uncontrolled schemes for various dephasing or decay rates, with the robust control yielding the lowest error probability.