pith. sign in

arxiv: 1111.6054 · v1 · pith:L346Q2WLnew · submitted 2011-11-25 · 🪐 quant-ph

Certifiable Quantum Dice - Or, testable exponential randomness expansion

classification 🪐 quant-ph
keywords bitsdevicesquantumrandomnessgenerateprotocolrandomseed
0
0 comments X
read the original abstract

We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits of true randomness from a seed of O(log n) 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-signaling principle. No other assumptions are placed on the devices' inner workings. A modified protocol uses a seed of O(log^3 n) uniformly random bits to generate $n$ bits of true randomness even conditioned on the state of a quantum adversary who may have had prior access to the devices, and may be entangled with them.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. "Nonlocality-of-a-single-photon" based Quantum Key Distribution and Random Number Generation schemes and their device-independent security analysis

    quant-ph 2023-11 unverdicted novelty 7.0

    Presents a single-photon DI-QKD scheme and self-testing QRNG whose security rests on no-signaling polytope decomposition and a Clauser-Horne inequality involving on/off weak homodyne settings.