Quantum Private Information Retrieval with Sublinear Communication Complexity
Abstract
This note presents a quantum protocol for private information retrieval, in the single-server case and with information-theoretical privacy, that has O(n)-qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use (n) bits of communication in this setting.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.