REVIEW 4 major objections 6 minor 24 references
Algorithmic Idealism III: "Algorithmic State" Formulation of Quantum Mechanics
T0 review · 4 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash
Pith's one-line read The paper claims that quantum mechanics is what a utility-maximizing agent's optimal prediction of its own future self-states looks like, with measurement, entanglement, and quantum probability explained as informational updates rather…
desk verdict A ten-postulate wrapper for standard QM whose central bridge equation is asserted, not derived; worth a referee but not publication. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the self-state $S_t$, the agent's total informational configuration, together with the algorithmic transition probability $P(S_{t+1}|S_t,A_t)\propto 2^{-K(S_{t+1}|S_t,A_t)}$, where $K$ is conditional Kolmogorov complexity. Solomonoff induction (the algorithmic-probability rule that weights hypotheses by $2^{-K(h)}$) is the named mechanism: simpler hypotheses about the environment are assigned exponentially larger prior weight, and the agent's policy chooses actions that maximize expected discounted reward. The argument's hinge is Eq. (37), which asserts that Born-rule probabilities are exactly the utility-weighted algorithmic sum over successors; all ten postulates are organized around making that identification, with an idealized reinforcement-learning agent that combines algorithmic probability with utility maximization as the model of what a self-state is.
What would settle it
Take a single qubit and try to find any bounded utility function $U$ for which Eq. (37) reproduces $|\langle O|\psi\rangle|^2$ at every measurement angle while remaining normalized; a single angle where the two disagree, or a proof that no such $U$ can yield sinusoidal probabilities, would refute the central identification.
Extended reading notes
Core claim
On the paper's own terms, the discovery is that the full phenomenology of quantum mechanics—states, unitary evolution, measurement, entanglement, and probability—can be restated as the behavior of an idealized utility-maximizing agent whose prior over futures is algorithmic probability. The central identification is the Born rule: the probability of observing $O_t$ from self-state $S_t$ is asserted to be $P(O_t|S_t)=\sum_{S_{t+1}}2^{-K(S_{t+1}|S_t)}U(S_{t+1}|S_t)$, a utility-weighted sum over algorithmically simple successor states, and the author takes this to explain why quantum probabilities have the amplitudes-squared form. Measurement is presented as Bayesian updating without collapse; entanglement is presented as shared utility information optimized jointly by subsystems; physical laws are presented as stable regularities in reward dynamics. The paper then shows that the usual CHSH calculation gives $2\sqrt{2}$ for the Bell state and that Schrodinger's cat has von Neumann entropy $S(\rho_{\rm cat})=1$ bit, presenting these as illustrations that the reinterpretation reproduces standard quantum results.
Load-bearing premise
The load-bearing premise is that there exists a way of assigning 'usefulness' to possible future states such that an agent's simplicity-weighted predictions come out exactly equal to the standard quantum probabilities; the paper asserts this equality rather than constructing the usefulness function or proving the sum behaves like a probability.
Editorial extensions
If this is right
- The measurement problem would dissolve: 'collapse' becomes an ordinary Bayesian update of an agent's model, so no physical wavefunction collapse mechanism is needed.
- The Born rule would stop being a primitive axiom and become a corollary of the optimal-prediction principle, which would change how quantum theory is axiomatized.
- Bell-inequality violation would be read as shared utility optimization across subsystems rather than as nonlocal physical influence, so no faster-than-light signaling is implied.
- Conservation laws and symmetries would be understood as stable regularities of reward-invariant self-state transitions, placing algorithmic information theory beneath dynamical physics.
- Simulated and base realities would be treated as equivalent informational structures, so the simulation hypothesis would cease to be a physically distinguishing claim.
Reading between the lines
- A natural test of the framework is to reverse-engineer the utility function: measurable Born-rule statistics for a simple system would constrain $U(S_{t+1}|S_t)$, and no consistent function over a family of measurement settings would count as evidence against the identification.
- The same machinery should reproduce the classical limit: if measurement is Bayesian updating under an algorithmic prior, decoherence and the emergence of classical probabilities should be derivable from the utility-weighted sum, which the paper leaves as a program rather than a derivation.
- The entanglement-as-joint-utility reading suggests a quantitative check on where quantum correlations end: modeling two agents that share a common algorithmic prior and asking whether the resulting correlations reach the Tsirelson bound $2\sqrt{2}$ or only a weaker value would test whether the framework actually implies quantum nonlocality or merely accommodates it.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes 'Algorithmic Idealism III', a framework intended to reinterpret quantum mechanics as arising from algorithmic probability, utility maximization, and agent-environment feedback loops. It states ten postulates that recast measurement, entanglement, and quantum probabilities in informational terms, and it claims that physical laws, including the Born rule and Bell correlations, emerge from these computational principles. The mathematical sections introduce self-states, algorithmic transition probabilities, utility-weighted predictions, and then apply these ideas to the Bell CHSH inequality and Schrödinger's cat. The central claim is that quantum mechanics is the optimal algorithm for encoding and evolving informational states, with probabilities and entanglement explained as utility-weighted predictions and shared utility information.
Significance. If the claimed derivation were correct, the framework would offer a genuinely novel unification of quantum mechanics with algorithmic information theory and decision theory, with potential implications for the philosophy of physics and for interpretations of quantum probability. The paper is clearly written in its exposition of the postulates and situates itself within the literature on informational reconstructions of quantum theory. However, the significance currently rests entirely on a missing derivation: the key equations connecting algorithmic priors and utility to Born-rule probabilities are asserted, not proven. The paper does not provide machine-checked proofs, reproducible code, or a concrete construction of the utility function that would realize quantum probabilities, so its central forward-looking claim is unsupported.
major comments (4)
- [§4.5, Eq. (37)] The claimed bridge to quantum probabilities is not derived and does not define a probability measure. The right-hand side of Eq. (37), P(Ot|St) = Σ_{St+1} 2^{-K(St+1|St)} U(St+1|St), is asserted to be the probability of observing Ot, but U(St+1|St) as defined in Eq. (34) is an expected utility, not a likelihood; it need not be nonnegative, bounded, or normalized over outcomes. No proof is given that this expression sums to 1 over distinct outcomes Ot, nor that it equals |⟨Ot|ψt⟩|². Eq. (35) simply asserts the Born rule without connecting it to Eq. (37). Without a construction of U and a proof of these properties, the central claim that quantum probabilities emerge from algorithmic priors and utility is unsupported.
- [§4.1, §4.4, §4.6, §4.7, §5] The manuscript imports the full Hilbert-space formalism and the Born rule as assumptions and then presents these same objects as outputs of the framework. Eqs. (3), (30), (35), (42), (52), and (76) all use |⟨O|ψ⟩|² directly; Eqs. (6) and (7) assume unitary evolution and the Schrödinger equation. No mapping is given from the computational self-states St to Hilbert-space vectors, and no definition of K(St+1|St) is provided for a concrete physical model. Consequently, the framework does not derive quantum mechanics; it assumes quantum mechanics and then re-labels its ingredients. This circularity undermines the abstract's claim that physical laws are 'shown to emerge' from algorithmic constraints.
- [§5, Eqs. (75)–(81)] The Bell inequality violation section reproduces the standard CHSH calculation without using the framework's proposed probability expression. Eq. (76) again invokes the Born rule, and Eq. (77) uses the standard quantum expectation value ⟨ψ|A⊗B|ψ⟩. The calculation of −cos(θA−θB) and the resulting 2√2 are textbook quantum mechanics. The statements that shared utility or algorithmic complexity 'leads to nonlocality' are post hoc verbal explanations, not derivations from Eq. (37) or from any framework-specific quantity. Thus this section does not demonstrate that Algorithmic Idealism explains Bell correlations.
- [§3.3–§3.4, §4.4] Postulate 4 (Section 3.4) is a verbatim duplicate of Postulate 3 (Section 3.3), which is a presentation error. More substantively, Eq. (31) in Section 4.4 embeds the Born rule inside the Bayesian update, so 'measurement as Bayesian updating' presupposes the very quantum probabilities it is meant to explain. The update rule therefore cannot serve as a derivation of measurement probabilities from algorithmic priors alone.
minor comments (6)
- [§3.4] The text of Postulate 4 is identical to that of Postulate 3; one of the two postulates should be removed or given distinct content.
- [§8.2.5] There is a typo in the final paragraph of Section 8.2.5: 'electrenergy' should be 'electron energy' or 'energy transfer'.
- [References] Reference [5] combines two separate Zurek papers into one entry, and several references lack page numbers or complete publication details; this should be cleaned up.
- [§8] The Outlook section on the evolution of photosynthetic reaction centers is unrelated to the paper's stated topic of quantum mechanics and appears to be a speculative autobiographical addendum; it should be removed or clearly separated as speculative future work.
- [Abstract and §7] The abstract and summary claim that physical laws 'emerge' and that quantum mechanics is 'the optimal algorithm', but no optimality theorem or derivation is presented; the claims should be tempered to match what is actually proven.
- [Notation throughout] The symbol St is used both for a self-state and as an element of a Hilbert space (e.g., St ∈ H in §4.1), conflating computational states with quantum states; a clear distinction between these two levels would improve readability.
Circularity Check
The claimed derivation reduces to restating the Born rule and standard Bell-state QM: Eqs. (3), (35), and (76) import the quantum probability rule, and Eq. (37) is never shown to reproduce it.
-
renaming known result
[Section 4.1, Eq. (3); reused in Section 4.4, Eq. (30)]
"In quantum mechanics, P (Ot|St+1) is derived from the Born rule: P (Ot|St+1) = |⟨Ot|St+1⟩|2, (3) ... Upon observing Ot, the agent updates its belief ... P (Ot|St) = |⟨Ot|ψt⟩|2. (30)"
The Born rule is written in as an input of the measurement update, not derived from algorithmic probability or utility. Later sections present it as the framework's account of quantum probabilities. The central claimed output is therefore identical to the input.
-
renaming known result
[Section 4.5, Eqs. (35) and (37)]
"If |ψt⟩ represents the agent’s probabilistic model of its self-state, the probability of observing Ot is: P(Ot|St)=|⟨Ot|ψt⟩|2, (35) ... Combining algorithmic priors and utility predictions, the probability of observing Ot is derived as: P(Ot|St)=Σ_{St+1} 2^{−K(St+1|St)}U(St+1|St). (37)"
Eq. (35) asserts the ordinary Born rule. Eq. (37) is labeled as the derivation from algorithmic priors and utility, but no proof is given that the algorithmic-weight sum equals |⟨O|ψ⟩|², nor that it is normalized. The utility function U is never constructed. The 'utility-weighted prediction' is a new name attached to the same expression, not an independent derivation.
1 more flagged steps
-
renaming known result
[Section 5, Eqs. (76)-(81)]
"Using the entangled state framework from Postulates 6 and 7, the article expresses joint probabilities as: P(OA,OB|SAB)=|⟨OA,OB|ψAB⟩|2, (76) ... For the Bell state ... E(A,B)=⟨ψAB|A⊗B|ψAB⟩. (77) ... Using the quantum prediction ... = 2√2. (81)"
The Bell-CHSH violation is computed with the standard quantum Born rule and Bell-state expectation values. No term involving algorithmic complexity K, utility U, or self-state transitions enters the numerical calculation. The 'prediction' that quantum mechanics violates Bell inequalities is the standard input, not a consequence of the proposed framework.
full rationale
The paper's central claim is that quantum mechanics emerges from algorithmic simplicity and utility maximization. In the mathematical development, however, the quantum formalism is presupposed: self-states are placed in a Hilbert space, unitary evolution is identified with the Schrödinger equation, and measurement probabilities are set equal to the Born rule (Eqs. (3), (30), (35)). The promised bridge Eq. (37) is asserted without a proof of equivalence or normalization, and no concrete U reproducing |⟨O|ψ⟩|² is supplied. The Bell and Schrödinger-cat sections likewise reuse standard quantum computations unchanged. I do not count the authors' self-citations as the main problem; the circularity is that the framework's central explanatory outputs are the same equations it takes as postulates. There is no external benchmark or independent derivation against which the claimed unification could be tested. Score 8 reflects a central claim that reduces by restatement while still leaving open the possibility that a future construction of U could add content.
Assumptions & free parameters
assumptions (5)
- domain assumption Reality is a computational process and self-state transitions are governed by conditional Kolmogorov complexity.
- domain assumption The Hilbert space formalism of quantum mechanics, including the Born rule, is assumed as the correct description of observations.
- ad hoc to paper A utility/reward function U exists such that utility-weighted algorithmic priors equal quantum probabilities.
- ad hoc to paper Entanglement is equivalent to shared utility information between subsystems.
- domain assumption Agents maximize expected discounted utility in the AIXI style.
invented entities (1)
-
Self-state S_t
Cite this review
Pith. "Pith review of Algorithmic Idealism III: "Algorithmic State" Formulation of Quantum Mechanics." pith.science (2026). https://pith.science/paper/QFNXTUTV
@misc{pith2026250208653,
author = {Pith},
title = {Pith review of: Algorithmic Idealism III: "Algorithmic State" Formulation of Quantum Mechanics},
year = {2026},
howpublished = {\url{https://pith.science/paper/QFNXTUTV}},
note = {Machine review of arXiv:2502.08653}
}
read the original abstract
This work introduces Algorithmic Idealism a framework that reinterprets quantum mechanics as a computational process governed by algorithmic probability informational simplicity and utility optimization Reality is modeled as an agentenvironment feedback loop where agents maximize utility by predicting selfstate transitions Core quantum phenomena such as measurement entanglement and probabilities are explained through informational constructs The paper presents a set of quantum mechanics postulates inspired by this framework and explains their mathematical meaning in detail These postulates include measurement as Bayesian updating entanglement as joint utility optimization and quantum probabilities as utilityweighted predictions Physical laws are shown to emerge as informational regularities from algorithmic constraints By defining identity through decisionmaking consistency and treating simulated and base realities as indistinguishable the framework also resolves philosophical questions about identity and reality This approach unifies quantum mechanics with computational theory offering a novel perspective on foundational physics and its connection to information and computation
Reference graph
Works this paper leans on
-
[1]
J. A. Wheeler, Information, Physics, Quantum: The Search for Links . In W. H. Zurek (Ed.), Complexity, Entropy, and the Physics of Information . Addison-Wesley, Redwood City, 1990. A vailable online
work page 1990
-
[2]
Everett III, Hugh. ""Relative State" Formulation of Qua ntum Mechanics." Reviews of Mod- ern Physics 29.3 (1957): 454. A vailable online
work page 1957
-
[3]
Information and the Reconstruction of Quantum Physics
Jaeger, Gregg. Information and the Reconstruction of Quantum Physics . Annalen der Physik, 531(3), 2019. A vailable online
work page 2019
-
[4]
Bekenstein, J. D. Black Holes and Entropy . Physical Review D, 7(8), 1973, pp. 2333–2346. A vailable online
work page 1973
-
[5]
W. H. Zurek, Decoherence and the Transition from Quantum to Classical . Physics To- day, 44(10), 1989, pp. 36–44 and Zurek, Wojciech Hubert. "Qu antum Darwinism." Nature Physics 5.3 (2009): 181-188. A vailable online
work page 2009
-
[6]
Rovelli, Carlo. "Relational Quantum Mechanics." International Journal of Theoretical Physics 35 (1996): 1637-1678. A vailable online
work page 1996
-
[7]
Pro posed Experiment to Test Local Hidden-Variable Theories,
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Pro posed Experiment to Test Local Hidden-Variable Theories,” Physical Review Letters , vol. 23, pp. 880–884, 1969. doi: 10.1103/PhysRevLett.23.880
-
[8]
Character izing Quantum Theory in Terms of Information-Theoretic Constraints
Clifton, Rob, Jeffrey Bub, and Hans Halvorson. "Character izing Quantum Theory in Terms of Information-Theoretic Constraints." Foundations of Physics 33.11 (2003): 1561-1591. A vailable online
work page 2003
Show all 24 references
-
[9]
Bell’s Theorem: Experiment al Tests and Im- plications,
J. F. Clauser and A. Shimony, “Bell’s Theorem: Experiment al Tests and Im- plications,” Reports on Progress in Physics , vol. 41, pp. 1881–1901, 1978. doi: 10.1088/0034-4885/41/12/002
1901 doi
-
[10]
Algorithmic Idealism: What Should You Believe to Experienc e Next? arXiv preprint arXiv:2412.02826 (2024)
Müller, Markus P. Algorithmic Idealism: What Should You Believe to Experienc e Next? arXiv preprint arXiv:2412.02826 (2024). A vailable online
2024
-
[11]
Law without Law: From Observer States to Physics via Algorit hmic Information Theory
Müller, Markus P. Law without Law: From Observer States to Physics via Algorit hmic Information Theory. New Journal of Physics 22, no. 3 (2020): 033001. A vailable online. 28
2020
-
[12]
Algorithmic Idealism I: Reconceptualizing Reality Throug h Information and Experience
Sienicki, Krzysztof. Algorithmic Idealism I: Reconceptualizing Reality Throug h Information and Experience. arXiv preprint arXiv:2412.20485 (2024). A vailable online
2024 arXiv
-
[13]
Algorithmic Idealism II: Reass essment of Competing Theories
Sienicki, Krzysztof. "Algorithmic Idealism II: Reass essment of Competing Theories." arXiv preprint arXiv:2501.00022 (2024). A vailable online
2024 arXiv
-
[14]
A Derivation of Q uantum Theory from Physical Requirements
Masanes, Lluis, and Markus P. Müller. "A Derivation of Q uantum Theory from Physical Requirements." New Journal of Physics 13.6 (2011): 063001. A vailable online
2011
-
[15]
The Universe as Quantum Computer
Lloyd, Seth. "The Universe as Quantum Computer." A Computable Universe: Understand- ing and Exploring Nature as Computation (2013): 567-581. A vailable online
2013
-
[16]
Is the universe a computer
Weinberg, Steven. "Is the universe a computer." The New York review of books 49.16 (2002): 43-47
2002
-
[17]
The Universe is not a Computer
Wharton, Ken. "The Universe is not a Computer." Questioning the Foundations of Physics: Which of Our Fundamental Assumptions Are Wrong? . Cham: Springer International Pub- lishing, 2015. 177-189. A vailable online
2015
-
[18]
A Computer Scientist’s View of L ife, the Universe, and Every- thing
Schmidhuber, Jürgen. "A Computer Scientist’s View of L ife, the Universe, and Every- thing." Foundations of Computer Science: Potential—Theory—Cogni tion (2006): 201-208. A vailable online
2006
-
[19]
Philosophy of Quantum Information and Entangle- ment
Bokulich, Alisa, and Gregg Jaeger, eds. Philosophy of Quantum Information and Entangle- ment. Cambridge University Press, 2010. A vailable online
2010
-
[20]
Quantum Nonloca lity as an Axiom
Popescu, Sandu, and Daniel Rohrlich. "Quantum Nonloca lity as an Axiom." Foundations of Physics 24.3 (1994): 379-385. A vailable online
1994
-
[21]
Space-Time Approach to No n-Relativistic Quantum Mechan- ics
Feynman, Richard Phillips. "Space-Time Approach to No n-Relativistic Quantum Mechan- ics." Reviews of Modern Physics 20.2 (1948): 367. A vailable online
1948
-
[22]
Group Theoretic Structures in th e Estimation of an Unknown Unitary Transformation
Chiribella, Giulio. "Group Theoretic Structures in th e Estimation of an Unknown Unitary Transformation." Journal of Physics: Conference Series , Vol. 284, No. 1, IOP Publishing,
-
[23]
Probability Theories in General and Qu antum Theory in Particular
Hardy, Lucién. "Probability Theories in General and Qu antum Theory in Particular." Stud- ies in History and Philosophy of Science Part B: Studies in Hi story and Philosophy of Modern Physics 34.3 (2003): 381-393. A vailable online
2003
-
[24]
On Hidden Variables and Quantum Mech anical Probabilities
Wigner, Eugene P. "On Hidden Variables and Quantum Mech anical Probabilities." Part I: Particles and Fields. Part II: Foundations of Quantum Mec hanics (1997): 515-523. A vailable online. 29
1997
Reviewed August 10, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.