On the impossibility of extracting classical randomness using a quantum computer
Preprint
Abstract
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well known that classical computers are insufficient for either one of these tasks when all they have access to is a realistic imperfect source of randomness. On the other hand, quantum physics is inherently probabilistic which suggests that perhaps quantum computers can provide a reasonable way to overcome the above mentioned impossibility results. However, we show that this is not the case in a realistic setting where observations (measurements) are subject to noise.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Simulating BPP using a general weak random source2002
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- Some extremal problems arising from discrete control processesCombinatorica, 1989
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986
- Independent unbiased coin flips from a correlated biased source—A finite state markov chainCombinatorica, 1986
- Local realism has not been refuted by atomic cascade experimentsPhysics Letters A, 1983
- Experimental consequences of objective local theoriesPhysical Review D, 1974
- The Efficient Construction of an Unbiased Random SequenceThe Annals of Mathematical Statistics, 1972