Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.08508

Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

Yunzhe Zheng, Allen Zang, Aleksander Kubica

quant-phSubmitted Jul 9, 2026• Announced Jul 10, 2026• 1 citation• Revised Oct 10, 2026 (v2)
v1 · Jul 9, 2026v2 · Oct 10, 2026
arXivHTMLPDF

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.

Related papers

Fault-tolerantly implementing dense rotation operations based on non-stabilizer states

Wu Xiang-Yan, Xu Yan-Ling, Yu Ya-Fei +1 more

Based on the quantum error-correction codes and concatenation, quantum logical gates can be implemented transversally, which is called the fault-tolerant quantum computation. Clifford gates can be directly and fault-tolerantly performed, but they cannot reach universal quantum computation. How to implement the non-Clifford gate fault-tolerantly is a vital technique in fault-tolerant universal quantum computation. Here the magic state is selected to help the implementing of the non-Clifford gate transversally. Based on the non-stabilizer state cos θi|0>+sinθi|1>, circuits which can execute 2θi rotation around X-axis and Z-axis fault-tolerantly are proposed. Then new non-stabilizer states in this form are developed and produced from the distilled magic state. By using these states, a number of non-Clifford gates can be performed transversally, which makes profound implication in fault-tolerant quantum computation. We calculate the number of the non-stabilizer states needed for simulating the desired rotation operations, which is less than that in previous protocols.

Acta Physica Sinica•Jan 1, 2014•0 citations

Exact efficient simulation of noisy logical magic states using Clifford stabilizers

Yugo Takada, Stephen D. Bartlett, Dominic J. Williamson

The preparation of high-fidelity logical magic states is a crucial subroutine for universal fault-tolerant quantum computation (FTQC). Predicting the performance of FTQC and developing improved protocols rely on numerical methods to classically simulate logical magic state preparation in the presence of noise. Clifford logic on Pauli-stabilizer codes with circuit-level Pauli errors can be efficiently simulated using Pauli-stabilizer formalism, but the non-Clifford operations required to prepare logical magic states render generic simulation inefficient. We introduce Clifford-stabilizer simulation, an exact and efficient algorithm based on updating a Clifford-stabilizer group to simulate noisy preparation protocols for a broad class of logical magic states used to implement non-Clifford gates in the third level of the Clifford hierarchy under circuit-level Pauli errors. Clifford-stabilizer simulation applies to a range of operations that commonly appear in preparation protocols for such logical magic states, including Pauli-stabilizer measurements, logical Clifford measurements, and transversal non-Clifford gates. Our algorithm for Clifford-stabilizer simulation maps a non-Clifford circuit with sampled circuit-level Pauli errors to a Clifford circuit that exactly reproduces its measurement outcome distribution, achieving time and space complexities polynomial in relevant protocol parameters. We perform exact simulation of magic state cultivation up to fault distance 7 by Clifford-stabilizer simulation. Our method provides a route to perform exact benchmarking of large-scale logical magic state preparation protocols required for useful FTQC.

quant-pharXiv:2609.16929•Sep 16, 2026•10 citations

Magic state distillation and cost analysis in fault-tolerant universal quantum computation

Yiting Liu, Zhi Ma, Lan Luo +5 more

Abstract Magic states have been widely studied in recent years as resource states that help quantum computers achieve fault-tolerant universal quantum computing. The fault-tolerant quantum computing requires fault-tolerant implementation of a set of universal logical gates. Stabilizer code, as a commonly used error correcting code with good properties, can apply the Clifford gates transversally which is fault tolerant. But only Clifford gates cannot realize universal computation. Magic states are introduced to construct non-Clifford gates that combine with Clifford operations to achieve universal quantum computing. Since the preparation of quantum states is inevitably accompanied by noise, preparing the magic state with high fidelity and low overhead is the crucial problem to realizing universal quantum computation. In this paper, we survey the related literature in the past 20 years and introduce the common types of magic states, the protocols to obtain high-fidelity magic states, and overhead analysis for these protocols. Finally, we discuss the future directions of this field.

Quantum Science and Technology•Jul 12, 2023•9 citations

Magic Quantum Code Surgery

Kathleen Chang, Anasuya Lyons, Yuanjie Ren +5 more

Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.

quant-pharXiv:2610.03920•Oct 6, 2026•4 citations

Cavity-mediated probabilistic magic TTT-gate injection

Sofia Cocciaretto, Roberto Menta, Vittorio Giovannetti

Non-Clifford gates are a necessary resource for universal quantum computation, yet their fault-tolerant implementation typically relies on magic-state distillation, which incurs significant overhead in qubit count and circuit depth. In this work, we propose a probabilistic cavity-based magic-state injection protocol. Our scheme exploits controlled atom-cavity interactions and conditional measurements to probabilistically prepare an effective magic state encoded in the first two level Fock subspace of a single cavity mode, achieving a success probability of $0.74$ per attempt, independent of the target magic phase. The cavity-encoded magic state is subsequently injected into a computational atom via a teleportation-based protocol mediated by dressed-state transitions, requiring only Clifford operations and a single auxiliary atom for readout. We show that all required operations -- state preparation, two-qubit exchange gates, and projective measurement -- can be implemented with experimentally available techniques in Rydberg atom-cavity platforms. We further discuss how the scheme can in principle be adapted to operate at the logical level, where collective Rydberg interactions and optical nonlinearities provide a route toward cavity-mediated $T$-gate injection directly into code-encoded qubits.

quant-pharXiv:2606.30628•Jun 30, 2026•0 citations

Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing

Mark Howard, Earl T. Campbell

Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.

arXiv:1609.07488•Physical Review Letters•Mar 3, 2017•462 citations
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] ⁣][\![5, 1, 3]\!][[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.
Based on the quantum error-correction codes and concatenation, quantum logical gates can be implemented transversally, which is called the fault-tolerant quantum computation. Clifford gates can be directly and fault-tolerantly performed, but they cannot reach universal quantum computation. How to implement the non-Clifford gate fault-tolerantly is a vital technique in fault-tolerant universal quantum computation. Here the magic state is selected to help the implementing of the non-Clifford gate transversally. Based on the non-stabilizer state cos θi|0>+sinθi|1>, circuits which can execute 2θi rotation around X-axis and Z-axis fault-tolerantly are proposed. Then new non-stabilizer states in this form are developed and produced from the distilled magic state. By using these states, a number of non-Clifford gates can be performed transversally, which makes profound implication in fault-tolerant quantum computation. We calculate the number of the non-stabilizer states needed for simulating the desired rotation operations, which is less than that in previous protocols.
The preparation of high-fidelity logical magic states is a crucial subroutine for universal fault-tolerant quantum computation (FTQC). Predicting the performance of FTQC and developing improved protocols rely on numerical methods to classically simulate logical magic state preparation in the presence of noise. Clifford logic on Pauli-stabilizer codes with circuit-level Pauli errors can be efficiently simulated using Pauli-stabilizer formalism, but the non-Clifford operations required to prepare logical magic states render generic simulation inefficient. We introduce Clifford-stabilizer simulation, an exact and efficient algorithm based on updating a Clifford-stabilizer group to simulate noisy preparation protocols for a broad class of logical magic states used to implement non-Clifford gates in the third level of the Clifford hierarchy under circuit-level Pauli errors. Clifford-stabilizer simulation applies to a range of operations that commonly appear in preparation protocols for such logical magic states, including Pauli-stabilizer measurements, logical Clifford measurements, and transversal non-Clifford gates. Our algorithm for Clifford-stabilizer simulation maps a non-Clifford circuit with sampled circuit-level Pauli errors to a Clifford circuit that exactly reproduces its measurement outcome distribution, achieving time and space complexities polynomial in relevant protocol parameters. We perform exact simulation of magic state cultivation up to fault distance 7 by Clifford-stabilizer simulation. Our method provides a route to perform exact benchmarking of large-scale logical magic state preparation protocols required for useful FTQC.
Abstract Magic states have been widely studied in recent years as resource states that help quantum computers achieve fault-tolerant universal quantum computing. The fault-tolerant quantum computing requires fault-tolerant implementation of a set of universal logical gates. Stabilizer code, as a commonly used error correcting code with good properties, can apply the Clifford gates transversally which is fault tolerant. But only Clifford gates cannot realize universal computation. Magic states are introduced to construct non-Clifford gates that combine with Clifford operations to achieve universal quantum computing. Since the preparation of quantum states is inevitably accompanied by noise, preparing the magic state with high fidelity and low overhead is the crucial problem to realizing universal quantum computation. In this paper, we survey the related literature in the past 20 years and introduce the common types of magic states, the protocols to obtain high-fidelity magic states, and overhead analysis for these protocols. Finally, we discuss the future directions of this field.
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.
Non-Clifford gates are a necessary resource for universal quantum computation, yet their fault-tolerant implementation typically relies on magic-state distillation, which incurs significant overhead in qubit count and circuit depth. In this work, we propose a probabilistic cavity-based magic-state injection protocol. Our scheme exploits controlled atom-cavity interactions and conditional measurements to probabilistically prepare an effective magic state encoded in the first two level Fock subspace of a single cavity mode, achieving a success probability of 0.740.740.74 per attempt, independent of the target magic phase. The cavity-encoded magic state is subsequently injected into a computational atom via a teleportation-based protocol mediated by dressed-state transitions, requiring only Clifford operations and a single auxiliary atom for readout. We show that all required operations -- state preparation, two-qubit exchange gates, and projective measurement -- can be implemented with experimentally available techniques in Rydberg atom-cavity platforms. We further discuss how the scheme can in principle be adapted to operate at the logical level, where collective Rydberg interactions and optical nonlinearities provide a route toward cavity-mediated TTT-gate injection directly into code-encoded qubits.
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.