Geometric Origin of Noise Bias and Parity Collapse in Quantized 11-Space (I11) as Underlying Structure of "Unfolded Distillation" in Biased Cat-Qubit Architectures
Priority Note on Scale Invariant Deterministic Error Suppression Derived from the I11 Symmetry Logic Description: This priority note documents the first formulation of a deterministic mechanism for error suppression that arises directly from the internal symmetry of the quantized number space I11. The key insight is the introduction of the 1 divided by N normalization rule, which creates a half step reflection symmetry and divides all possible drift processes into two distinct parity sectors. This structure explains why phase preserving processes dominate while parity flipping processes are exponentially suppressed. The resulting error bias is not hardware dependent but follows from the intrinsic I11 geometry. This work establishes that the same symmetry logic underlying the I11 space also produces the specific form of biased noise and coherence enhancement observed in modern cat qubit architectures. The deterministic rotation angles and the stability ladder predicted by the I11 model match the operational structure used in contemporary folded and unfolded magic state distillation schemes, including those described in the 2025 Alice and Bob publication “Unfolded distillation: very low cost magic state preparation for biased noise qubits” (arXiv:2507.12511). The connection shows that the mechanism responsible for suppressing bit flip errors in biased noise systems had been formulated here earlier and independently, before its appearance in the recent literature. The present record establishes priority for the discovery of the underlying error suppression mechanism, the half step symmetry, the normalization rule 1 divided by N, and the resulting deterministic angle hierarchy that governs allowed operations in biased noise qubit systems. These concepts form the theoretical foundation for the error protection properties now observed experimentally. Type: Priority disclosure Version: Initial release Keywords: priority note, I11 number space, error suppression, biased noise, drift symmetry, parity structure, half step symmetry, normalization 1 divided by N, deterministic angles, coherence enhancement, cat qubits, magic state distillation, foundational discovery
Priority Note on Scale Invariant Deterministic Error Suppression Derived from the I11 Symmetry Logic Description: This priority note documents the first formulation of a deterministic mechanism for error suppression that arises directly from the internal symmetry of the quantized number space I11. The key insight is the introduction of the 1 divided by N normalization rule, which creates a half step reflection symmetry and divides all possible drift processes into two distinct parity sectors. This structure explains why phase preserving processes dominate while parity flipping processes are exponentially suppressed. The resulting error bias is not hardware dependent but follows from the intrinsic I11 geometry. This work establishes that the same symmetry logic underlying the I11 space also produces the specific form of biased noise and coherence enhancement observed in modern cat qubit architectures. The deterministic rotation angles and the stability ladder predicted by the I11 model match the operational structure used in contemporary folded and unfolded magic state distillation schemes, including those described in the 2025 Alice and Bob publication “Unfolded distillation: very low cost magic state preparation for biased noise qubits” (arXiv:2507.12511). The connection shows that the mechanism responsible for suppressing bit flip errors in biased noise systems had been formulated here earlier and independently, before its appearance in the recent literature. The present record establishes priority for the discovery of the underlying error suppression mechanism, the half step symmetry, the normalization rule 1 divided by N, and the resulting deterministic angle hierarchy that governs allowed operations in biased noise qubit systems. These concepts form the theoretical foundation for the error protection properties now observed experimentally. Type: Priority disclosure Version: Initial release Keywords: priority note, I11 number space, error suppression, biased noise, drift symmetry, parity structure, half step symmetry, normalization 1 divided by N, deterministic angles, coherence enhancement, cat qubits, magic state distillation, foundational discovery
We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional (Clifford + T) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state ∣Zk⟩=Z1/2k∣+⟩ can be prepared fault-tolerantly using 2k+3+O(2k/2) biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native Z1/2k gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to k=7, i.e., up to T1/32. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of (T + T) reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the T gate.
Magic state distillation enables universal fault-tolerant quantum computation by implementing non-Clifford gates via the preparation of high-fidelity magic states. However, it comes at the cost of substantial logical-level overhead in both space and time. In this work, we propose a very low-cost magic state distillation scheme for biased-noise qubits. By leveraging the noise bias, our scheme enables the preparation of a magic state with a logical error rate of 3 × 10 −7 , using only 53 qubits and 5.5 error correction rounds, under a noise bias of η ≳ 5 × 10 6 and a phase-flip noise rate of 0.1%. This reduces the circuit volume by more than one order of magnitude relative to magic state cultivation for unbiased-noise qubits and by more than two orders of magnitude relative to standard magic state distillation. Moreover, our scheme provides three key advantages over previous proposals for biased-noise qubits. First, it only requires nearest-neighbor two-qubit gates on a 2D lattice. Second, the logical fidelity remains nearly identical even at a more modest noise bias of η ≳ 80, at the cost of a slightly increased circuit volume. Third, the scheme remains effective even at high physical phase-flip rates, in contrast to previously proposed approaches whose circuit volume grows exponentially with the error rate. Our construction is based on unfolding the X stabilizer group of the Hadamard 3D quantum Reed-Muller code in 2D, enabling distillation at the physical level rather than the logical level, and is therefore referred to as unfolded distillation.
Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by engineering, as in stabilized cat qubits. This noise structure holds the promise of reducing the daunting hardware overhead of fault-tolerant quantum computing, but exploiting it requires physical operations that do not convert frequent phase-flips into rare bit-flips. In this review, we analyze the most prominent fault-tolerant protocols for biased-noise qubits, organized according to the available set of such bias-preserving operations. When this set is restricted to the CZ gate together with preparation and measurement in the X basis, we show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias: at experimentally relevant error rates, one may as well ignore the bias and rely on standard error correction designed for depolarizing noise. The situation changes drastically when a bias-preserving CX gate is available: the hierarchy of errors can then be reflected in the structure of the code, with frequent phase-flips corrected by a dedicated high-threshold code and rare bit-flips by concatenation with a high-rate code. The same hierarchy also enables hardware-efficient preparation of magic states. Finally, as a bias-preserving CX is forbidden in naturally biased platforms and challenging in engineered ones, we present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place, extending these overhead reductions to a much broader range of physical platforms.
Dissipative cat qubits exponentially suppress one Pauli error channel with the mean photon number, leaving the conjugate bit-flip error as the dominant failure mode. This strong noise bias makes the full machinery of general quantum error correction unnecessary: a code need only protect against a single error type, and any classical linear code can be promoted to a Clifford stabilizer code that does exactly this. We use this observation to build a bit-flip-only quantum Reed-Solomon (RS) code. Starting from the maximum-distance-separable RS code [7, 3, 5] over GF(23), we binary-expand it to the linear code [21, 9, 6] over GF(2) and realize it as a [[21, 9, dX=6,dZ=1]] bit-flip code whose stabilizers are products of Z operators. Because no phase-flip correction is attempted, the construction discards the redundancy that standard quantum RS codes spend on correcting Z errors -- which a strongly biased cat qubit renders unnecessary -- and yields a shallow Clifford circuit that samples directly in Stim. Errors are decoded by an optimal bounded-distance syndrome-lookup table. We then introduce a Tornado architecture: a two-layer concatenation that wraps every position of the outer RS code in an inner distance-three repetition code, yielding a [[63, 9, 18]] code decoded by a two-stage inner majority vote and outer lookup decoder. Monte-Carlo simulation shows that at a physical bit-flip rate p=0.1 the Tornado code reaches a logical error rate pL≈5.3×10−3, below both parent codes, and that its logical error rate scales as pL∝p6 at low p, in contrast to p2 for the repetition code and p3 for the standalone RS code. We give the exact construction, the error and circuit model, an asymptotic scaling analysis, and an honest account of the overhead cost and single-shot assumptions.
Multiple quantum computing platforms across neutral atoms [1], nitrogen vacancy centres [2, 3], gate-defined dots [4-6] and 14|15 phosphorus atom qubits [7, 8] in silicon are experimentally exploring the use of high connectivity qubits, beyond that of nearest-neighbour planar lattices. Theoretical works consider modifications to fault-tolerant codes to leverage this higher qubit connectivity, such as non-local LDPC codes [9], inspiring superconducting [10] and photonic [11] platforms to also seek non-planar connectivity. In addition, separate theoretical works consider biased noise, where bit- and phase-flip errors are not equally likely. In this work, we present efficient methods for implementing 6.6.6 and 4.8.8 colour codes, as well as bilayer and folded surface codes, using two-qubit registers. We also leverage noise bias to avoid hook errors, demonstrating comparable performance to the surface code. By combining colour and bilayer codes, we show how magic state cultivation procedures [12-14] can be improved, in a procedure we refer to as the Magic Scroll. Not only does the Magic Scroll escape to a standard surface code, it also improves cultivation volumes by 3x and supports magic ∣T⟩ state fidelities as low as 10−9. We show that this technique can be further leveraged to improve distillation performance, showing a 3x improvement to distillation volumes for error rates of ∼10−15. Through these constructions, we demonstrate techniques to leverage noise bias and high qubit connectivity, showing how register-based architectures can improve error rates and reduce quantum volumes in fault-tolerant quantum computing.
Bosonic "cat qubits" encoded in superpositions of well-separated coherent states |+a⟩ and |-a⟩ are attractive for quantum error correction because single-photon loss acts as a phase-flip error while the dominant, hardware-limiting bit-flip error is suppressed exponentially in the mean photon number |a|². We ask whether an analogous noise bias can be engineered using the orbital angular momentum (OAM) of light instead of its amplitude, encoding a qubit in a superposition of two well-separated OAM eigenstates |+L⟩ and |-L⟩. We model the dominant OAM channel noise—local mode-mixing induced by fiber imperfections or wavefront aberrations, which couples only adjacent topological charges (Δl = ±1)—as a continuous-time random walk on the integers. We define an operational experimental protocol to extract the channel hopping rate directly from the linear spatial growth of the OAM variance Var(l) = γz. We show analytically and numerically that this local, nearest-neighbor character converts almost all population leakage out of the code space into a detectable erasure, while the probability of an undetected logical bit-flip is suppressed as exp(-2L² / γz), a direct structural analog of the exp(-2|a|²) bias of amplitude-phase cat qubits. This revised version (v2) corrects the erasure-probability expression using an exact closed form (Skellam/Bessel identity), adds an explicit resource-overhead analysis quantifying the repetition cost of the scheme, and discusses the impact of a mode-dependent hopping rate γ(l) on the achievable suppression. We argue that periodic syndrome extraction using existing phase-locked OAM mode sorters could realize the required error-detection step without a dedicated nonlinear dissipative stabilizer. ---Keywords: Quantum Error Correction, Cat Qubits, Orbital Angular Momentum (OAM), Noise Bias, Erasure Channel, Random Walk, Frugal Quantum Hardware, Open Science.Repository contents: Includes manuscript PDF and full Python simulation package (NumPy/SciPy/Matplotlib).