aiqbench analysis
This paper presents a classical simulator for magic state factories, the components that supply the non-Clifford resources fault-tolerant quantum computers need. It reports that the simulator handles distillation and cultivation protocols at costs that don't blow up exponentially with output count, and it adds support for feedforward based on decoder outputs. For quantum computing readers, the practical value is a faster way to evaluate fault-tolerance overheads before building hardware, though the results are simulation benchmarks rather than demonstrations on physical devices.
Magna: simulating magic state factories as cheaply as Clifford circuits
arXiv:2610.22315v1 Announce Type: new Abstract: Classical simulation of magic state factories, including distillation, cultivation, and code switching, is challenging because of their substantial non-Clifford content. We introduce $\texttt{magna}$ (magic-state-factory assessment via global network algebra), a classical simulator that simulates such protocols as cheaply as Clifford circuits. $\texttt{magna}$ expresses the figures of merit of a protocol, namely the acceptance rate and the fidelity of the accepted states, as tensor networks, which it reduces globally by exploiting a structural correspondence with transversal gates on quantum codes. $\texttt{magna}$ further supports feedforward conditioned on arbitrary functions of mid-circuit measurement outcomes, including decoder outputs. We simulate Bravyi--Haah distillation with up to 100 output magic states at a cost that does not grow exponentially in the number of outputs, and achieve state-of-the-art sampling times for distance-5 magic state cultivation on both color codes and RP$^2$ surface codes. Finally, we validate nonlinear feedforward on a logical-level distillation protocol with 15 rounds of decoder-dependent feedforward. $\texttt{magna}$ aims to contribute to the key infrastructure for the large-scale evaluation and optimization of magic state factories.
Abstract:Classical simulation of magic state factories, including distillation, cultivation, and code switching, is challenging because of their substantial non-Clifford content. We introduce $\texttt{magna}$ (magic-state-factory assessment via global network algebra), a classical simulator that simulates such protocols as cheaply as Clifford circuits. $\texttt{magna}$ expresses the figures of merit of a protocol, namely the acceptance rate and the fidelity of the accepted states, as tensor networks, which it reduces globally by exploiting a structural correspondence with transversal gates on quantum codes. $\texttt{magna}$ further supports feedforward conditioned on arbitrary functions of mid-circuit measurement outcomes, including decoder outputs. We simulate Bravyi--Haah distillation with up to 100 output magic states at a cost that does not grow exponentially in the number of outputs, and achieve state-of-the-art sampling times for distance-5 magic state cultivation on both color codes and RP$^2$ surface codes. Finally, we validate nonlinear feedforward on a logical-level distillation protocol with 15 rounds of decoder-dependent feedforward. $\texttt{magna}$ aims to contribute to the key infrastructure for the large-scale evaluation and optimization of magic state factories.
arXiv:2610.22315 [quant-ph]
(or arXiv:2610.22315v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.22315 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 · 261 words
Related coverage
Efficient fidelity simulation of high-rate magic distillation circuits
arXiv · Oct 5, 2026

Shortcut for simulating logical magic states could accelerate the design of fault-tolerant quantum computers
Physics World · Aug 17, 2026
Distilling Magic States in the Bicycle Architecture
arXiv · Jun 3, 2026

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