Ultrametric Quantum Computing: Foundations, Evidence, and Falsifiable Predictions

Fuente: Zenodo
Enregistré dans:
Détails bibliographiques
Auteur principal: Quni-Gudzinas, Rowan Brad
Format: Recurso digital
Publié: Zenodo 2026
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866902063739305984
author Quni-Gudzinas, Rowan Brad
author_facet Quni-Gudzinas, Rowan Brad
contents <div> <div>Quantum computing is stalled. Despite decades of investment, no quantum computer has solved a problem that a classical computer cannot. The standard explanation — that we need better error correction — assumes the mathematical framework itself is correct. This document argues that the framework is not correct. The assumption that quantum state space is a continuous manifold — inherited from classical physics without scrutiny — may be the root cause of the field's stagnation. Replacing the continuous manifold with an ultrametric (tree-based) geometry provides passive fault tolerance: errors are geometrically confined rather than actively corrected. This document presents the mathematical foundations, computational validation results, and a set of pre-registered falsifiable predictions. If ultrametric encoding produces the predicted error suppression, it offers a path to fault-tolerant quantum computing at 4 K with dramatically reduced qubit overhead. If it does not, the hypothesis is falsified. Either outcome advances the field.</div> </div>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_20154558
institution Zenodo
language
publishDate 2026
publisher Zenodo
record_format zenodo
spellingShingle Ultrametric Quantum Computing: Foundations, Evidence, and Falsifiable Predictions
Quni-Gudzinas, Rowan Brad
<div> <div>Quantum computing is stalled. Despite decades of investment, no quantum computer has solved a problem that a classical computer cannot. The standard explanation — that we need better error correction — assumes the mathematical framework itself is correct. This document argues that the framework is not correct. The assumption that quantum state space is a continuous manifold — inherited from classical physics without scrutiny — may be the root cause of the field's stagnation. Replacing the continuous manifold with an ultrametric (tree-based) geometry provides passive fault tolerance: errors are geometrically confined rather than actively corrected. This document presents the mathematical foundations, computational validation results, and a set of pre-registered falsifiable predictions. If ultrametric encoding produces the predicted error suppression, it offers a path to fault-tolerant quantum computing at 4 K with dramatically reduced qubit overhead. If it does not, the hypothesis is falsified. Either outcome advances the field.</div> </div>
title Ultrametric Quantum Computing: Foundations, Evidence, and Falsifiable Predictions
url https://doi.org/10.5281/zenodo.20154558