Published July 28, 2012
| Submitted
Journal Article
Open
Certifiable quantum dice
- Creators
- Vazirani, Umesh
-
Vidick, Thomas
Chicago
Abstract
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n random bits that are ε-close in statistical distance from n uniformly distributed bits, starting from a seed of O(log n log 1/ ϵ) 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.
Additional Information
© 2012 The Royal Society. Published online 28/07/2012; Published in print 28/07/2012. One contribution of 18 to a Theme Issue 'The foundations of computation, physics and mentality: the Turing legacy'. U.V. is supported in part by NSF grant CCF-0905626, ARO grant W911NF-09-1-0440 and NIST award 60NANB10D262. T.V. is supported by the National Science Foundation under grant no. 0844626. Most of this work was completed while T.V. was at U.C. Berkeley.Attached Files
Submitted - 1111.6054.pdf
Files
1111.6054.pdf
Files
(255.3 kB)
Name | Size | Download all |
---|---|---|
md5:6434ca7deb7fe53b69e7a08ec9ee6bd6
|
255.3 kB | Preview Download |
Additional details
- Alternative title
- Certifiable Quantum Dice - Or, testable exponential randomness expansion
- Eprint ID
- 104717
- DOI
- 10.1098/rsta.2011.0336
- Resolver ID
- CaltechAUTHORS:20200804-084834826
- NSF
- CCF-0905626
- Army Research Office (ARO)
- W911NF-09-1-0440
- National Institute of Standards & Technology (NIST)
- 60NANB10D262
- NSF
- CCF-0844626
- Created
-
2020-08-04Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field