Technical Program

Paper Detail

Paper Title Capacity of Quantum Private Information Retrieval with Multiple Servers
Paper IdentifierWE2.R8.5
Authors Seunghoan Song, Masahito Hayashi, Nagoya University, Japan
Session Quantum Security and Privacy
Location Conseil, Level 5
Session Time Wednesday, 10 July, 11:40 - 13:20
Presentation Time Wednesday, 10 July, 13:00 - 13:20
Manuscript  Click here to download the manuscript
Abstract 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.