首页> 外文会议>IEEE International Symposium on Information Theory >Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security
【24h】

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.
机译:正确猜测随机变量的实现所需的平均最小猜测数是多少?这个问题的答案导致了1994年Massey引入了一个称为猜测的量的概念,该量可以看作是熵的另一种安全标准。在本文中,我们考虑了在存在量子辅助信息的情况下的猜测,并表明一般的顺序猜测策略等效于执行单个量子测量并根据结果选择猜测策略。我们使用此结果来推断在存在量子边信息的情况下,猜想上的熵单次和渐近界,并制定一个半定式程序(SDP)来计算数量。我们评估一个涉及BB84状态的简单示例的猜测工作,并证明了连续性结果,该结果证明了当猜测工作用作安全性标准时略微不完善的关键状态的安全性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号