aiqbench analysis
This research presents a comparative analysis of magic-state preparation techniques, specifically evaluating code-switching against cultivation methods for fault-tolerant quantum computing. The authors propose new protocols combining phase-kickback checks with transversal non-Clifford gates to optimize resource requirements in end-to-end simulations. These advancements are critical for improving the efficiency and scalability of future quantum error correction architectures.
Efficient Magic State Factory Via Transversal Non-Clifford Gate
arXiv:2606.16199v1 Announce Type: new Abstract: Magic-state preparation is a central component of fault-tolerant quantum computing. Recent theoretical and experimental successes in code-switch-based magic-state preparation have underscored the promise of these methods for quantum error correction. Similarly, magic-state cultivation has likewise been demonstrated in both numerical and experimental settings. However, a thorough comparison between magic-state cultivation and code-switch-based magic-state factories is still missing. In this work, we carry out end-to-end simulations of magic-state preparation using code switching and compare its resource requirements and performance against magic-state cultivation. As part of this analysis, we develop a lattice-surgery protocol for transfer between the doubled color code and the rotated surface code. We extend the complete code-switching protocol to the $d=5$ doubled color code and perform the corresponding end-to-end simulations. Finally, we propose two fault-tolerant magic-state preparation protocols that combine phase-kickback checks with a transversal non-Clifford gate.
Abstract:Magic-state preparation is a central component of fault-tolerant quantum computing. Recent theoretical and experimental successes in code-switch-based magic-state preparation have underscored the promise of these methods for quantum error correction. Similarly, magic-state cultivation has likewise been demonstrated in both numerical and experimental settings. However, a thorough comparison between magic-state cultivation and code-switch-based magic-state factories is still missing. In this work, we carry out end-to-end simulations of magic-state preparation using code switching and compare its resource requirements and performance against magic-state cultivation. As part of this analysis, we develop a lattice-surgery protocol for transfer between the doubled color code and the rotated surface code. We extend the complete code-switching protocol to the $d=5$ doubled color code and perform the corresponding end-to-end simulations. Finally, we propose two fault-tolerant magic-state preparation protocols that combine phase-kickback checks with a transversal non-Clifford gate.
arXiv:2606.16199 [quant-ph]
(or arXiv:2606.16199v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.16199 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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 · 229 words
Related coverage
Single-shot magic state factories for quantum LDPC codes
arXiv · Oct 9, 2026

The Steane Code Explained
Quantum Zeitgeist · Sep 5, 2026

Geneva Team Distils Magic States with Qubit Recycling
Quantum Zeitgeist · Sep 16, 2026

Quantum Resource Comparison for Two Leading Surface Code Lattice Surgery Approaches
Quantum Journal · Aug 10, 2026