Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security
What is the minimum number of guesses needed on average to correctly guess a realization of a random variable? The answer to this question led to the introduction of the notion 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 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, and we prove a continuity result that certifies the security of slightly imperfect key states when the guesswork is used as the security criterion.
Publication Source (Journal or Book title)
IEEE International Symposium on Information Theory - Proceedings
Hanson, E., Katariya, V., Datta, N., & Wilde, M. (2020). Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security. IEEE International Symposium on Information Theory - Proceedings, 2020-June, 1984-1989. https://doi.org/10.1109/ISIT44484.2020.9174107