2000 character limit reached
Quantum Private Information Retrieval with Sublinear Communication Complexity (1107.5881v1)
Published 29 Jul 2011 in quant-ph, cs.CC, and cs.CR
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.