Quantum Probability as an Application of Data Compression Principles
Allan F. Randall

TL;DR
This paper proposes that quantum probabilities can be understood through data compression principles, using algorithmic information theory to derive the Born rule from wavefunction amplitudes in a realist interpretation.
Contribution
It introduces a novel approach linking quantum probability to data compression and algorithmic information theory, addressing the probability problem in Everettian quantum mechanics.
Findings
Algorithmic probability provides a basis for quantum probabilities.
Quantum amplitudes are interpreted as coefficients in optimal data compression.
Changes in algorithmic information relate to phenomenal transitions.
Abstract
Realist, no-collapse interpretations of quantum mechanics, such as Everett's, face the probability problem: how to justify the norm-squared (Born) rule from the wavefunction alone. While any basis-independent measure can only be norm-squared (due to the Gleason-Busch Theorem) this fact conflicts with various popular, non-wavefunction-based phenomenological measures - such as observer, outcome or world counting - that are frequently demanded of Everettians. These alternatives conflict, however, with the wavefunction realism upon which Everett's approach rests, which seems to call for an objective, basis-independent measure based only on wavefunction amplitudes. The ability of quantum probabilities to destructively interfere with each other, however, makes it difficult to see how probabilities can be derived solely from amplitudes in an intuitively appealing way. I argue that the use of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
