首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Quantum Private Information Retrieval with Sublinear Communication Complexity
  • 本地全文:下载
  • 作者:François Le Gall
  • 期刊名称:Theory of Computing
  • 印刷版ISSN:1557-2862
  • 电子版ISSN:1557-2862
  • 出版年度:2012
  • 卷号:8
  • 页码:369-374
  • 出版社:University of Chicago
  • 摘要:

    This note presents a quantum protocol for private information retrieval, in the case of a single (honest) server 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.

  • 关键词:private information retrieval; quantum communication complexity
国家哲学社会科学文献中心版权所有