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

Ultrametric Quantum Computing: Foundations, Evidence, and Falsifiable Predictions

Rowan Brad Quni-Gudzinas

Published May 15, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.20154557

Related papers

The Revolutionary Beginner's Guide to Quantum Computing: Why We Don't Have Quantum Computers Yet — and What the Geometric Alternative Offers

Rowan Brad Quni-Gudzinas

A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.

•May 26, 2026•0 citations

ULTRAMETRIC QUANTUM COMPUTATION

Rowan Brad Quni-Gudzinas

The persistent challenges in scaling conventional quantum computers suggest a potential misalignment in foundational assumptions. Assuming that physical reality is continuous at the lowest quantum levels forces engineers to fight against natural thermodynamic tendencies. The continuous error model demands an active correction paradigm that may be fundamentally unsustainable for large-scale computation. Alternative mathematical frameworks offer different geometric properties that could naturally suppress error accumulation. Exploring non-Archimedean geometries provides a pathway to bypass the limitations inherent in continuous state spaces. These alternative structures possess discrete topological features that fundamentally alter how errors propagate through a system. Shifting the mathematical foundation could resolve the scaling bottlenecks currently hindering quantum technology development.

•Apr 3, 2026•0 citations

ULTRAMETRIC QUANTUM COMPUTATION: An MVP Program for Passive Geometric Fault Tolerance

Rowan Brad Quni-Gudzinas

Purpose: Ultrametric quantum computation MVP program—a comprehensive case for passive geometric fault tolerance as the highest-leverage bet in quantum computing hardware. Audience: Program officers (DARPA, IARPA, DOE, NSF, ERC), laboratory directors, VC/corporate due diligence teams, experimental collaboration PIs. Principle: Every factual claim is accompanied by its source. Every number is traceable to its origin. Every calculation exposes its assumptions and arithmetic. Nothing is asserted without provenance. Compilation: This document synthesizes all prior research notes, technical monographs, engineering proposals, auditable editions, experimental execution plans, and numerical prediction analyses into a single comprehensive reference.

•May 3, 2026•0 citations

Practical Advances in Quantum Error Correction & Communication

Daniel Benjamin Criger

Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.

•Oct 25, 2013•1 citation

Efficient fault-tolerant quantum computing

Andrew M. Steane

Abstract Quantum computing1—the processing of information according to the fundamental laws of physics—offers a means to solve efficiently a small but significant set of classically intractable problems. Quantum computers are based on the controlled manipulation of entangled quantum states, which are extremely sensitive to noise and imprecision; active correction of errors must therefore be implemented without causing loss of coherence. Quantum error-correction theory2, 3, 4, 5, 6, 7, 8, 9 has made great progress in this regard, by predicting error-correcting ‘codeword’ quantum states. But the coding is inefficient and requires many quantum bits10, 11, 12, which results in physically unwieldy fault-tolerant quantum circuits10, 11, 12, 13, 14, 15, 16, 17, 18. Here I report a general technique for circumventing the trade-off between the achieved noise tolerance and the scale-up in computer size that is required to realize the error correction. I adapt the recovery operation (the process by which noise is suppressed through error detection and correction) to simultaneously correct errors and perform a useful measurement that drives the computation. The result is that a quantum computer need be only an order of magnitude larger than the logic device contained within it. For example, the physical scale-up factor10, 11 required to factorize a thousand-digit number is reduced from 1, 500 to 22, while preserving the original tolerated gate error rate (10−5) and memory noise per bit (10−7). The difficulty of realizing a useful quantum computer is therefore significantly reduced.

•Sep 18, 1998•127 citations

Quantum error correction and fault tolerance

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

Quantum computing has the capability to the solution of complex problems that classical systems are incapable of solving, but its practical application is crippled by the instability of quantum states. Trying to do quantum computations with quantum bits (qubits) is prone to decoherence, operational errors, and environmental noise, which can quickly lower computational accuracy. In this chapter, we discuss these issues by studying the theoretical basis and experimental techniques of the quantum error correction and fault-tolerant quantum computing. The key issue that has been recognized is the faithful storage and interaction of quantum information regardless of the fallible hardware and flawed hardware control systems. The aim of this chapter is to get a clear exposition of the principles of leading error correction codes, their implementation strategies, and the fault tolerance criteria. It also talks about threshold theorems, resource overheads and architectural considerations required to make quantum computation scalable. Through theoretical constructs as well as the latest advances, this chapter culminates on the idea that though the fault tolerance is still a resource intensive process in nature, it is theoretically plausible only within a certain limit of error margin. The most notable point is that the progress of quantum error correction and fault-tolerant quantum computing is used to design future quantum architectures that can transform the barriers of experiments to the needs of large-scale and reliable quantum computing.

