Abstract: We establish a universal mathematical theorem and verified computational suite for aligning arbitrary physical noise to a common logical action across general stabilizer architectures. For any [[n,k,d]] stabilizer code encoding a K=2^k dimensional logical system via isometry W: \mathcal{H}_L \rightarrow \mathcal{H}_P, and defining the correction radius t = \lfloor(d-1)/2\rfloor, every completely positive trace-preserving (CPTP) Stinespring noise process supported on any selected set of at most t physical qubits is proved to be exactly correctable. Rather than presupposing pre-aligned Kraus branches, the framework expands local physical operators in the complete Pauli basis, derives the Knill-Laflamme scalar matrix from code distance, and Gram-diagonalizes the resulting error-image matrix. This constructs orthogonal syndrome isometries Q_r that satisfy the derived common-action identity: Q_r^\dagger A_\mu W = \beta_{\mu r} I_L This dynamic factorization separates the logical state from the syndrome and environment: (D \otimes I_E) V W |\psi\rangle = |\psi\rangle_L \otimes |\Xi\rangle_{SE} The recovery identity \mathcal{R} \circ \mathcal{N} \circ \text{Enc} = \text{Enc} is rigorously validated across operator spaces, ancilla-complete entanglements, arbitrary-depth circuits, and generator-level suppression of local GKSL dynamics (\mathcal{R}_L[\mathcal{L}_{\text{phys}}(\text{Enc}(\rho_L))] = 0). A centered physical channel featuring distinct branches (I, X_q, Z_q) and amplitudes (1/3, +2/3, -2/3) provides an exact squared completeness of 1/9 + 4/9 + 4/9 = 1. The accompanying open-source NumPy suite (tibedo_v4_arbitrary_qubit_alignment_suite.py) provides an executable certification engine for arbitrary user-supplied stabilizer generators. Evaluated on the [[5,1,3]] perfect code and [[7,1,3]] Steane code, all 16 core theorem tests passed alongside 64 randomized stress trials through corrected circuit depth 32, yielding pristine residuals ranging from 2.22 \times 10^{-16} to 3.03 \times 10^{-14}. As the theorem proves, the commercial opportunity for a quantum sector shifts entirely from physical manufacturing to the epistemological layer: mastery over problem representation and architectural compilation. Without this specialized knowledge, a hardware firm possessing a theoretically fault-tolerant physical machine is left with an empty shell—an advanced engine with no operational map. They are entirely dependent on the underlying mathematical framework to achieve exact circuit closure (\mathcal{R} \circ \mathcal{N} \circ \text{Enc} = \text{Enc}) and generator-level suppression of arbitrary local GKSL data (\mathcal{R}_L[\mathcal{L}_{\text{phys}}(\text{Enc}(\rho_L))] = 0). True commercial leverage and sales dominance concentrate within the hands of entities that command the mathematical representation layer. Knowledge of how to structure error-correcting codes, derive syndrome isometries without heuristic Kraus proportionalities, and preserve logical coherence across arbitrary circuit depths becomes the ultimate arbiter of value in the post-NISQ economy.
Abstract: We establish a universal mathematical theorem and verified computational suite for aligning arbitrary physical noise to a common logical action across general stabilizer architectures. For any [[n,k,d]] stabilizer code encoding a K=2^k dimensional logical system via isometry W: \mathcal{H}L \rightarrow \mathcal{H}P, and defining the correction radius t = \lfloor(d-1)/2\rfloor, every completely positive trace-preserving (CPTP) Stinespring noise process supported on any selected set of at most t physical qubits is proved to be exactly correctable. Rather than presupposing pre-aligned Kraus branches, the framework expands local physical operators in the complete Pauli basis, derives the Knill-Laflamme scalar matrix from code distance, and Gram-diagonalizes the resulting error-image matrix. This constructs orthogonal syndrome isometries Q_r that satisfy the derived common-action identity: Q_r^\dagger A\mu W = \beta{\mu r} I_L This dynamic factorization separates the logical state from the syndrome and environment: (D \otimes I_E) V W |\psi\rangle = |\psi\rangle_L \otimes |\Xi\rangle_{SE} The recovery identity \mathcal{R} \circ \mathcal{N} \circ \text{Enc} = \text{Enc} is rigorously validated across operator spaces, ancilla-complete entanglements, arbitrary-depth circuits, and generator-level suppression of local GKSL dynamics (\mathcal{R}L[\mathcal{L}{\text{phys}}(\text{Enc}(\rho_L))] = 0). A centered physical channel featuring distinct branches (I, X_q, Z_q) and amplitudes (1/3, +2/3, -2/3) provides an exact squared completeness of 1/9 + 4/9 + 4/9 = 1. The accompanying open-source NumPy suite (tibedo_v4_arbitrary_qubit_alignment_suite.py) provides an executable certification engine for arbitrary user-supplied stabilizer generators. Evaluated on the [[5,1,3]] perfect code and [[7,1,3]] Steane code, all 16 core theorem tests passed alongside 64 randomized stress trials through corrected circuit depth 32, yielding pristine residuals ranging from 2.22 \times 10^{-16} to 3.03 \times 10^{-14}. As the theorem proves, the commercial opportunity for a quantum sector shifts entirely from physical manufacturing to the epistemological layer: mastery over problem representation and architectural compilation. Without this specialized knowledge, a hardware firm possessing a theoretically fault-tolerant physical machine is left with an empty shell—an advanced engine with no operational map. They are entirely dependent on the underlying mathematical framework to achieve exact circuit closure (\mathcal{R} \circ \mathcal{N} \circ \text{Enc} = \text{Enc}) and generator-level suppression of arbitrary local GKSL data (\mathcal{R}L[\mathcal{L}{\text{phys}}(\text{Enc}(\rho_L))] = 0). True commercial leverage and sales dominance concentrate within the hands of entities that command the mathematical representation layer. Knowledge of how to structure error-correcting codes, derive syndrome isometries without heuristic Kraus proportionalities, and preserve logical coherence across arbitrary circuit depths becomes the ultimate arbiter of value in the post-NISQ economy.
Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of ⌈d/2⌉ for distance-d codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed T gate on the [[16,4,4]] BB code, T-type rotations on the [[64,8,8]] BB code, and CCZ-, CS-, and T-type operations on the [[36,6,6]] Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields CrZ gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.
We present a unified algebraic theory of Clifford spacetime quantum fault tolerance, which underpins universal fault-tolerant quantum computation. We construct a spacetime chain complex from a tensor network representation of a circuit that encodes fault propagation, detector syndromes, and logical actions through the associated gauge and stabilizer structure. We show that this theory (1) unifies various formulations of quantum fault tolerance including spacetime codes, Gottesman's gadget framework, fault complexes, and ZX calculus; (2) connects spacetime distances to the gadget-level correctness properties in Gottesman's formalism; (3) naturally accommodates a range of fault models, in particular phenomenological and circuit-level models, bringing these often separately formulated descriptions into a common algebraic framework through different tensor decompositions and fault assignments; and (4) recovers many known fault tolerance constructions and results as special cases, including repeated syndrome extraction, correlated detectors for transversal and fold-transversal gates, Steane- and Knill-type syndrome extraction gadgets, and single-shot error correction.
Quantum error correction is the art of protecting fragile quantum information through suitable encoding and active interventions. After encoding k logical qubits into n>k physical qubits using a stabilizer code, this amounts to measuring stabilizers, decoding syndromes, and applying an appropriate correction. Although quantum information can be protected in this way, it is notoriously difficult to manipulate encoded quantum data without introducing uncorrectable errors. Here, we introduce a mathematical framework for constructing hardware-tailored quantum circuits that implement any desired Clifford unitary on the logical level of any given stabilizer code. Our main contribution is the formulation of this task as a discrete optimization problem. We can explicitly integrate arbitrary hardware connectivity constraints. As a key feature, our framework naturally incorporates an optimization over all Clifford gauges (differing only in their action outside the code space) of a desired logical circuit. In this way, we find, for example, fault-tolerant and teleportation-free logical Hadamard circuits for the [[8,3,2]] code. From a broader perspective, we turn away from the standard generator decomposition approach and instead focus on the holistic compilation of entire logical circuits, leading to significant savings in practice. Our work introduces both the necessary mathematics and open-source software to compile hardware-tailored logical Clifford circuits for stabilizer codes.
We develop a decoder-agnostic logical-class diagnostic layer for abelian Pauli stabilizer codes, motivated by fault-tolerant quantum computing. An ancilla fermionic register defines a nilpotent supercharge whose clean degree-zero harmonic sector is the code space. Projected-return blocks derived from graded commutators organize the recovery test of whether a decoder-selected correction preserves every encoded input for every error in a declared same-syndrome family; the passing syndromes form the certified faithful window. Demoting the supercharge to an exact binary diagnostic formulation classifies residuals modulo stabilizers, separating a check violation, a harmless stabilizer residual, and a syndrome-silent nontrivial logical action, with a two-sector form for CSS codes. Because the unknown fault cancels, the relative logical class of two record-compatible candidates is computable online. We verify the diagnostic formalisms on the Steane code and specify a static--circuit bridge audit protocol for the Gross bivariate-bicycle quantum low-density parity-check (qLDPC) code. The method supplements existing decoders without additional physical qubits for software use.
We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to fault-tolerant quantum computing. Phase 5 of ITU established that bulk locality in AdS/CFT is mathematically equivalent to a quantum error correction code (QECC); here we exploit the reverse direction — using the ITU axiom δS = δ⟨K⟩ to derive optimal QECC architectures for practical quantum computation. This is a Tier 1 application paper, complementary to the Tier 0 core ITU theory. It is the first in a planned series of focused application papers (ITU + AI, ITU + cancer biology, ITU + economics, etc.), each as an independent Zenodo deposit linked via isSupplementTo relations to the core ITU concept DOI. Phase 43: [[5,1,3]] perfect quantum code — the discrete realization of bulk locality in AdS₃/CFT₂ (Pastawski-Yoshida-Harlow-Preskill HaPPY code building block) — verified as a complete fault-tolerant primitive: 4 stabilizers, code distance d = 3, all 15 single-qubit Pauli errors yield distinct syndromes, decoder lookup table of size 16 maps every syndrome to its corrective operation, and the encoded logical error rate is below the bare-qubit rate at physical error rates up to 25%. Phase 44: Toric/surface code threshold simulated for L = 3, 5, 7 (18, 50, 98 qubits) under independent bit-flip noise. Empirical threshold p_c ≈ 0.045 with a greedy nearest-neighbor decoder (theoretical perfect-MWPM threshold ~0.103); exponential error suppression with lattice size confirmed. The toric code is the discrete realization of AdS₃/CFT₂ bulk locality at finite size. Phase 45: Magic state distillation (Bravyi-Kitaev 5-to-1 protocol) verified using the same [[5,1,3]] code from Phase 43. Fit slope = 1.98 (theoretical 2.0; quadratic suppression confirmed), coefficient c ≈ 10, threshold ε_th ≈ 0.129. Iterated distillation converges to machine precision (10⁻¹⁶) in 4-6 rounds below threshold. This completes the path from Clifford to universal fault-tolerant computation. Phase 46: NISQ-era resource estimates for 11 hardware platforms (IBM Heron R1, IBM Condor, IBM Flamingo, IBM Kookaburra, Google Willow, Google projected 2026, IonQ Forte, IonQ Tempo, Quantinuum H2, Quantinuum H3 projected, Rigetti Ankaa-3). At physical error rate p = 10⁻³ (current best), standard surface code requires distance d = 11 (302 physical qubits per logical qubit). A hypothetical ITU-optimised code with 2× threshold improvement reduces this to d = 9 (202 physical qubits per logical qubit), a 40-60% overhead reduction. IBM Kookaburra (2026, 4158 qubits) is projected to support 13 logical qubits with standard codes, 20 with ITU-optimised codes. Central thesis: the same single information-theoretic axiom that yields emergent spacetime (ITU Phases 1-32), life (Phases 33-39), and consciousness (Phases 41-42) also yields practical quantum-computing primitives ready for near-term hardware deployment. ITU is not merely a theoretical TOE but a constructive framework that can be applied to engineering problems. Includes 4 theory documents (Markdown), 4 Python numerical experiments, 4 result figures, 4 JSON summaries, paper metadata (CITATION.cff, .zenodo.json, README). Total runtime ~30 seconds on a modern laptop.