Fast magic state preparation by gauging higher-form transversal gates in parallel
Dominic J. Williamson

TL;DR
The paper presents a fast, fault-tolerant method for preparing multiple magic states in parallel by leveraging higher-form transversal gates and code surgery, significantly reducing preparation time in quantum computing.
Contribution
It introduces a novel code surgery protocol that enables parallel, fault-tolerant magic state preparation using higher-form transversal gates in quantum error-correcting codes.
Findings
Constant time overhead for magic state preparation.
Linear qubit overhead in the protocol.
Supports parallel, fault-tolerant magic state generation.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Radiation Effects in Electronics
