Early Fault-Tolerant Magic State Synthesis and Spacetime Efficient Analog Rotations with Color Code on a Superconducting Quantum Processor
quant-ph
Submitted: 2026-10-30
Updated: 2026-10-30
License: http://creativecommons.org/licenses/by/4.0/
The gist: With recent improvements to syndrome extraction scheduling and decoding, and the availability of complete transversal Clifford operations and lattice surgery…
Terminology
Abstract
With recent improvements to syndrome extraction scheduling and decoding, and the availability of complete transversal Clifford operations and lattice surgery, color code is an especially promising platform for quantum processors with local connectivity. The key ingredient for universal computation is thus generating useful magic states with limited resources. Space-Time Efficient Analog Rotations (STAR) and Fault-tolerant magic state synthesis (MSS) are two such methods for magic state generation, targeted for near-term and long-term quantum computing, respectively. In this work, we perform the first implementations of both magic state paradigms on a superconducting quantum processor. We present a STAR-type injection protocol on the color code, with favorable error rate and spacetime costs versus prior protocols on both the color and surface codes. We then implement a MSS factory by performing multi-patch magic state cultivations, interleaved with transversal Clifford operations, and lattice-surgery magic state teleportation. Under post-selection, we achieve a kickback tomography correct sign probability of 99.9859% on cultivated T L states, 96% tomographic fidelity on logical analog rotation states, and 91% fidelity on synthesized logical magic states consuming 3 cultivated T L states, 3 transversal Hadamard operations, and real-time feed-forward S L corrections during magic state teleportation. We compare the efficacy of post-selection, Most-Likely-Error (MLE) decoding, and concatenated-matching decoding throughout, highlighting the potential of end-to-end color code computation.
Sources
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Demonstration of Logical Error Suppression in a Surface Code Memory on a Cloud-Accessible IBM Superconducting Processor
- Quantum error correction well below the color code threshold
- A superconducting surface-code processor with lattice-surgery logical operations
- Quantum error correction with the toric code
- How to factor 2048 bit RSA integers with less than a million noisy qubits
- Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
- Magic state cultivation: growing T states as cheap as CNOT gates
- Optimal ancilla-free Clifford+T approximation of z-rotations
- iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
- STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer
- Topological Quantum Distillation
- Fault-tolerant quantum computing with color codes
- Scaling and logic in the color code on a superconducting quantum processor
- New circuits and an open source decoder for the color code
- The Solovay-Kitaev algorithm
- Quantum computing with Qiskit
- Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
- Simulating Quantum Error Correction beyond Pauli Stochastic Errors
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements