Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Super-exponential distinguishability of correlated quantum states (2203.16511v2)

Published 30 Mar 2022 in quant-ph, cs.IT, math-ph, math.IT, and math.MP

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 behaviour 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}$ 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.

Summary

We haven't generated a summary for this paper yet.