Adversarial hypothesis testing and a quantum Stein's Lemma for restricted measurements

Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in 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 in P and q in Q can change in each sample in some way that depends arbitrarily on the previous samples. In other words, in the k'th round, an adversary, having observed all the previous samples in rounds 1,...,k-1, chooses p_k in P and q_k in 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 quantum relative entropy.

[1]  H. Chernoff A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  M. Sion On general minimax theorems , 1958 .

[3]  W. Hoeffding Asymptotically Optimal Tests for Multinomial Distributions , 1965 .

[4]  E. Lieb,et al.  Proof of the strong subadditivity of quantum‐mechanical entropy , 1973 .

[5]  Edward C. Posner,et al.  Random coding strategies for minimum entropy , 1975, IEEE Trans. Inf. Theory.

[6]  M. Donald On the relative entropy , 1986 .

[7]  R. Werner,et al.  Quantum Statistical Mechanics of General Mean Field Systems , 1989 .

[8]  F. Hiai,et al.  The proper formula for relative entropy and its asymptotics in quantum probability , 1991 .

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Ekert,et al.  "Event-ready-detectors" Bell experiment via entanglement swapping. , 1993, Physical review letters.

[11]  Fu Fangwei,et al.  Hypothesis testing for arbitrarily varying source , 1996 .

[12]  V. Vedral,et al.  Entanglement measures and purification procedures , 1997, quant-ph/9707035.

[13]  D. Gottesman The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.

[14]  P. Shor,et al.  QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS , 1997, quant-ph/9706061.

[15]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[16]  Tomohiro Ogawa,et al.  Strong converse and Stein's lemma in quantum hypothesis testing , 2000, IEEE Trans. Inf. Theory.

[17]  R. Werner,et al.  Entanglement measures under symmetry , 2000, quant-ph/0010095.

[18]  M. Hayashi Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing , 2002, quant-ph/0208020.

[19]  M. Ruskai Inequalities for quantum entropy: A review with conditions for equality , 2002, quant-ph/0205064.

[20]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[21]  D. Petz Monotonicity of quantum relative entropy revisited , 2002, quant-ph/0209053.

[22]  Jonathan Oppenheim,et al.  Are the laws of entanglement theory thermodynamical? , 2002, Physical review letters.

[23]  Neri Merhav,et al.  A competitive Neyman-Pearson approach to universal hypothesis testing with applications , 2002, IEEE Trans. Inf. Theory.

[24]  P. Parrilo,et al.  Complete family of separability criteria , 2003, quant-ph/0308032.

[25]  Paul Milgrom,et al.  Putting Auction Theory to Work , 2004 .

[26]  Szilárd Gy. Révész,et al.  Potential Theoretic Approach to Rendezvous Numbers , 2005, math/0503423.

[27]  林 正人 Quantum information : an introduction , 2006 .

[28]  Nilanjana Datta,et al.  Beyond i.i.d. in Quantum Information Theory , 2006, 2006 IEEE International Symposium on Information Theory.

[29]  A. Winter,et al.  Robustness of Quantum Markov Chains , 2006, quant-ph/0611057.

[30]  K. Audenaert,et al.  Discriminating States: the quantum Chernoff bound. , 2006, Physical review letters.

[31]  R. Spekkens,et al.  The resource theory of quantum reference frames: manipulations and monotones , 2007, 0711.0043.

[32]  Superadditivity of communication capacity using entangled inputs , 2009 .

[33]  Masahito Hayashi,et al.  Discrimination of Two Channels by Adaptive Methods and Its Application to Quantum System , 2008, IEEE Transactions on Information Theory.

[34]  M. Nussbaum,et al.  THE CHERNOFF LOWER BOUND FOR SYMMETRIC QUANTUM HYPOTHESIS TESTING , 2006, quant-ph/0607216.

[35]  M. Piani Relative entropy of entanglement and restricted measurements. , 2009, Physical review letters.

[36]  A. Winter,et al.  Distinguishability of Quantum States Under Restricted Families of Measurements with an Application to Quantum Data Hiding , 2008, 0810.2327.

[37]  Graeme Smith,et al.  Quantum channel capacities , 2010, 2010 IEEE Information Theory Workshop.

[38]  F. Brandão,et al.  A Generalization of Quantum Stein’s Lemma , 2009, 0904.0281.

[39]  Aram W. Harrow,et al.  An efficient test for product states , 2010 .

[40]  Salman Beigi,et al.  Approximating the set of separable states using the positive partial transpose test , 2009, 0902.1806.

[41]  Matthias Christandl,et al.  A quasipolynomial-time algorithm for the quantum separability problem , 2010, STOC '11.

[42]  F. Brandão,et al.  Faithful Squashed Entanglement , 2010, 1010.1750.

[43]  Ke Li,et al.  Second Order Asymptotics for Quantum Hypothesis Testing , 2012, ArXiv.

[44]  Laura Mančinska,et al.  Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask) , 2012, 1210.4583.

[45]  Mark M. Wilde,et al.  Quantum Information Theory , 2013 .

[46]  Aram Wettroth Harrow,et al.  Quantum de Finetti Theorems Under Local Measurements with Applications , 2012, Communications in Mathematical Physics.

[47]  Andreas Winter,et al.  Relative Entropy and Squashed Entanglement , 2012, 1210.3181.

[48]  R. Renner,et al.  Quantum Conditional Mutual Information and Approximate Markov Chains , 2014, Communications in Mathematical Physics.

[49]  William Matthews,et al.  Finite Blocklength Converse Bounds for Quantum Channels , 2012, IEEE Transactions on Information Theory.