.png){kind=icon}
.png){kind=icon}
Return
Certifiable quantum dice
.png){kind=icon}
OA
AI
DOI：10.1098/rsta.2011.0336.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
randomness
Turing
entanglement
certifiable
extractors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
3.7
Papers:
7.7K
Citations:
2.8W