CRC Press eBooks•Nov 6, 2026•0 citations
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.
A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.
The persistent challenges in scaling conventional quantum computers suggest a potential misalignment in foundational assumptions. Assuming that physical reality is continuous at the lowest quantum levels forces engineers to fight against natural thermodynamic tendencies. The continuous error model demands an active correction paradigm that may be fundamentally unsustainable for large-scale computation. Alternative mathematical frameworks offer different geometric properties that could naturally suppress error accumulation. Exploring non-Archimedean geometries provides a pathway to bypass the limitations inherent in continuous state spaces. These alternative structures possess discrete topological features that fundamentally alter how errors propagate through a system. Shifting the mathematical foundation could resolve the scaling bottlenecks currently hindering quantum technology development.
Purpose: Ultrametric quantum computation MVP program—a comprehensive case for passive geometric fault tolerance as the highest-leverage bet in quantum computing hardware. Audience: Program officers (DARPA, IARPA, DOE, NSF, ERC), laboratory directors, VC/corporate due diligence teams, experimental collaboration PIs. Principle: Every factual claim is accompanied by its source. Every number is traceable to its origin. Every calculation exposes its assumptions and arithmetic. Nothing is asserted without provenance. Compilation: This document synthesizes all prior research notes, technical monographs, engineering proposals, auditable editions, experimental execution plans, and numerical prediction analyses into a single comprehensive reference.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.
Abstract Quantum computing1—the processing of information according to the fundamental laws of physics—offers a means to solve efficiently a small but significant set of classically intractable problems. Quantum computers are based on the controlled manipulation of entangled quantum states, which are extremely sensitive to noise and imprecision; active correction of errors must therefore be implemented without causing loss of coherence. Quantum error-correction theory2, 3, 4, 5, 6, 7, 8, 9 has made great progress in this regard, by predicting error-correcting ‘codeword’ quantum states. But the coding is inefficient and requires many quantum bits10, 11, 12, which results in physically unwieldy fault-tolerant quantum circuits10, 11, 12, 13, 14, 15, 16, 17, 18. Here I report a general technique for circumventing the trade-off between the achieved noise tolerance and the scale-up in computer size that is required to realize the error correction. I adapt the recovery operation (the process by which noise is suppressed through error detection and correction) to simultaneously correct errors and perform a useful measurement that drives the computation. The result is that a quantum computer need be only an order of magnitude larger than the logic device contained within it. For example, the physical scale-up factor10, 11 required to factorize a thousand-digit number is reduced from 1, 500 to 22, while preserving the original tolerated gate error rate (10−5) and memory noise per bit (10−7). The difficulty of realizing a useful quantum computer is therefore significantly reduced.
Quantum computing has the capability to the solution of complex problems that classical systems are incapable of solving, but its practical application is crippled by the instability of quantum states. Trying to do quantum computations with quantum bits (qubits) is prone to decoherence, operational errors, and environmental noise, which can quickly lower computational accuracy. In this chapter, we discuss these issues by studying the theoretical basis and experimental techniques of the quantum error correction and fault-tolerant quantum computing. The key issue that has been recognized is the faithful storage and interaction of quantum information regardless of the fallible hardware and flawed hardware control systems. The aim of this chapter is to get a clear exposition of the principles of leading error correction codes, their implementation strategies, and the fault tolerance criteria. It also talks about threshold theorems, resource overheads and architectural considerations required to make quantum computation scalable. Through theoretical constructs as well as the latest advances, this chapter culminates on the idea that though the fault tolerance is still a resource intensive process in nature, it is theoretically plausible only within a certain limit of error margin. The most notable point is that the progress of quantum error correction and fault-tolerant quantum computing is used to design future quantum architectures that can transform the barriers of experiments to the needs of large-scale and reliable quantum computing.