Indistinguishability between quantum randomness and pseudorandomness under efficiently calculable randomness measures
Indistinguishability between quantum randomness and pseudorandomness under efficiently calculable randomness measures
We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudorandom numbers (i.e., random numbers generated algorithmically). The theorem states that one cannot distinguish these two types of random numbers if the quantum random numbers are efficiently classically simulatable and the …