Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements
Abstract
Recall the classical hypothesis testing setting with two sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p ∈ P or from a distribution q ∈ Q and wants to decide from which set the points were sampled. It is known that the optimal exponential rate at which errors decrease can be achieved by a simple maximum-likelihood ratio test which does not depend on p or q, but only on the sets P and Q . We consider an adaptive generalization of this model where the choice of p ∈ P and q ∈ Q can change in each sample in some way that depends arbitrarily on the previous samples. In other words, in the kth round, an adversary, having observed all the previous samples in rounds 1,…,k−1 , chooses p_k ∈ P and q_k ∈ Q , with the goal of confusing the hypothesis test. We prove that even in this case, the optimal exponential error rate can be achieved by a simple maximum-likelihood test that depends only on P and Q. We then show that the adversarial model has applications in hypothesis testing for quantum states using restricted measurements. For example, it can be used to study the problem of distinguishing entangled states from the set of all separable states using only measurements that can be implemented with local operations and classical communication (LOCC). The basic idea is that in our setup, the deleterious effects of entanglement can be simulated by an adaptive classical adversary. We prove a quantum Stein's Lemma in this setting: In many circumstances, the optimal hypothesis testing rate is equal to an appropriate notion of quantum relative entropy between two states. In particular, our arguments yield an alternate proof of Li and Winter's recent strengthening of strong subadditivity for von Neumann entropy.
Additional Information
© 2020 IEEE. Manuscript received March 11, 2019; revised December 22, 2019; accepted January 20, 2020. Date of publication March 10, 2020; date of current version July 14, 2020. The work of Fernando G. S. L. Brandão was supported by the Engineering and Physical Sciences Research Council (EPSRC). The work of Aram W. Harrow was supported in part by the NSF under Grant CCF-1111382, Grant CCF-1452616, Grant CCF-1729369, and Grant PHY-1818914 and in part by the Army Research Office (ARO) under Contract W911NF-12-1-0486. The work of James R. Lee was supported by the NSF under Grant CCF-1217256 and Grant CCF-0905626. This article was presented at the 5th Conference on Innovations in Theoretical Computer Science (ITCS 2014).Attached Files
Submitted - 1308.6702.pdf
Files
Name | Size | Download all |
---|---|---|
md5:4dbe8cc91f9ddcf8e2254553f52d5a31
|
613.8 kB | Preview Download |
Additional details
- Eprint ID
- 104652
- Resolver ID
- CaltechAUTHORS:20200730-074100066
- Engineering and Physical Sciences Research Council (EPSRC)
- NSF
- CCF-1111382
- NSF
- CCF-1452616
- NSF
- CCF-1729369
- NSF
- PHY-1818914
- Army Research Office (ARO)
- W911NF-12-1-0486
- NSF
- CCF-1217256
- NSF
- CCF-0905626
- Created
-
2020-07-30Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field