Finite blocklength and moderate deviation analysis of hypothesis testing of correlated quantum states and application to classical-quantum channels with memory
Cambyse Rouze, Nilanjana Datta

TL;DR
This paper develops finite blocklength and moderate deviation bounds for quantum hypothesis testing of correlated states, improving existing bounds and applying results to classical-quantum channels with memory.
Contribution
It introduces tighter finite blocklength bounds for quantum hypothesis testing of correlated states and extends moderate deviation analysis to non-i.i.d. quantum sequences.
Findings
Tighter bounds on type II errors for quantum hypothesis testing.
Finite blocklength bounds for correlated quantum states.
Application to classical-quantum channels with memory.
Abstract
Martingale concentration inequalities constitute a powerful mathematical tool in the analysis of problems in a wide variety of fields ranging from probability and statistics to information theory and machine learning. Here we apply techniques borrowed from this field to quantum hypothesis testing, which is the problem of discriminating quantum states belonging to two different sequences and . We obtain upper bounds on the finite blocklength type II Stein- and Hoeffding errors, which, for i.i.d. states, are in general tighter than the corresponding bounds obtained by Audenaert, Mosonyi and Verstraete [Journal of Mathematical Physics, 53(12), 2012]. We also derive finite blocklength bounds and moderate deviation results for pairs of sequences of correlated states satisfying a (non-homogeneous) factorization property. Examples of such sequences include…
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
TopicsMarkov Chains and Monte Carlo Methods · Random Matrices and Applications · Quantum Information and Cryptography
