Capacity of Quantum Private Information Retrieval with Multiple Servers

Song，Seunghoan1; Hayashi，Masahito1,2,3

10.1109/ISIT.2019.8849830

2019-07-01

2157-8095

IEEE International Symposium on Information Theory - Proceedings

2019-July

1727-1731

We study the capacity of quantum private information retrieval (QPIR) with multiple servers. In the QPIR problem with multiple servers, a user retrieves a classical file by downloading quantum systems from multiple servers each of which containing the whole classical file set, without revealing the identity of the retrieved file to any individual server. The QPIR capacity is defined as the maximum rate of the file size over the whole dimension of the downloaded quantum systems. Assuming the preexisting entanglement among servers, we prove that the QPIR capacity with multiple servers is 1 regardless of the number of servers and files. We propose a rate-one protocol which can be implemented by using only two servers. This capacity-achieving protocol outperforms its classical counterpart in the sense of the capacity, server secrecy, and upload cost. The strong converse bound is derived concisely without using the secrecy conditions.

其他

英语

EI

20194207537502

Information retrieval ; Information theory

Information Theory and Signal Processing:716.1 ; Light/Optics:741.1 ; Information Retrieval and Use:903.3 ; Quantum Theory; Quantum Mechanics:931.4

2-s2.0-85073163189

Scopus

1.Graduate School of Mathematics,Nagoya University,Japan
2.Centre for Quantum Technologies,National University of Singapore,Singapore
3.Shenzhen Institute for Quantum Science and Engineering,Southern University of Science and Technology,China

Song，Seunghoan,Hayashi，Masahito. Capacity of Quantum Private Information Retrieval with Multiple Servers[C],2019:1727-1731.