Aguero, JMCalude, CSDinneen, MJFedorov, AKulikov, ANavarathna, RSvozil, K2024-01-172024-01-172023CDMTCS Research Reports CDMTCS-572 (2023)1178-3540https://hdl.handle.net/2292/67245A physical system is determined by a finite set of initial conditions and laws represented by equations. The system is computable if we can solve the equations in all instances using a “finite body of mathematical knowledge". In this case, if the law of the system can be coded into a computer program, then given the system’s initial conditions of the system, one can compute the system’s evolution. This scenario is tacitly taken for granted. But is this reasonable? The answer is negative, and a straightforward example is when the initial conditions or equations use irrational numbers, like Chaitin’s Omega Number: no program can deal with such numbers because of their “infinity”. Are there incomputable physical systems? This question has been theoretically studied in the last 30–40 years. This article presents a class of quantum protocols producing quantum random bits. Theoretically, we prove that every infinite sequence generated by these quantum protocols is strongly incomputable – no algorithm computing any bit of such a sequence can be proved correct. This theoretical result is not only more robust than the ones in the literature: experimental results support and complement it.Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmhttps://creativecommons.org/licenses/by/4.0/Technical ReportFields of ResearchCopyright: The author(s)http://purl.org/eprint/accessRights/OpenAccess