论文标题
经典量子渠道的承诺能力
Commitment capacity of classical-quantum channels
论文作者
论文摘要
我们研究经典量子通道的承诺计划。为此，我们为这些渠道定义了各种承诺能力的概念，并在条件熵方面证明了上下界面上的上和下限。我们的可实现性（下限）证明是对一位作者的作品（Arxiv：2103.11548）的工作的量子概括，该作者研究了安全列表解码的问题及其在位串联承诺中的应用。我们在匡威证明（上限）中使用的技术在精神上与Winter，Nascimento和Imai（Cryptography and Coding 2003）所引入的技术相似，以证明对经典渠道的承诺能力的上限。但是，将此技术概括为量子情况并不那么简单，需要一些新的结构，这可能具有独立的关注。
We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our achievability (lower bound) proof is quantum generalisation of the work of one of the authors (arXiv:2103.11548) which studied the problem of secure list decoding and its application to bit-string commitment. The techniques we use in the proof of converse (upper bound) is similar in spirit to the techniques introduced by Winter, Nascimento and Imai (Cryptography and Coding 2003) to prove upper bound on the commitment capacity of classical channels. However, generalisation of this technique to the quantum case is not so straightforward and requires some new constructions, which can be of independent interest.
