We introduce a framework called spacetime concatenation for fault-tolerant compilation of syndrome extraction circuits of stabilizer codes. Spacetime concatenation enables efficient compilation of syndrome extraction circuits into dynamical codes through structured gadget layouts and encoding matrices, facilitating low-weight measurements while preserving logical information. Our framework uses conditions that are sufficient for fault-tolerance of the dynamical code, including not measuring logical operators and preserving the spacetime distance. We construct explicit examples of dynamical codes using this framework, including the dynamical bivariate bicycle code and a dynamical Haah code, while illustrating their fault-tolerant properties. Furthermore, we analyze the classification and resource trade-offs of dynamical codes, demonstrating their adaptability to hardware constraints, including fabrication defects and qubit dropout scenarios.
We introduce a framework called spacetime concatenation for fault-tolerant compilation of syndrome extraction circuits of stabilizer codes. Spacetime concatenation enables efficient compilation of syndrome extraction circuits into dynamical codes through structured gadget layouts and encoding matrices, facilitating low-weight measurements while preserving logical information. Our framework uses conditions that are sufficient for fault-tolerance of the dynamical code, including not measuring logical operators and preserving the spacetime distance. We construct explicit examples of dynamical codes using this framework, including the dynamical bivariate bicycle code and a dynamical Haah code, while illustrating their fault-tolerant properties. Furthermore, we analyze the classification and resource trade-offs of dynamical codes, demonstrating their adaptability to hardware constraints, including fabrication defects and qubit dropout scenarios.
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.
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code equipped with a syndrome extraction circuit. Spacetime codes have emerged as a natural framework to understand error correction at the circuit level while leveraging the traditional QEC toolbox. Here, we introduce a framework based on chain complexes and chain maps to model spacetime codes and transformations between them. We show that stabilizer codes, quantum circuits, and decoding problems can all be described using chain complexes, and that the equivalence of two spacetime codes can be characterized by specific maps between chain complexes, the fault-tolerant maps, that preserve the number of encoded qubits, fault distance, and minimum-weight decoding problem. As an application of this framework, we extend the foliated cluster state construction from stabilizer codes to any spacetime code, showing that any Clifford circuit can be transformed into a measurement-based protocol with the same fault-tolerant properties. To this protocol, we associate a chain complex which encodes the underlying decoding problem, generalizing previous cluster state complex constructions. Our method enables the construction of cluster states from non-CSS, subsystem, and Floquet codes, as well as from logical Clifford operations on a given code.
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 error-correcting codes provide a powerful framework for analyzing and designing fault-tolerant Clifford circuits. In this work, we construct the subsystem spacetime code and use it to characterize the distances of Clifford circuits. We show that its gauge group can be explicitly constructed and classified using the masking properties of the instantaneous stabilizer groups and consists precisely of faults that are harmless to the circuit. We use this framework to identify where a dynamical code loses distance and to analyze how the fault distance changes when circuits are composed from smaller components. Our results provide a versatile tool for analyzing and designing fault-tolerant circuits, with potential applications to the construction of new dynamical codes.
In this work, we analyze a framework for constructing fault-tolerant measurement schedules of varying lengths by combining stabilizer generators, and prove results about the distance of such schedules by combining according to classical codes. Using this framework, we produce explicit measurement schedules sufficient for fault-tolerant error correction of quantum codes of distance d with r independent stabilizer generators using only O(dlogr) measurements if the code is LDPC, and O(dlogdlogr) measurements if the code is produced via concatenating a smaller code with itself O(logd) times. In both of these cases the number of measurements can be asymptotically fewer than the number of stabilizer generators which define the code. Although optimizing our construction to use the fewest measurements produces high-weight stabilizers, we also show that we can reduce the number of measurements used for specific examples while maintaining low-weight stabilizer measurements. We numerically examine the performance of our construction on the surface code under several noise models and demonstrate the exponential error suppression with increasing distance which is characteristic of weak fault tolerance.
We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for exact recovery of the ideal computation under a prescribed noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the t-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.