Experimental evidence of quantum randomness incomputability

Calude, Cristian S.; Dinneen, Michael J.; Dumitrescu, Monica; Svozil, Karl

doi:10.1103/physreva.82.022102

Cited by 54 publications

(66 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, they are random less often than series of times are. Hence, we confirm the results reported in [5,6] and also our main conclusions in [1]. The reason why deviations from expected randomness occur is beyond reach, because the Innsbruck experiment was dismantled long ago.…”

supporting

confidence: 92%

“…Although we briefly considered this issue in [1] the controversy remains, so we think pertinent to present additional data regarding the randomness of series of outcomes, to show that the conclusions reached for series of times are valid in this case too. The present contribution is not intended to be self-contained but an addendum to [1], so that paper must be at hand in what follows.Let review in few words why we had chosen to study the randomness of times instead of outcomes in the first place: i) The randomness of series of outcomes had been previously studied [5,6], and found to be surprisingly poor. In [6] (where the aim was to get a reliable source of random numbers) the cause of this drawback was identified in the blind time of the detectors, and successfully solved by using the time between coincidences (above or below the average) to generate a Borel-normal binary string.…”

mentioning

confidence: 99%

“…Let review in few words why we had chosen to study the randomness of times instead of outcomes in the first place: i) The randomness of series of outcomes had been previously studied [5,6], and found to be surprisingly poor. In [6] (where the aim was to get a reliable source of random numbers) the cause of this drawback was identified in the blind time of the detectors, and successfully solved by using the time between coincidences (above or below the average) to generate a Borel-normal binary string.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Experimentally generated randomness certified by the impossibility of superluminal signals

Bierhorst

Knill

Glancy

et al. 2018

Nature

200

205

View full text Add to dashboard Cite

From dice to modern electronic circuits, there have been many attempts to build better devices to generate random numbers. Randomness is fundamental to security and cryptographic systems and to safeguarding privacy. A key challenge with random-number generators is that it is hard to ensure that their outputs are unpredictable. For a random-number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model that describes the underlying physics is necessary to assert unpredictability. Imperfections in the model compromise the integrity of the device. However, it is possible to exploit the phenomenon of quantum non-locality with a loophole-free Bell test to build a random-number generator that can produce output that is unpredictable to any adversary that is limited only by general physical principles, such as special relativity. With recent technological developments, it is now possible to carry out such a loophole-free Bell test. Here we present certified randomness obtained from a photonic Bell experiment and extract 1,024 random bits that are uniformly distributed to within 10. These random bits could not have been predicted according to any physical theory that prohibits faster-than-light (superluminal) signalling and that allows independent measurement choices. To certify and quantify the randomness, we describe a protocol that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities. Future random-number generators based on loophole-free Bell tests may have a role in increasing the security and trust of our cryptographic systems and infrastructure.

show abstract

supporting

confidence: 92%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Experimentally generated randomness certified by the impossibility of superluminal signals

Bierhorst

Knill

Glancy

et al. 2018

Nature

200

205

View full text Add to dashboard Cite

show abstract

“…In a recent paper [13], Calude, Dinneen, Dumitrescu and Svozil have investigated very long bit sequences from four different sources: the digits of π, output from pseudo-random generators in the software packages Maple and Mathematica, and from two quantum (Quantis and a proprietary generator). They concluded that the quantum randum generators showed a statistically significant behaviour difference compared to the pseudo-random generators, but only in a subset of the tests they conducted.…”

Section: Resultsmentioning

confidence: 99%

A forward-parsing randomness test based on the expected codeword length of T-codes

Speidel

2011

2011 8th International Conference on Information, Communications &Amp; Signal Processing

View full text Add to dashboard Cite

This paper proposes an algorithm for randomness testing. It is a variant of an algorithm presented earlier by the author for the construction of random sequences. The algorithm exploits two facts: Firstly, given a complete finite prefix code Ci over an alphabet A, every semi-infinite sequence s of symbols x0, x1, x2, . . . from A starts with a codeword wi ∈ Ci, and if one presumes that s is random, one can compute the expected length hi of wi. Secondly, wi can be used to extend Ci to yield a larger code Ci+1. In this case, the actual length |wi| of wi determines the growth in the expected codeword length hi+1 for the codeword wi+1 ∈ Ci+1 that follows in s after the end of wi. If |wi| > hi, then hi+1 grows less compared to hi than if |wi| ≤ hi. By comparing expected codeword lengths and actual codeword lengths cumulatively, one may assess the randomness of s: If the hypothesis that s is random holds, then the cumulative values should closely mirror each other.

show abstract

“…However, it is not possible to strictly validate the unpredictability of such random numbers. Accordingly, if security is the highest priority, quantum random number generators (QRNGs) based on inherently unpredictable quantum processes are considered as the best choice for random number generation [5]. Plenty of physical realizations of QRNGs have been demonstrated based on effects ranging from phase fluctuations [6] and photon arrival times [7][8][9] over polarization fluctuations [10], which-way information at beams splitters [11,12] and spontaneous emission noise [13,14] up to photon number noise detection using mobile phone cameras [15].…”

Section: Introductionmentioning

confidence: 99%

Eavesdropping attack on a trusted continuous-variable quantum random-number generator

2019

View full text Add to dashboard Cite

Harnessing quantum processes is an efficient method to generate truly indeterministic random numbers, which are of fundamental importance for cryptographic protocols, security applications or Monte-Carlo simulations. Recently, quantum random number generators based on continuous variables have gathered a lot of attention due to the potentially high bit rates they can deliver. Especially quadrature measurements on shot-noise limited states have been studied in detail as they do not offer any side information to potential adversaries under ideal experimental conditions. However, they may be subject to additional classical noise beyond the quantum limit, which may become a source of side information for eavesdroppers. While such eavesdropping attacks have been investigated in theory in some detail, experimental studies are still rare. We experimentally realize a continuous variable eavesdropping attack, based on heterodyne detection, on a trusted quantum random number generator and discuss the limitations for secure random number generation that arise.

show abstract

Experimental evidence of quantum randomness incomputability

Cited by 54 publications

References 32 publications

Experimentally generated randomness certified by the impossibility of superluminal signals

Experimentally generated randomness certified by the impossibility of superluminal signals

A forward-parsing randomness test based on the expected codeword length of T-codes

Eavesdropping attack on a trusted continuous-variable quantum random-number generator

Contact Info

Product

Resources

About