Quantum Private Information Retrieval with Sublinear Communication Complexity
Quantum Physics
2021-10-05 v1 Computational Complexity
Cryptography and Security
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.
Keywords
Cite
@article{arxiv.1107.5881,
title = {Quantum Private Information Retrieval with Sublinear Communication Complexity},
author = {François Le Gall},
journal= {arXiv preprint arXiv:1107.5881},
year = {2021}
}
Comments
4 pages