Van Deren, Brennan P.
Kavulich, John T.
Schlosshauer, Maximilian
2020-11-18
<p>This upload contains the data and code used in the following paper:</p>
<p>J. T. Kavulich, B. P. Van Deren, and M. Schlosshauer, “Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators,” <em>Phys. Lett. A</em> 388, 127032 (2021), <a href="https://doi.org/10.1016/j.physleta.2020.127032">doi.org/10.1016/j.physleta.2020.127032</a></p>
<p>The contents of the data set are as follows:</p>
<p>1) Random strings for two QRNGs and four PRNGs. For each RNG, a zip archive provides 100 strings containing 25 x 2<sup>26</sup> = 1,677,721,600 bits each.</p>
<p>2) C++ code for the Chaitin–Schwartz–Solovay–Strassen (CSSS) and Borel-normality tests (code.zip, 13 KB).</p>
<p>The bulk of this code is not ours, but was written and made publicly available at <a href="https://www.cs.auckland.ac.nz/research/groups/CDMTCS/export/80_random_seqs">this link</a> by the authors of the following paper:</p>
<p>A. A. Abbott, C. S. Calude, M. J. Dinneen, and N. Huang, <em>Phys. Scri.</em> 94 (2019) 045103, <a href="https://doi.org/10.1088/1402-4896/aaf36a">doi:10.1088/1402-4896/aaf36a</a></p>
<p>We have made just a few small modifications to their original code:</p>
<ul>
<li>For the CSSS tests, a text file containing the Carmichael numbers (for tests 1–3) and odd composites up to 100 (for test 4) is read in and used to perform the tests. (Note: The set of Carmichael numbers used in the tests was generously provided to us by R. G. E. Pinch. Reference: R. G. E. Pinch, The Carmichael numbers up to 10<sup>21</sup>, in: A.-M. Ernvall-Hytönen (Ed.), Proceedings of Conference on Algorithmic Number Theory, Vol. 46, Turku Centre for Computer Science, Turku, Finland, 2007, pp. 129–131.)</li>
<li>We combined the first and second CSSS tests into a single program.</li>
<li>We reformatted the display of the output, and included a VERBOSE flag for additional status output.</li>
</ul>
<p>3) Results from CSSS and Borel-normality tests in Python format (results.zip, 22 KB). This archive also contains a Python script (analyze.py) that reads the result files, carries out the statistical analysis, and displays the plots.</p>
https://doi.org/10.1016/j.physleta.2020.127032
oai:zenodo.org:4440318
Zenodo
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
Physics Letters A, 388, 127032, (2020-11-18)
Quantum random number generators
Quantum randomness
Algorithmic randomness
Incomputability
Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators
info:eu-repo/semantics/other