Device Independent Random Number Generation

@article{Pivoluska2014DeviceIR,
  title={Device Independent Random Number Generation},
  author={Mataj Pivoluska and Martin Plesch},
  journal={arXiv: Quantum Physics},
  year={2014}
}
Randomness is an invaluable resource in today's life with a broad use reaching from numerical simulations through randomized algorithms to cryptography. However, on the classical level no true randomness is available and even the use of simple quantum devices in a prepare-measure setting suffers from lack of stability and controllability. This gave rise to a group of quantum protocols that provide randomness certified by classical statistical tests -- Device Independent Quantum Random Number… Expand
Quantum generators of random numbers
TLDR
The former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification is discussed, and a new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s is presented. Expand
Advances in quantum key distribution and quantum randomness generation
TLDR
This thesis discusses some progress in quantum key distribution and quantum randomness generation, and presents a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years. Expand
Quantum random number generator protocols based on topologically inequivalent entanglements of quantum states
As the quantum random number generators are gaining in popularity, especially with 1 regard to possibility of construction of a scalable quantum computer, some new theoretical 2 perspectives in thisExpand
Quantum random number generators
In mathematics and computer science, random numbers have the role of a resource for assisting proofs, making cryptography secure, and enabling computational protocols. This role motivates efforts toExpand
Randomness in quantum mechanics: philosophy, physics and technology.
This progress report covers recent developments in the area of quantum randomness, which is an extraordinarily interdisciplinary area that belongs not only to physics, but also to philosophy,Expand
Genuine Randomness vis-a-vis Nonlocality: Hardy and Hardy type Relations.
We explore the relationship between randomness and nonlocality based on arguments which demonstrate nonlocality without requiring Bell-type inequalities, such as using Hardy relations and its variantExpand
Correlations constrained by composite measurements
How to understand the set of correlations admissible in nature is one outstanding open problem in the core of the foundations of quantum theory. Here we take a complementary viewpoint to theExpand
Use of Chaotic Randomness Numbers: Metaheuristic and Artificial Intelligence Algorithms
TLDR
This chapter is about the possible use of chaotic random numbers in the metaheuristic and artificial intelligence algorithms that requires random numbers. Expand
An explicit classical strategy for winning a $\mathrm{CHSH}_{q}$ game
A $\mathrm{CHSH}_{q}$ game is a generalization of the standard two player $\mathrm{CHSH}$ game, having $q$ different input and output options. In contrast to the binary game, the best classical andExpand
Device-independent bounds from Cabello's nonlocality argument
Ashutosh Rai1, 2,∗ Matej Pivoluska 1, 3, 4,† and Martin Plesch 1, 3‡ 1Institute of Physics, Slovak Academy of Sciences, 845 11 Bratislava, Slovakia, 2School of Electrical Engineering, Korea AdvancedExpand
...
1
2
...

References

SHOWING 1-10 OF 94 REFERENCES
Robust Device Independent Randomness Amplification
In randomness amplification a slightly random source is used to produce an improved random source. Perhaps surprisingly, a single source of randomness cannot be amplified at all classically. However,Expand
Random numbers certified by Bell’s theorem
TLDR
It is shown that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness, and it is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device. Expand
Security of practical private randomness generation
Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomnessExpand
True randomness from realistic quantum devices
TLDR
Here this work provides a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness. Expand
Device-independent randomness generation in the presence of weak cross-talk.
TLDR
It is argued that for device-independent randomness generation--and other device- independent protocols where the devices are in the same lab--the authors can slightly relax the requirement of perfect isolation and still retain most of the advantages of the device-Independent approach, by allowing a little cross-talk between the devices. Expand
Device-independent randomness amplification with a single device
Abstract Expansion and amplification of weak randomness with untrusted quantum devices has recently become a very fruitful topic of research. Here we contribute with a procedure for amplifying aExpand
Infinite randomness expansion with a constant number of devices
We present a device-independent randomness expansion protocol, involving only a constant number of non-signaling quantum devices, that achieves infinite expansion: starting with m bits of uniformExpand
Device-independent randomness extraction from an arbitrarily weak min-entropy source
Expansion and amplification of weak randomness play a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizingExpand
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
TLDR
A modified protocol uses a seed of O(log3 n) uniformly random bits to generate n bits that are poly-1(n)-indistinguishable from uniform even from the point of view of a quantum adversary who may have had prior access to the devices, and may be entangled with them. Expand
Full randomness from arbitrarily deterministic events.
TLDR
A Bell test is provided that uses arbitrarily imperfect random bits to produce bits that are, under the non-signalling principle assumption, perfectly random, and provides the first protocol attaining full randomness amplification. Expand
...
1
2
3
4
5
...