Discriminating quantum states: the multiple Chernoff distance

From MaRDI portal
Revision as of 02:21, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:309733

DOI10.1214/16-AOS1436zbMATH Open1397.62611arXiv1508.06624OpenAlexW1929126829MaRDI QIDQ309733FDOQ309733

Ke Li

Publication date: 7 September 2016

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: We consider the problem of testing multiple quantum hypotheses ho1otimesn,ldots,horotimesn, where an arbitrary prior distribution is given and each of the r hypotheses is n copies of a quantum state. It is known that the average error probability Pe decays exponentially to zero, that is, Pe=expxin+o(n). However, this error exponent xi is generally unknown, except for the case that r=2. In this paper, we solve the long-standing open problem of identifying the above error exponent, by proving Nussbaum and Szkol a's conjecture that xi=minieqjC(hoi,hoj). The right-hand side of this equality is called the multiple quantum Chernoff distance, and C(hoi,hoj):=max0leqsleq1logoperatornameTrhoishoj1s has been previously identified as the optimal error exponent for testing two hypotheses, hoiotimesn versus hojotimesn. The main ingredient of our proof is a new upper bound for the average error probability, for testing an ensemble of finite-dimensional, but otherwise general, quantum states. This upper bound, up to a states-dependent factor, matches the multiple-state generalization of Nussbaum and Szkol a's lower bound. Specialized to the case r=2, we give an alternative proof to the achievability of the binary-hypothesis Chernoff distance, which was originally proved by Audenaert et al.


Full work available at URL: https://arxiv.org/abs/1508.06624





Cites Work


Cited In (12)






This page was built for publication: Discriminating quantum states: the multiple Chernoff distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309733)