A new work introduces a quantum random number generation algorithm that uses QFT-based mixing and Grover-style amplitude averaging to achieve a provable quadratic speedup over classical method.
arxiv.org/abs/2606.13034
We present a quantum algorithm for random number generation that achieves a provable quadratic speedup over classical Markov chain mixing, building on the Diaconis-Shahshahani Fourier analysis of the ...
