Exponential error rates in multiple state discrimination on a quantum spin chain
Michael Nussbaum, Arleta Szkola

TL;DR
This paper investigates the exponential decay of error probabilities in quantum state discrimination on spin chains, establishing bounds based on quantum Chernoff distances and constructing optimal tests.
Contribution
It introduces the concept of mean generalized quantum Chernoff distance for multiple quantum states and proves the existence of tests achieving near-optimal error exponents.
Findings
Asymptotic error bounds are determined by the mean quantum Chernoff distances.
Constructive tests are shown to achieve near-optimal exponential error decay.
Results apply to shift-invariant states, including i.i.d. states.
Abstract
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 outputs of generalized measurements performed on local states on blocks of finite size. We assume 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 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 fulfiled by shift-invariant product states (i.i.d. states).…
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.
