Quantum private information retrieval with sublinear communication complexity

From MaRDI portal



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.











This page was built for publication: Quantum private information retrieval with sublinear communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913816)