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.
AI Summary
The paper studies binary discrimination of arbitrary finite-dimensional Lindblad generators with adaptive evolution durations, noiseless ancillas and instantaneous controls. It treats total exposure time $t$ and minimum interval $s_{\min}$ as separate resources, minimising type-II error subject to type-I tolerance $\epsilon$.
The Stein exponent equals the supremum instantaneous increase of quantum relative entropy over potentially different inputs and arbitrary ancillas. It is finite exactly when every null-hypothesis jump operator and the drift difference $G_1-G_2$ belong to $\operatorname{span}\{I,L_j^{(2)}\}$. Otherwise, for every $\epsilon>0$, the infimum type-II error vanishes at sufficiently large finite exposure time. Choi-support inclusion distinguishes whether zero error is attained by a finite protocol or requires arbitrarily fine control. In the latter case, uniformly for sufficiently large $t$ and small $s_{\min}$, $-\log\beta=\Theta(t[1+\log(s_0/s_{\min})])$, with generator- and tolerance-dependent constants.
For an identity null hypothesis, defining $g=\inf_{C\in\operatorname{span}\{I,L_j\}}\|G-C\|_\infty>0$, the exact threshold is $T_\epsilon=\arccos\sqrt{\epsilon}/g$, including $\epsilon=0$. Identity versus generalised amplitude damping illustrates all three regimes; unequal positive rates give $T_0=2\pi/|\mu_+-\mu_-|$.
Proofs combine channel Stein lemmas and amortised relative entropy, algebraic generator representations, projected Zeno dynamics, and analytic Choi-state bounds; a no-jump angle argument establishes the exact threshold. The model assumes memoryless, time-homogeneous dynamics under interventions. The leading coefficient of the resolution-time law remains open, as does the tradeoff when controls and measurements consume time or introduce errors.
Little sign of AI-generated textAI use disclosedStrong assumptions
AI also assisted with writing, proofreading and improving the exposition.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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.
The paper studies binary discrimination of arbitrary finite-dimensional Lindblad generators with adaptive evolution durations, noiseless ancillas and instantaneous controls. It treats total exposure time t and minimum interval smin as separate resources, minimising type-II error subject to type-I tolerance ϵ.
The Stein exponent equals the supremum instantaneous increase of quantum relative entropy over potentially different inputs and arbitrary ancillas. It is finite exactly when every null-hypothesis jump operator and the drift difference G1−G2 belong to span{I,Lj(2)}. Otherwise, for every ϵ>0, the infimum type-II error vanishes at sufficiently large finite exposure time. Choi-support inclusion distinguishes whether zero error is attained by a finite protocol or requires arbitrarily fine control. In the latter case, uniformly for sufficiently large t and small smin, −logβ=Θ(t[1+log(s0/smin)]), with generator- and tolerance-dependent constants.
For an identity null hypothesis, defining g=infC∈span{I,Lj}∥G−C∥∞>0, the exact threshold is Tϵ=arccosϵ/g, including ϵ=0. Identity versus generalised amplitude damping illustrates all three regimes; unequal positive rates give T0=2π/∣μ+−μ−∣.
Proofs combine channel Stein lemmas and amortised relative entropy, algebraic generator representations, projected Zeno dynamics, and analytic Choi-state bounds; a no-jump angle argument establishes the exact threshold. The model assumes memoryless, time-homogeneous dynamics under interventions. The leading coefficient of the resolution-time law remains open, as does the tradeoff when controls and measurements consume time or introduce errors.
Distinguishability is a central concept in information theory and extends naturally to quantum systems. This work shows that, for any two finite-dimensional memoryless quantum channels, parallel, adaptive and general testing strategies achieve the same Stein exponent at every fixed type-I error tolerance ε∈(0,1), namely the regularized channel relative entropy. When this rate is finite, any larger type-II exponent forces the probability of correctly accepting the null hypothesis to decay exponentially. Thus, adaptivity provides no asymptotic advantage. The key step is proving the continuity of the regularized sandwiched Rényi channel divergence at order one. We also derive the exact strong-converse exponent for general testers.
We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states, establishing their equivalence or quantitative relations. In the error exponent regime, we generalize the quantum Hoeffding bound to stable sequences of convex, compact sets of quantum states, demonstrating that the optimal Type-I error exponent, under an exponential constraint on the Type-II error, is precisely characterized by the regularized quantum Hoeffding divergence between the sets. In the strong converse exponent regime, we establish a general lower bound on the exponent in terms of the regularized quantum Hoeffding anti-divergence, and we prove a matching upper bound when the null hypothesis is a singleton, under additional assumptions. The generality of these results enables applications in various contexts, including (i) refining the generalized quantum Stein’s lemma by [Fang, Fawzi & Fawzi, 2024]; (ii) exhibiting counterexamples to the continuity of the regularized Petz R´enyi divergence and Hoeffding divergence; (iii) obtaining error exponents for adversarial channel discrimination and resource detection problems.
We establish the quantum channel Stein lemma at every fixed type-I error tolerance in (0,1) and prove an exponential strong converse under arbitrary adaptive strategies. For any finite-dimensional channel pair, the optimal type-II exponent equals the regularized channel relative entropy and is attained by parallel strategies. When this divergence is finite, every strictly larger type-II rate forces the probability of accepting the null hypothesis to decay exponentially, uniformly over strategies and quantum memories. The proof rests on a uniform Stinespring approximation: tensor powers of the null dilation are approximated by tensor powers of the alternative dilation after applying an auxiliary linear map to the environment. The operator-norm error is exponentially small under a squared-norm bound at any rate above the regularized relative entropy. We construct the approximation from a weak testing bound by iterative rate reduction and a fixed-block tensor expansion with an exact residual. It implies right continuity at order one of the regularized sandwiched Rényi channel divergence, which yields the adaptive converse through the channel chain rule. We also obtain a sharp hockey-stick threshold and a subchannel smoothing asymptotic equipartition property for fixed and subexponentially vanishing diamond-norm errors.
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.
We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an n-qubit Lindbladian of dynamical strength at most Λ, the algorithm estimates every coefficient to error ε using O(Λ2/ε2) experiments and O(Λ/ε2) total evolution time, with classical running time polynomial in n and Λ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution.
For constant k, our algorithm learns generic k-local Lindbladians of local dynamical strength at most Λloc using O(n2Λloc2/ε2) experiments and O(nΛloc/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on n. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 3-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3.
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.