Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Random World and Quantum Mechanics

Jerzy Król, Krzysztof Bielas, Torsten Aßelmeyer-Maluga

Published Feb 16, 2021• 0 citations
Publisher

Abstract

Abstract Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin-Löf. We extend this result and demonstrate that QM is algorithmic ω-random and generic precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo-Fraenkel Solovay random on infinite dimensional Hilbert spaces. Moreover it is more likely that there exists a standard transitive model of ZFC M where QM is expressed in reality than in the universe V of sets. Then every generic quantum measurement adds the infinite sequence, i.e. random real r ∈ 2ω, to M and the model undergoes random forcing extensions, M[r]. The entire process of forcing becomes the structural ingredient of QM and parallels similar constructions applied to spacetime in the quantum limit. This shows the structural resemblance of both in the limit. We discuss several questions regarding measurability and eventual practical applications of the extended Solovay randomness of QM. The method applied is the formalization based on models of ZFC, however, this is particularly well-suited technique to recognising randomness questions of QM. When one works in a constant model of ZFC or in axiomatic ZFC itself the issues considered here become mostly hidden.

DOI
10.21203/rs.3.rs-200271/v1

Related papers

Random World and Quantum Mechanics

Jerzy Król, Krzysztof Bielas, Torsten Aßelmeyer-Maluga

Abstract Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin-Löf. We extend this result and demonstrate that QM is algorithmic ω-random and generic precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo-Fraenkel Solovay random on infinite dimensional Hilbert spaces. Moreover it is more likely that there exists a standard transitive model of ZFC M where QM is expressed in reality than in the universe V of sets. Then every generic quantum measurement adds the infinite sequence, i.e. random real r ∈ 2ω , to M and the model undergoes random forcing extensions, M[r]. The entire process of forcing becomes the structural ingredient of QM and parallels similar constructions applied to spacetime in the quantum limit. This shows the structural resemblance of both in the limit. We discuss several questions regarding measurability and eventual practical applications of the extended Solovay randomness of QM. The method applied is the formalization based on models of ZFC, however, this is particularly well-suited technique to recognising randomness questions of QM. When one works in a constant model of ZFC or in axiomatic ZFC itself the issues considered here become mostly hidden.

•Jul 19, 2021•0 citations

Random World and Quantum Mechanics

Jerzy Król, Krzysztof Bielas, Torsten Aßelmeyer-Maluga

Abstract Quantum mechanics (QM) predicts probabilities on the fundamentallevel which are, via Born probability law, connected to the formal randomnessof infinite sequences of QM outcomes. Recently it has been shown thatQM is algorithmic 1-random in the sense of Martin-L¨of. We extend this resultand demonstrate that QM is algorithmic ω-random and generic, precisely asdescribed by the ’miniaturisation’ of the Solovay forcing to arithmetic. Thisis extended further to the result that QM becomes Zermelo–Fraenkel Solovayrandom on infinite-dimensional Hilbert spaces. Moreover, it is more likely thatthere exists a standard transitive ZFC model M, where QM is expressed in reality,than in the universe V of sets. Then every generic quantum measurementadds to M the infinite sequence, i.e. random real r ∈ 2ω, and the model undergoesrandom forcing extensions M[r]. The entire process of forcing becomesthe structural ingredient of QM and parallels similar constructions applied tospacetime in the quantum limit, therefore showing the structural resemblanceof both in this limit. We discuss several questions regarding measurability andpossible practical applications of the extended Solovay randomness of QM.The method applied is the formalization based on models of ZFC; however,this is particularly well-suited technique to recognising randomness questionsof QM. When one works in a constant model of ZFC or in axiomatic ZFCitself, the issues considered here remain hidden to a great extent.

•Dec 17, 2021•1 citation

Randomness and Reality

Geoffrey Paul Hellman

In previous technical work ([1] and [2]) on which his present paper [3] draws, Benioff has presented results conforming with the following argument-scheme: First, if we construe Quantum Mechanics as making claims to the effect that infinite outcome sequences (generated by repeated measurements on a system for a given observable in a given state) be random; and second, if a strong definition of “random” is adopted in this construal, then certain models of Zermelo-Fraenkel set theory (ZF) cannot be “carriers for the mathematics of physics”. How interesting is this? One can approach the matter on two levels, the level of the specific technical results, and the level of more general implications of this pattern of argument for understanding connections between mathematics and physics. The second more general level should be our primary focus, but it will pay at the outset to look briefly at the technical level.

PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association•Jan 1, 1978•14 citations

QUANTUM MEASUREMENTS AND ALGORITHMIC RANDOMNESS

Tejas Bhojraj

Abstract Nies and Scholz formalized the notion of an infinite qubitstring and referred to it as a ‘state’. They defined ‘quantum Martin-Löf randomness’ for states. We give a notion of measurement of a state in a computable basis and introduce ‘quantum measurement randomness’, a randomness notion for states. A state is quantum measurement random if measuring it in any computable basis yields a Martin-Löf random bitstring with probability one. Our main result is that quantum Martin-Löf randomness strictly implies quantum measurement randomness. This uses the construction of a quantum measurement random state which is not quantum Martin-Löf random. We prove two general results on which this construction relies: The first concerns Martin-Löf randomness relative to computable measures and extends a result of V. Vovk. The second is a combinatorial result about Kronecker products.

Journal of Symbolic Logic•Feb 23, 2026•0 citations

Generating Randomness from a Computable, Non-random Sequence of Qubits

Tejas Bhojraj

Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits and defined quantum-Martin-Lof randomness for states, analogously to the well known concept of Martin-L\"of randomness for elements of Cantor space (the space of infinite sequences of bits). We formalize how 'measurement' of a state in a basis induces a probability measure on Cantor space. A state is 'measurement random' (mR) if the measure induced by it, under any computable basis, assigns probability one to the set of Martin-L\"of randoms. Equivalently, a state is mR if and only if measuring it in any computable basis yields a Martin-L\"of random with probability one. While quantum-Martin-L\"of random states are mR, the converse fails: there is a mR state, x which is not quantum-Martin-L\"of random. In fact, something stronger is true. While x is computable and can be easily constructed, measuring it in any computable basis yields an arithmetically random sequence with probability one. I.e., classical arithmetic randomness can be generated from a computable, non-quantum random sequence of qubits.

arXiv:2005.00207•Electronic Proceedings in Theoretical Computer Science•Apr 30, 2020•4 citations

Quantum algorithmic randomness

Tejas Bhojraj

Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces. We then show that random states form a convex set. Martin-Löf absolute continuity is shown to be a special case of q-MLR. Quantum Schnorr randomness is introduced. A quantum analog of the law of large numbers is shown to hold for quantum Schnorr random states.

