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

A mathematical theory of randomized computation and its mathematical foundations

眞市 山田

Published Jan 1, 1988• 1 citation
OpenAlex

Related papers

A mathematical theory of randomized computation, I

Shinichi Yamada

Proceedings of the Japan Academy Series A Mathematical Sciences•Jan 1, 1988•2 citations

Probability And Randomness: Quantum Versus Classical

Andrei Yu. Khrennikov

"Creating a rigorous mathematical theory of randomness is far from being complete, even in the classical case. Interrelation of Classical and Quantum Randomness rectifies this and introduces mathematical formalisms of classical and quantum probability and randomness with brief discussion of their interrelation and interpretational and foundational issues. The book presents the essentials of classical approaches to randomness, enlightens their successes and problems, and then proceeds to essentials of quantum randomness. Its wide-ranging and comprehensive scope makes it suitable for researchers in mathematical physics, probability and statistics at any level"--

•Mar 3, 2016•34 citations

Theory of Computation

Salvador Elías Venegas-Andraca

Synthesis lectures on quantum computing•Jan 1, 2008•0 citations

Notes on the firewall paradox, complexity, and quantum theory

Karl-Georg Schlesinger

We investigate what it means to apply the solution, proposed to the firewall paradox by Harlow and Hayden, to the famous quantum paradoxes of Schödinger's Cat and Wigner's Friend if ones views these as posing a thermodynamic decoding problem (as does Hawking radiation in the firewall paradox). The implications might point to a relevance of the firewall paradox for the axiomatic and set theoretic foundations underlying mathematics. We reconsider in this context the results of Benioff on the foundational challenges posed by the randomness postulate of quantum theory. A central point in our discussion is that one can mathematically not naturally distinguish between computational complexity (as central to the approach of Harlow and Hayden and further developed by Susskind) and proof theoretic complexity (since they represent the same concept on a Turing machine), with the latter being related to a finite bound on Kolmogorov entropy (due to Chaitin incompleteness).

arXiv:1412.3146•Dec 8, 2014•0 citations

Elements of Classical Computation

Springer eBooks•Feb 2, 2007•0 citations

The Logical Standing of Unitarity in Wave Mechanics in Context of Quantum Randomness

Steve Faulkner

The homogeneity symmetry is re-examined and shown to be non-unitary. This is motivated by the prospect that logical independence in elementary algebra, entering quantum mathematics, will constitute the basis for a theory explaining quantum randomness. Keywords: foundations of quantum theory, quantum physics, quantum mechanics, wave mechanics, Canonical Commutation Relation, symmetry, homogeneity of space, unitary, non-unitary, unitarity, mathematical logic, formal system, elementary algebra, information, axioms, mathematical propositions, logical independence, quantum indeterminacy, quantum randomness.

•Sep 1, 2015•0 citations
"Creating a rigorous mathematical theory of randomness is far from being complete, even in the classical case. Interrelation of Classical and Quantum Randomness rectifies this and introduces mathematical formalisms of classical and quantum probability and randomness with brief discussion of their interrelation and interpretational and foundational issues. The book presents the essentials of classical approaches to randomness, enlightens their successes and problems, and then proceeds to essentials of quantum randomness. Its wide-ranging and comprehensive scope makes it suitable for researchers in mathematical physics, probability and statistics at any level"--
We investigate what it means to apply the solution, proposed to the firewall paradox by Harlow and Hayden, to the famous quantum paradoxes of Schödinger's Cat and Wigner's Friend if ones views these as posing a thermodynamic decoding problem (as does Hawking radiation in the firewall paradox). The implications might point to a relevance of the firewall paradox for the axiomatic and set theoretic foundations underlying mathematics. We reconsider in this context the results of Benioff on the foundational challenges posed by the randomness postulate of quantum theory. A central point in our discussion is that one can mathematically not naturally distinguish between computational complexity (as central to the approach of Harlow and Hayden and further developed by Susskind) and proof theoretic complexity (since they represent the same concept on a Turing machine), with the latter being related to a finite bound on Kolmogorov entropy (due to Chaitin incompleteness).
The homogeneity symmetry is re-examined and shown to be non-unitary. This is motivated by the prospect that logical independence in elementary algebra, entering quantum mathematics, will constitute the basis for a theory explaining quantum randomness. Keywords: foundations of quantum theory, quantum physics, quantum mechanics, wave mechanics, Canonical Commutation Relation, symmetry, homogeneity of space, unitary, non-unitary, unitarity, mathematical logic, formal system, elementary algebra, information, axioms, mathematical propositions, logical independence, quantum indeterminacy, quantum randomness.