2000 character limit reached
Quantum Private Information Retrieval with Sublinear Communication Complexity
Published 29 Jul 2011 in quant-ph, cs.CC, and cs.CR | (1107.5881v1)
Abstract: This note presents a quantum protocol for private information retrieval, in the single-server case and with information-theoretical privacy, that has O(\sqrt{n})-qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use \Omega(n) bits of communication in this setting.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.