arXiv:2008.03584•Journal of Mathematical Physics•Feb 1, 2021•6 citations
Abstract Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin-Löf. We extend this result and demonstrate that QM is algorithmic ω-random and generic precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo-Fraenkel Solovay random on infinite dimensional Hilbert spaces. Moreover it is more likely that there exists a standard transitive model of ZFC M where QM is expressed in reality than in the universe V of sets. Then every generic quantum measurement adds the infinite sequence, i.e. random real r ∈ 2ω, to M and the model undergoes random forcing extensions, M[r]. The entire process of forcing becomes the structural ingredient of QM and parallels similar constructions applied to spacetime in the quantum limit. This shows the structural resemblance of both in the limit. We discuss several questions regarding measurability and eventual practical applications of the extended Solovay randomness of QM. The method applied is the formalization based on models of ZFC, however, this is particularly well-suited technique to recognising randomness questions of QM. When one works in a constant model of ZFC or in axiomatic ZFC itself the issues considered here become mostly hidden.
Abstract Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin-Löf. We extend this result and demonstrate that QM is algorithmic ω-random and generic precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo-Fraenkel Solovay random on infinite dimensional Hilbert spaces. Moreover it is more likely that there exists a standard transitive model of ZFC M where QM is expressed in reality than in the universe V of sets. Then every generic quantum measurement adds the infinite sequence, i.e. random real r ∈ 2ω , to M and the model undergoes random forcing extensions, M[r]. The entire process of forcing becomes the structural ingredient of QM and parallels similar constructions applied to spacetime in the quantum limit. This shows the structural resemblance of both in the limit. We discuss several questions regarding measurability and eventual practical applications of the extended Solovay randomness of QM. The method applied is the formalization based on models of ZFC, however, this is particularly well-suited technique to recognising randomness questions of QM. When one works in a constant model of ZFC or in axiomatic ZFC itself the issues considered here become mostly hidden.
Abstract Quantum mechanics (QM) predicts probabilities on the fundamentallevel which are, via Born probability law, connected to the formal randomnessof infinite sequences of QM outcomes. Recently it has been shown thatQM is algorithmic 1-random in the sense of Martin-L¨of. We extend this resultand demonstrate that QM is algorithmic ω-random and generic, precisely asdescribed by the ’miniaturisation’ of the Solovay forcing to arithmetic. Thisis extended further to the result that QM becomes Zermelo–Fraenkel Solovayrandom on infinite-dimensional Hilbert spaces. Moreover, it is more likely thatthere exists a standard transitive ZFC model M, where QM is expressed in reality,than in the universe V of sets. Then every generic quantum measurementadds to M the infinite sequence, i.e. random real r ∈ 2ω, and the model undergoesrandom forcing extensions M[r]. The entire process of forcing becomesthe structural ingredient of QM and parallels similar constructions applied tospacetime in the quantum limit, therefore showing the structural resemblanceof both in this limit. We discuss several questions regarding measurability andpossible practical applications of the extended Solovay randomness of QM.The method applied is the formalization based on models of ZFC; however,this is particularly well-suited technique to recognising randomness questionsof QM. When one works in a constant model of ZFC or in axiomatic ZFCitself, the issues considered here remain hidden to a great extent.
In previous technical work ([1] and [2]) on which his present paper [3] draws, Benioff has presented results conforming with the following argument-scheme: First, if we construe Quantum Mechanics as making claims to the effect that infinite outcome sequences (generated by repeated measurements on a system for a given observable in a given state) be random; and second, if a strong definition of “random” is adopted in this construal, then certain models of Zermelo-Fraenkel set theory (ZF) cannot be “carriers for the mathematics of physics”. How interesting is this? One can approach the matter on two levels, the level of the specific technical results, and the level of more general implications of this pattern of argument for understanding connections between mathematics and physics. The second more general level should be our primary focus, but it will pay at the outset to look briefly at the technical level.
Abstract Nies and Scholz formalized the notion of an infinite qubitstring and referred to it as a ‘state’. They defined ‘quantum Martin-Löf randomness’ for states. We give a notion of measurement of a state in a computable basis and introduce ‘quantum measurement randomness’, a randomness notion for states. A state is quantum measurement random if measuring it in any computable basis yields a Martin-Löf random bitstring with probability one. Our main result is that quantum Martin-Löf randomness strictly implies quantum measurement randomness. This uses the construction of a quantum measurement random state which is not quantum Martin-Löf random. We prove two general results on which this construction relies: The first concerns Martin-Löf randomness relative to computable measures and extends a result of V. Vovk. The second is a combinatorial result about Kronecker products.
Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits and defined quantum-Martin-Lof randomness for states, analogously to the well known concept of Martin-L\"of randomness for elements of Cantor space (the space of infinite sequences of bits). We formalize how 'measurement' of a state in a basis induces a probability measure on Cantor space. A state is 'measurement random' (mR) if the measure induced by it, under any computable basis, assigns probability one to the set of Martin-L\"of randoms. Equivalently, a state is mR if and only if measuring it in any computable basis yields a Martin-L\"of random with probability one. While quantum-Martin-L\"of random states are mR, the converse fails: there is a mR state, x which is not quantum-Martin-L\"of random. In fact, something stronger is true. While x is computable and can be easily constructed, measuring it in any computable basis yields an arithmetically random sequence with probability one. I.e., classical arithmetic randomness can be generated from a computable, non-quantum random sequence of qubits.
Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces. We then show that random states form a convex set. Martin-Löf absolute continuity is shown to be a special case of q-MLR. Quantum Schnorr randomness is introduced. A quantum analog of the law of large numbers is shown to hold for quantum Schnorr random states.