Efficient simulation of logical magic state preparation protocols
arXiv:2512.23799 · doi:10.1103/fby6-xjbm
Abstract
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical magic state preparation protocols under the standard circuit-level noise model. When applied to protocols based on code switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the non-stabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical magic state preparation protocols without resorting to approximations or resource-intensive state-vector simulations.
20 pages, 15 figures + appendices. v2: fixed typos, improved clarity of figures and expanded discussion
References in corpus (52)
- Quantum Teleportation is a Universal Computational Primitive
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Elucidating Reaction Mechanisms on Quantum Computers
- Topological Quantum Distillation
- Surface code quantum computing by lattice surgery
- Restrictions on Transversal Encoded Quantum Gate Sets
- Stim: a fast stabilizer circuit simulator
- Magic state distillation with low overhead
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Demonstration of fault-tolerant universal quantum gate operations
- Trading classical and quantum computational resources
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Quantum error correction with only two extra qubits
- Novel constructions for the fault-tolerant Toffoli gate
- Topological Computation without Braiding
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Quantum computation with realistic magic state factories
- Classification of topologically protected gates for local stabilizer codes
- Adaptive quantum state tomography improves accuracy quadratically
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Flag fault-tolerant error correction with arbitrary distance codes
- Universal transversal gates with color codes - a simplified approach
- Fault-tolerant quantum computation with few qubits
- Multilevel distillation of magic states for quantum computing
- Encoding a magic state with beyond break-even fidelity
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Surface code implementation of block code state distillation
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- A magic state's fidelity can be superior to the operations that created it
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Fault-tolerant magic state preparation with flag qubits
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Experimental Demonstration of Logical Magic State Distillation
- Efficient classical simulation of Clifford circuits with nonstabilizer input states
- Scaling and logic in the color code on a superconducting quantum processor
- Transversal Clifford gates on folded surface codes
- Reducing the quantum computing overhead with complex gate distillation
- Partitioning qubits in hypergraph product codes to implement logical gates
- Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states
- Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
- Efficient Magic State Distillation by Zero-Level Distillation
- Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
- Code switching revisited: Low-overhead magic state preparation using color codes
- Efficient fault-tolerant code switching via one-way transversal CNOT gates
- Code conversion with the quantum Golay code for a universal transversal gate set
- Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
- From Magic State Distillation to Dynamical Systems