aiqbench analysis
This is theoretical work on fault-tolerant quantum computing, specifically how non-Clifford gates can be implemented via teleportation from non-stabilizer resource states. Its most practical contributions are a structural reframing that turns the feedforward step into a logical gate after encoding, an algorithm for synthesizing protocols from commuting Pauli rotations, and conditions under which corrections reduce to simple Pauli operations. Readers tracking hardware overhead for universal quantum computation should note that the $[\![5,1,3]\!]$ distillation output cannot be used directly and needs probabilistic conversion, which is a concrete cost.
Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
arXiv:2607.08508v2 Announce Type: replace Abstract: Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.
Abstract:Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.
arXiv:2607.08508 [quant-ph]
(or arXiv:2607.08508v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.08508 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 · 323 words
Related coverage

Magic Gate Teleportation Simplifies Feedforward for Quantum Computing
Quantum Zeitgeist · Jul 15, 2026

What is Quantum Error Correction? Complete 2026 Beginner’s Guide
Quantum Zeitgeist · May 29, 2026
Magic Secret Sharing: Threshold Control of Quantum Computational Power via GHZ Entanglement
arXiv · Aug 4, 2026

Non-stabilizerness and violations of CHSH inequalities
Quantum Journal · Sep 21, 2026