Author:
Islam Tanvirul,Banerji Anindya,Boon Chin Jia,Rui Wang,Reezwana Ayesha,Grieve James A.,Piera Rodrigo,Ling Alexander
Abstract
AbstractVerifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user’s ability to perform such verification. There are also random number-based applications where an honest user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Funder
National Research Foundation, Singapore
A*STAR under its CQT Bridging Grant
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Hastings, W. K. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97–109 (1970).
2. Šupić, I. & Bowles, J. Self-testing of quantum systems: A review. Quantum 4, 337 (2020).
3. Rabin, M. O. Probabilistic algorithm for testing primality. J. Number Theory 12, 128–138 (1980).
4. Howes, L. & Thomas, D. Efficient random number generation and application using CUDA. GPU Gems 3, 805–830 (2007).
5. Zhang, L. & Suganthan, P. N. A survey of randomized algorithms for training neural networks. Inf. Sci. 364, 146–155 (2016).