Quantum Private Information Retrieval has Linear Communication Complexity

• DOI: 10.1007/s00145-014-9180-2
• Publication Date: 2014-04-16T20:34:15Z
• Authors: Ämin Baumeler; Anne Broadbent
• Keywords: Quantum Physics; FOS: Physical sciences; Quantum Physics (quant-ph)

In Private Information Retrieval (PIR), a client queries an n-bit database in order to retrieve an entry of her choice, while maintaining privacy of her query value. Chor, Goldreich, Kushilevitz, and Sudan showed that, in the information-theoretical setting, a linear amount of communication is required for classical PIR protocols (and thus that the trivial protocol is optimal). This linear lower bound was shown by Nayak to hold also in the quantum setting. Here, we extend Nayak's result by considering approximate privacy, and requiring security only against "specious" adversaries, which are, in analogy to classical honest-but-curious adversaries, the weakest reasonable quantum adversaries. We show that, even in this weakened scenario, Quantum Private Information Retrieval (QPIR) requires n qubits of communication. From this follows that Le Gall's recent QPIR protocol with sublinear communication complexity is not information-theoretically private, against the weakest reasonable cryptographic adversary.<br/>8 pages, minor typos fixed, affiliation of A. B. changed, acknowledgments extended<br/>