aiqbench analysis
This paper addresses the critical bottleneck of magic state distillation in fault-tolerant quantum computing by proposing a simplified protocol compatible with square-grid connectivity. By eliminating complex grafted codes and utilizing code expansion, the authors achieve comparable logical error rates while halving the spacetime overhead required for implementation. These efficiency gains are significant for advancing early fault-tolerant devices toward practical megaquop applications.
Efficient magic state cultivation with lattice surgery
arXiv:2510.24615v2 Announce Type: replace Abstract: Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physical-level distillation offers significant overhead reduction by enabling direct implementation with physical gates. Magic state cultivation is a state-of-the-art physical-level distillation protocol that is compatible with the square-grid connectivity and yields high-fidelity magic states. However, it relies on the complex grafted code, which incurs substantial spacetime overhead and complicates practical implementation. In this work, we propose an efficient cultivation-based protocol compatible with the square-grid connectivity. We reduce the spatial overhead by avoiding the grafted code and further reduce the average spacetime overhead by utilizing code expansion and enabling early rejection. Numerical simulations show that, with a color code distance of 3 and a physical error probability of $10^{-3}$, our protocol achieves a logical error probability for the resulting magic state comparable to that of magic state cultivation ($\approx 3 \times 10^{-6}$), while requiring about half the spacetime overhead. Our work provides an efficient and simple distillation protocol suitable for megaquop use cases and early fault-tolerant devices.
Abstract:Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physical-level distillation offers significant overhead reduction by enabling direct implementation with physical gates. Magic state cultivation is a state-of-the-art physical-level distillation protocol that is compatible with the square-grid connectivity and yields high-fidelity magic states. However, it relies on the complex grafted code, which incurs substantial spacetime overhead and complicates practical implementation. In this work, we propose an efficient cultivation-based protocol compatible with the square-grid connectivity. We reduce the spatial overhead by avoiding the grafted code and further reduce the average spacetime overhead by utilizing code expansion and enabling early rejection. Numerical simulations show that, with a color code distance of 3 and a physical error probability of $10^{-3}$, our protocol achieves a logical error probability for the resulting magic state comparable to that of magic state cultivation ($\approx 3 \times 10^{-6}$), while requiring about half the spacetime overhead. Our work provides an efficient and simple distillation protocol suitable for megaquop use cases and early fault-tolerant devices.
arXiv:2510.24615 [quant-ph]
(or arXiv:2510.24615v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2510.24615 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 267 words
Related coverage
Efficient Magic State Cultivation for $\sqrt{T}$ Gates
arXiv · Jun 10, 2026
Efficient Magic State Factory Via Transversal Non-Clifford Gate
arXiv · Jun 16, 2026

Quantum Resource Comparison for Two Leading Surface Code Lattice Surgery Approaches
Quantum Journal · Aug 10, 2026
PureMagic: A Dynamic Scheduler for Lattice Surgery
arXiv · Jul 22, 2026