Quantum random number generation

Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Qi, Bing; Zhang, Zhen

doi:10.1038/npjqi.2016.21

Cited by 294 publications

(209 citation statements)

References 99 publications

Supporting

Mentioning

209

Contrasting

Order By: Relevance

“…Real life quantum random number generators most commonly use photons and exploit collapse in particle spin degrees of freedom, in particle arrival times, in particle positions and in particle numbers. For a recent survey, see Ma et al (2016).…”

Section: A Quantum Mechanical Infinite Lottery Machinementioning

confidence: 99%

How to build an infinite lottery machine

Norton

2017

Euro Jnl Phil Sci

View full text Add to dashboard Cite

An infinite lottery machine is used as a foil for testing the reach of inductive inference, since inferences concerning it require novel extensions of probability.Its use is defensible if there is some sense in which the lottery is physically possible, even if exotic physics is needed. I argue that exotic physics is needed and describe several proposals that fail and at least one that succeeds well enough.

show abstract

Section: A Quantum Mechanical Infinite Lottery Machinementioning

confidence: 99%

How to build an infinite lottery machine

Norton

2017

Euro Jnl Phil Sci

View full text Add to dashboard Cite

show abstract

“…These requirements come from the fact that true random number generators, as opposed to their pseudo-random counterpart, are systems whose outputs cannot be determined even if their internal structure and response history are known 1 . True random numbers can be obtained from noise 2 , chaotic systems 3 and quantum phenomena 4 . In this work, we propose using resonant tunnelling diodes (RTD) as a practical, scalable source of randomness that employs quantum confinement.…”

Section: Introductionmentioning

confidence: 99%

N-state random switching based on quantum tunnelling

Gavito

Urbanos

Roberts

et al. 2017

Nanoengineering: Fabrication, Properties, Optics, and Devices XIV

View full text Add to dashboard Cite

In this work, we show how the hysteretic behaviour of resonant tunnelling diodes (RTDs) can be exploited for new functionalities. In particular, the RTDs exhibit a stochastic 2-state switching mechanism that could be useful for random number generation and cryptographic applications. This behaviour can be scaled to N-bit switching, by connecting various RTDs in series. The InGaAs/AlAs RTDs used in our experiments display very sharp negative differential resistance (NDR) peaks at room temperature which show hysteresis cycles that, rather than having a fixed switching threshold, show a probability distribution about a central value. We propose to use this intrinsic uncertainty emerging from the quantum nature of the RTDs as a source of randomness. We show that a combination of two RTDs in series results in devices with three-state outputs and discuss the possibility of scaling to N-state devices by subsequent series connections of RTDs, which we demonstrate for the up to the 4-state case.In this work, we suggest using that the intrinsic uncertainty in the conduction paths of resonant tunnelling diodes can behave as a source of randomness that can be integrated into current electronics to produce on-chip true random number generators. The N-shaped I-V characteristic of RTDs results in a two-level random voltage output when driven with current pulse trains. Electrical characterisation and randomness testing of the devices was conducted in order to determine the validity of the true randomness assumption. Based on the results obtained for the single RTD case, we suggest the possibility of using multi-well devices to generate N-state random switching devices for their use in random number generation or multi-valued logic devices.

show abstract

“…Notable examples are quantum signature schemes [3][4][5], two-party quantum cryptography [6][7][8], delegated quantum computation [9,10], covert quantum communication and steganography [11][12][13][14], quantum random number generation [15][16][17], quantum fingerprinting [18][19][20][21], and quantum money [22][23][24]. Historically, many of these protocols have been extremely challenging to implement with available technologies, but we are currently approaching a point where both theoretical and experimental developments have made it possible for the first experimental demonstrations to emerge.…”

Section: Introductionmentioning

confidence: 99%

Quantum money with nearly optimal error tolerance

Amiri

Arrazola

2017

Phys. Rev. A

View full text Add to dashboard Cite

We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which we conjecture reaches 25% asymptotically as the dimension of the underlying hidden matching states is increased. Furthermore, we prove that 25% is the maximum tolerable noise for a wide class of quantum money schemes with classical verification, meaning our schemes are almost optimally noise tolerant. We use methods in semidefinite programming to prove security in a substantially different manner to previous proposals, leading to two main advantages: first, coin verification involves only a constant number of states (with respect to coin size), thereby allowing for smaller coins; second, the re-usability of coins within our scheme grows linearly with the size of the coin, which is known to be optimal. Lastly, we suggest methods by which the coins in our protocol could be implemented using weak coherent states and verified using existing experimental techniques, even in the presence of detector inefficiencies.

show abstract

Quantum random number generation

Cited by 294 publications

References 99 publications

How to build an infinite lottery machine

How to build an infinite lottery machine

N-state random switching based on quantum tunnelling

Quantum money with nearly optimal error tolerance

Contact Info

Product

Resources

About