Fault-tolerant compilation using the xz-propagation pipeline

Establish whether the xz-propagation compiler pipeline can form part of a compiler that converts quantum circuits to fault-tolerant implementations.

Background

The paper presents the xz-propagation pipeline as an optimisation for quantum error-correction programs. The pipeline converts corrective Pauli operations into XZ gadgets, propagates them through subsequent Clifford operations, and fuses them, thereby reducing quantum operations and allowing later syndrome-measurement cycles to proceed before decoding is complete.

The authors explain that the pipeline can commute corrective gates past transversal Clifford logical gates, but they do not establish that it supports a complete compilation process for fault-tolerant implementations. The unresolved issue is whether this optimisation can serve as a component of a compiler that performs the broader conversion from an ordinary quantum circuit to its fault-tolerant realization.

References

The open problem is to turn these constructions into an automated path from a code description to executable logical operations.

— Quantum Compiler Design for Fault-Tolerant Quantum Computing  (2609.17465 - Zhu et al., 15 Sep 2026) in Section 5, Section 5.1, paragraph "Turning qLDPC advantages into executable compiler stacks"

Although we only consider correction cycles for a \ac{qec} code above, and not any logical gates, the xz-propagation pipeline will commute corrective gates past transversal (Clifford) logical gates. We therefore conjecture that this pipeline could form part of a compiler which converts a circuit to its fault-tolerant implementation.

— A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs  (2609.01037 - Rice et al., 1 Sep 2026) in Section 4.2, “Quantum Error Correction”