Super-exponential distinguishability of correlated quantum states
Gergely Bunth, G\'abor Mar\'oti, Mil\'an Mosonyi, Zolt\'an Zimbor\'as

TL;DR
This paper demonstrates that correlated quantum states can be distinguished with super-exponential accuracy, surpassing classical exponential bounds, especially in the context of infinite spin chains and quantum hypothesis testing.
Contribution
It introduces a novel phenomenon where correlations enable super-exponential error decay in quantum state discrimination, unlike the classical orthogonal case.
Findings
Super-exponential decay of error probabilities in correlated quantum states.
Application to ground states of the XX model with different magnetic fields.
Super-exponential distinguishability in quantum hypothesis testing.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
