Guesswork With Quantum Side Information

What is the minimum number of guesses needed on average to guess a realization of a random variable correctly? The answer to this question led to the introduction of a quantity called guesswork by Massey in 1994, which can be viewed as an alternate security criterion to entropy. In this paper, we consider the guesswork in the presence of quantum side information, and show that a general sequential guessing strategy is equivalent to performing a single quantum measurement and choosing a guessing strategy based on the outcome. We use this result to deduce entropic one-shot and asymptotic bounds on the guesswork in the presence of quantum side information, and to formulate a semi-definite program (SDP) to calculate the quantity. We evaluate the guesswork for a simple example involving the BB84 states, both numerically and analytically, and we prove a continuity result that certifies the security of slightly imperfect key states when the guesswork is used as the security criterion.

[1]  Benjamin Müller,et al.  The SCIP Optimization Suite 5.0 , 2017, 2112.08872.

[2]  K. R. Parthasarathy,et al.  EXTREMAL DECISION RULES IN QUANTUM HYPOTHESIS TESTING , 1999 .

[3]  Harsha Nagarajan,et al.  Designing Power Grid Topologies for Minimizing Network Disturbances: An Exact MILP Formulation , 2019, 2019 American Control Conference (ACC).

[4]  N. Biggs.  GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2) , 1990 .

[5]  Sergio Verdú,et al.  Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures , 2018, IEEE Transactions on Information Theory.

[6]  Eric P. Hanson,et al.  Maximum and minimum entropy states yielding local continuity bounds , 2017, 1706.02212.

[7]  Miles Lubin,et al.  coin-or/Cbc: Version 2.10.5 , 2020 .

[8]  John O. Pliam.  The Disparity between Work and Entropy in Cryptology , 1998, IACR Cryptol. ePrint Arch..

[9]  David Malone,et al.  Guesswork and entropy , 2004, IEEE Transactions on Information Theory.

[10]  Neri Merhav,et al.  Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.

[11]  Stefan Lindskog,et al.  On the Relationship between Confidentiality Measures: Entropy and Guesswork , 2007, WOSIS.

[12]  Miles Lubin,et al.  Outer approximation with conic certificates for mixed-integer convex problems , 2018, Math. Program. Comput..

[13]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[14]  J. Massey.  Guessing and entropy , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[15]  Mario Berta,et al.  On variational expressions for quantum relative entropies , 2015, ArXiv.

[16]  John Watrous,et al.  Semidefinite Programs for Completely Bounded Norms , 2009, Theory Comput..

[17]  Masahito Hayashi,et al.  Relating different quantum generalizations of the conditional Rényi entropy , 2013, 1311.3887.

[18]  Ken R. Duffy,et al.  Guesswork, Large Deviations, and Shannon Entropy , 2012, IEEE Transactions on Information Theory.

[19]  Serge Fehr,et al.  On the Conditional Rényi Entropy , 2014, IEEE Transactions on Information Theory.

[20]  Alan Edelman,et al.  Julia: A Fresh Approach to Numerical Computing , 2014, SIAM Rev..

[21]  Robert König,et al.  The Operational Meaning of Min- and Max-Entropy , 2008, IEEE Transactions on Information Theory.

[22]  Rajesh Sundaresan,et al.  Guessing Under Source Uncertainty , 2006, IEEE Transactions on Information Theory.

[23]  Erdal Arikan.  An inequality on guessing and its application to sequential decoding , 1996, IEEE Trans. Inf. Theory.

[24]  Igal Sason,et al.  Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression , 2018, Entropy.

[25]  Mark M. Wilde,et al.  Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels via a Sandwiched Rényi Relative Entropy , 2013, Communications in Mathematical Physics.

[26]  Neri Merhav,et al.  Joint Source-Channel Coding and Guessing with Application to Sequential Decoding , 1998, IEEE Trans. Inf. Theory.

[27]  Serge Fehr,et al.  On quantum Rényi entropies: A new generalization and some properties , 2013, 1306.3142.

[28]  Elliott H. Lieb,et al.  Monotonicity of a relative Rényi entropy , 2013, ArXiv.

[29]  E. Prugovec̆ki.  Information-theoretical aspects of quantum measurement , 1977 .

[30]  Stephen P. Boyd,et al.  Convex Optimization in Julia , 2014, 2014 First Workshop for High Performance Technical Computing in Dynamic Languages.

[31]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[32]  Yuan Feng,et al.  Minimum guesswork discrimination between quantum states , 2014, Quantum Inf. Comput..

[33]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[34]  Rajesh Sundaresan,et al.  Guessing Revisited: A Large Deviations Approach , 2010, IEEE Transactions on Information Theory.

[35]  Makoto Yamashita,et al.  A high-performance software package for semidefinite programs: SDPA 7 , 2010 .

[36]  Marco Tomamichel,et al.  Quantum Information Processing with Finite Resources - Mathematical Foundations , 2015, ArXiv.