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:0707.2020 · Journal of Mathematical Physics

Error exponents in hypothesis testing for correlated states on a spin chain

Fumio Hiai, Milán Mosonyi, Tomohiro Ogawa

Published Mar 1, 2008• 46 citations
arXivHTMLPDF

Abstract

We study various error exponents in a binary hypothesis testing problem and extend recent results on the quantum Chernoff and Hoeffding bounds for product states to a setting when both the null hypothesis and the alternative hypothesis can be correlated states on a spin chain. Our results apply to states satisfying a certain factorization property; typical examples are the global Gibbs states of translation-invariant finite-range interactions as well as certain finitely correlated states.

DOI
10.1063/1.2872276

Related papers

Quantum Hoeffding bound for states on a spin chain

Fumio Hiai, Milán Mosonyi, Tomohiro Ogawa

We extend recent results on the quantum Hoeffding bound from the i.i.d. setting to a setting when both the null-hypothesis and the counter-hypothesis can be correlated states of a spin chain. The key property in the extension is a certain factorization property of the states. Typical examples with this property are the global Gibbs states of translationinvariant finite-range interactions. 1

•Jul 13, 2007•0 citations

Two Approaches to Obtain the Strong Converse Exponent of Quantum Hypothesis Testing for General Sequences of Quantum States

Milán Mosonyi, Tomohiro Ogawa

We present two general approaches to obtain the strong converse exponent of simple quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized Rényi α-divergence in the parameter α; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding antidivergence, which in turn is obtained from the regularized Rényi divergences of the two states.

arXiv:1407.3567•IEEE Transactions on Information Theory•Oct 14, 2015•21 citations

The strong converse rate of quantum hypothesis testing for correlated quantum states.

Milán Mosonyi, Tomohiro Ogawa

We present two general approaches to obtain the strong converse rate of quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized R\'enyi $\alpha$-divergence in the parameter $\alpha$; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding anti-divergence, which in turn is obtained from the regularized R\'enyi divergences of the two states.

•Jul 14, 2014•4 citations

Error Exponents of Quantum State Discrimination With Composite Correlated Hypotheses

Kun Fang, Masahito Hayashi

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.

arXiv:2508.12901•IEEE International Symposium on Information Theory (ISIT)•Apr 16, 2026•1 citation

Super-exponential distinguishability of correlated quantum states

Gergely Bunth, Gábor Maróti, Milán Mosonyi +1 more

Abstract In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of achievable exponent pairs is characterized by the quantum Hoeffding bound theorem. A super-exponential decrease for both types of error probabilities is only possible in the trivial case when the two states are orthogonal and hence can be perfectly distinguished using only a single copy of the system. In this paper, we show that a qualitatively different behavior can occur when there is correlation between the samples. Namely, we use gauge-invariant and translation-invariant quasi-free states on the algebra of the canonical anti-commutation relations to exhibit pairs of states on an infinite spin chain with the properties that (a) all finite-size restrictions of the states have invertible density operators and (b) the type I and the type II error probabilities both decrease to zero at least with the speed $$e^{-nc\log n}$$ e - n c log n with some positive constant c, i.e., with a super-exponential speed in the sample size n. Particular examples of such states include the ground states of the XX model corresponding to different transverse magnetic fields. In fact, we prove our result in the setting of binary composite hypothesis testing, and hence, it can be applied to prove super-exponential distinguishability of the hypotheses that the transverse magnetic field is above a certain threshold vs. that it is below a strictly lower value.

arXiv:2203.16511•Letters in Mathematical Physics•Jan 11, 2023•0 citations

Exponential error rates in multiple state discrimination on a quantum spin chain

Michael Nussbaum, Arleta Szkoła

