4.5 Article

Certifiable quantum dice

出版社

ROYAL SOC
DOI: 10.1098/rsta.2011.0336

关键词

randomness; Turing; entanglement; certifiable; extractors

资金

  1. NSF [CCF-0905626]
  2. ARO [W911NF-09-1-0440]
  3. NIST [60NANB10D262]
  4. National Science Foundation [0844626]
  5. Division of Computing and Communication Foundations
  6. Direct For Computer & Info Scie & Enginr [0905626] Funding Source: National Science Foundation

向作者/读者索取更多资源

We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n random bits that are epsilon-close in statistical distance from n uniformly distributed bits, starting from a seed of O(log n log 1/epsilon) uniform bits. The bits generated are certifiably random, based only on a simple statistical test that can be performed by the user, and on the assumption that the devices obey the no-signalling principle. No other assumptions are placed on the devices' inner workings: it is not necessary to even assume the validity of quantum mechanics.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据