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.
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.
The standard mathematical foundation of quantum computing—Archimedean (Euclidean) geometry—assumes that space is continuous, distances add linearly, and small errors can accumulate into large ones. This assumption creates a fundamental bottleneck: active quantum error correction generates heat that scales faster than cryogenic cooling capacity, producing a 20,000× gap between required and available cooling at millikelvin temperatures. We propose an alternative: encoding quantum states on Bruhat–Tits trees, the geometric realization of p-adic (ultrametric) spaces, where the strong triangle inequality d(x,z)≤max{d(x,y),d(y,z)} geometrically confines errors to their local branches. We present a computational validation suite (classical simulation) demonstrating this mechanism. Our results show that tree-encoded circuits produced zero observed logical errors in 500 trials at depths d≥3 for physical error rates up to perr=0.40, while equivalent flat (Archimedean) encodings failed with logical error rates up to 0.152. The energy barrier protecting logical states scales as Ebarrier(d)=2d, confirmed exhaustively for d=2,3 and computed analytically to d=10. The strong triangle inequality is verified with zero violations in 15,000 random trials across primes p=2,3,5. These results provide computational evidence for a geometric threshold theorem in ultrametric quantum error correction and suggest a path toward passive fault tolerance—error suppression as a property of hardware geometry rather than active measurement protocols. The simulation uses classical bits with majority-vote decoding; full quantum validation with superposition and entanglement remains future work.
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit.
We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.