We consider decision problems on finite sets of hypotheses represented by pairwise different shift-invariant states on a quantum spin chain. The decision in favor of one of the hypotheses is based on outcomes of generalized measurements performed on local states on blocks of finite size. We assume the existence of the mean quantum Chernoff distances of any pair of states from the given set and refer to the minimum of them as the mean generalized quantum Chernoff distance. We establish that this minimum specifies an asymptotic bound on the exponential rate of decay of the averaged probability of rejecting the true state in increasing block size, if the mean quantum Chernoff distance of any pair of the hypothetic states is achievable as an asymptotic error exponent in the corresponding binary problem. This assumption is, in particular, fulfilled by shift-invariant product states (independent and identically distributed states). Further, we provide a constructive proof for the existence of a sequence of quantum tests in increasing block length with an error exponent which equals, up to a factor, the mean generalized quantum Chernoff distance. The factor depends on the configuration of the hypothetic states with respect to the binary quantum Chernoff distances. It can be arbitrary close to 1 and is never less than 1/m for m being the number of different pairs of states.

arXiv:1001.2651•Journal of Mathematical Physics•Jul 1, 2010•10 citations
We study various error exponents in a binary hypothesis testing problem and extend recent results on the quantum Chernoff and Hoeffding bounds for product states to a setting when both the null hypothesis and the alternative hypothesis can be correlated states on a spin chain. Our results apply to states satisfying a certain factorization property; typical examples are the global Gibbs states of translation-invariant finite-range interactions as well as certain finitely correlated states.
We present two general approaches to obtain the strong converse exponent of simple quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized Rényi α-divergence in the parameter α; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding antidivergence, which in turn is obtained from the regularized Rényi divergences of the two states.
We present two general approaches to obtain the strong converse rate of quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized R\'enyi α\alphaα-divergence in the parameter α\alphaα; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding anti-divergence, which in turn is obtained from the regularized R\'enyi divergences of the two states.
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.
Abstract In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of achievable exponent pairs is characterized by the quantum Hoeffding bound theorem. A super-exponential decrease for both types of error probabilities is only possible in the trivial case when the two states are orthogonal and hence can be perfectly distinguished using only a single copy of the system. In this paper, we show that a qualitatively different behavior can occur when there is correlation between the samples. Namely, we use gauge-invariant and translation-invariant quasi-free states on the algebra of the canonical anti-commutation relations to exhibit pairs of states on an infinite spin chain with the properties that (a) all finite-size restrictions of the states have invertible density operators and (b) the type I and the type II error probabilities both decrease to zero at least with the speed e−nclog⁡ne^{-nc\log n}e−nclogn e - n c log n with some positive constant c, i.e., with a super-exponential speed in the sample size n. Particular examples of such states include the ground states of the XX model corresponding to different transverse magnetic fields. In fact, we prove our result in the setting of binary composite hypothesis testing, and hence, it can be applied to prove super-exponential distinguishability of the hypotheses that the transverse magnetic field is above a certain threshold vs. that it is below a strictly lower value.
We consider decision problems on finite sets of hypotheses represented by pairwise different shift-invariant states on a quantum spin chain. The decision in favor of one of the hypotheses is based on outcomes of generalized measurements performed on local states on blocks of finite size. We assume the existence of the mean quantum Chernoff distances of any pair of states from the given set and refer to the minimum of them as the mean generalized quantum Chernoff distance. We establish that this minimum specifies an asymptotic bound on the exponential rate of decay of the averaged probability of rejecting the true state in increasing block size, if the mean quantum Chernoff distance of any pair of the hypothetic states is achievable as an asymptotic error exponent in the corresponding binary problem. This assumption is, in particular, fulfilled by shift-invariant product states (independent and identically distributed states). Further, we provide a constructive proof for the existence of a sequence of quantum tests in increasing block length with an error exponent which equals, up to a factor, the mean generalized quantum Chernoff distance. The factor depends on the configuration of the hypothetic states with respect to the binary quantum Chernoff distances. It can be arbitrary close to 1 and is never less than 1/m for m being the number of different pairs of states.