Commitment capacity of classical-quantum channels

Hayashi，Masahito1,2,3,4; Warsi，Naqueeb Ahmad5

2022

10.1109/ISIT50566.2022.9834801

IEEE International Symposium on Information Theory - Proceedings   Impact Factor & Quartile

2157-8095

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.

Upper bound Channel capacity Entropy Encoding Decoding Cryptography

EI

English

First

National Natural Science Foundation of China[62171212];

20223512624845

Communication channels (information theory) ; Quantum cryptography

Information Theory and Signal Processing:716.1 ; Quantum Theory; Quantum Mechanics:931.4

COMPUTER SCIENCE

2-s2.0-85136295712

Scopus

978-1-6654-2160-7

1.Shenzhen Institute for Quantum Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China
2.International Quantum Academy (SIQA),Shenzhen,518048,China
3.Guangdong Provincial Key Laboratory of Quantum Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China
4.Graduate School of Mathematics,Nagoya University,Nagoya,464-8602,Japan
5.Electronics and Communication Science Unit,Indian Statistical Institute,Kolkata,700108,India

Hayashi，Masahito,Warsi，Naqueeb Ahmad. Commitment capacity of classical-quantum channels[J]. IEEE International Symposium on Information Theory - Proceedings,2022,2022-June(8):1058-1063.

Hayashi，Masahito,&Warsi，Naqueeb Ahmad.(2022).Commitment capacity of classical-quantum channels.IEEE International Symposium on Information Theory - Proceedings,2022-June(8),1058-1063.

Hayashi，Masahito,et al."Commitment capacity of classical-quantum channels".IEEE International Symposium on Information Theory - Proceedings 2022-June.8(2022):1058-1063.