Fast magic state preparation by gauging higher-form transversal gates in parallel
Dominic J. Williamson
TL;DR
This work introduces a fast, fault-tolerant scheme for parallel magic-state preparation using higher-form transversal gates on qLDPC codes. By defining higher-form transversal gates and a higher-form gauging measurement, it achieves constant-time overhead with linear qubit overhead, while preserving code-space fault tolerance and enabling simultaneous measurement of many logical Clifford operators. The approach avoids reliance on transversal non-Clifford gates or distillation, instead leveraging cohomological structure to read out magic states in parallel; it includes concrete examples based on the 3D Color Code and twisted HGGT, illustrating the potential for finite-rate magic-state generation on suitable topologies. The results motivate new quantum-code designs that support higher-form Clifford gates and invite further study of decoding and practical deployment in fault-tolerant quantum architectures.
Abstract
Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protected by a quantum error-correcting code. The recent discovery of highly efficient quantum low-density parity-check codes, together with efficient logic gates, lays the groundwork for low-overhead fault-tolerant quantum computation. This motivates the search for fast and parallel protocols for logical magic state preparation to enable universal quantum computation. Here, we introduce a fast code surgery procedure that performs a fault-tolerant measurement of many transversal logic gates in parallel. This is achieved by performing a generalized gauging measurement on a quantum code that supports a higher-form transversal gate. The time overhead of our procedure is constant, and the qubit overhead is linear. The procedure inherits fault-tolerance properties from the base code and the structure of the higher-form transversal gate. When applied to codes that support higher-form Clifford gates our procedure achieves fast and fault-tolerant preparation of many magic states in parallel. This motivates the search for good quantum low-density parity-check codes that support higher-form Clifford gates.
