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:1210.3388 · Physical Review A

Multilevel distillation of magic states for quantum computing

Cody Jones

Published Apr 4, 2013• 144 citations
arXivHTMLPDF

Abstract

We develop a procedure for distilling magic states used in universal quantum computing that requires substantially fewer initial resources than prior schemes. Our distillation circuit is based on a family of concatenated quantum codes that possess a transversal Hadamard operation, enabling each of these codes to distill the eigenstate of the Hadamard operator. A crucial result of this design is that low-fidelity magic states can be consumed to purify other high-fidelity magic states to even higher fidelity, which we call multilevel distillation. When distilling in the asymptotic regime of infidelity $\ensuremath{\epsilon}\ensuremath{\rightarrow}0$ for each input magic state, the number of input magic states consumed on average to yield an output state with infidelity $O({\ensuremath{\epsilon}}^{{2}^{r}})$ approaches ${2}^{r}+1$, which comes close to saturating the conjectured bound in another investigation [Bravyi and Haah, Phys. Rev. A 86, 052329 (2012)]. We show numerically that there exist multilevel protocols such that the average number of magic states consumed to distill from error rate ${\ensuremath{\epsilon}}_{\mathrm{in}}=0.01$ to ${\ensuremath{\epsilon}}_{\mathrm{out}}$ in the range ${10}^{\ensuremath{-}5}$--${10}^{\ensuremath{-}40}$ is about $14{\mathrm{log}}_{10}(1/{\ensuremath{\epsilon}}_{\mathrm{out}})\ensuremath{-}40$; the efficiency of multilevel distillation dominates all other reported protocols when distilling Hadamard magic states from initial infidelity 0.01 to any final infidelity below ${10}^{\ensuremath{-}7}$. These methods are an important advance for magic-state distillation circuits in high-performance quantum computing and provide insight into the limitations of nearly resource-optimal quantum error correction.

DOI
10.1103/physreva.87.042305

Related papers

Magic-state distillation with the four-qubit code

Adam M. Meier, Bryan Eastin, Emanuel H. Knill

The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the $+1$ eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the $15$-to-$1$ distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.

arXiv:1204.4221•Quantum Information and Computation•Mar 1, 2013•140 citations

Towards Low Overhead Magic State Distillation

Anirudh Krishna, Jean–Pierre Tillich

Magic-state distillation is a resource intensive subroutine for quantum computation. The ratio of noisy input states to output states with an error rate at most ε scales as O(log^{γ}(1/ε)) [S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86, 052329 (2012)10.1103/PhysRevA.86.052329]. In a breakthrough paper, Hastings and Haah [Distillation with Sublogarithmic Overhead, Phys. Rev. Lett. 120, 050504 (2018)10.1103/PhysRevLett.120.050504] showed that it is possible to construct distillation routines with a sublogarithmic overhead, achieving γ≈0.6779 and falsifying a conjecture that γ is lower bounded by 1. They then ask whether γ can be made arbitrarily close to 0. We answer this question in the affirmative for magic-state distillation routines using qudits of prime dimension (d dimensional quantum systems for prime d).

arXiv:1811.08461•Physical Review Letters•Aug 16, 2019•74 citations

Efficient Magic State Distillation by Zero-Level Distillation

Tomohiro Itogawa, Yugo Takada, Yutaka Hirano +1 more

Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford operations, it needs to be performed on the logical qubits and hence incurs a large spatiotemporal overhead, which is one of the major bottlenecks for the realization of fault-tolerant quantum computers (FTQCs). Here we propose zero-level distillation, which prepares a high-fidelity logical magic state at the physical level, namely , using physical qubits and nearest-neighbor two-qubit gates on a square lattice. We develop a zero-level distillation circuit and show that distillation can be made even more efficient than the conventional sophisticated approaches with logical level distillations. The key idea involves the Knill -type distillation using the Steane code and its careful mapping to the square-lattice architecture with error detection. The distilled magic state on the Steane-code state is then teleported or converted to surface codes. We numerically find that the error rate of the logical magic state scales as approximately 100 × p 2 in terms of the physical error rate p . For example, with a physical error rate of p = 10 − 4 ( 10 − 3 ), the logical error rate is reduced to p L = 10 − 6 ( 10 − 4 ), resulting in an improvement of 2 (1) orders of magnitude. This contributes to reducing both space and time overhead for early FTQC as well as full-fledged FTQC combined with conventional multilevel distillation protocols.

arXiv:2403.03991•PRX Quantum•May 22, 2025•63 citations

Magic state distillation at intermediate size

Jeongwan Haah, Matthew B. Hastings, David Poulin +1 more

Recently [1] we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called “inner codes” and “outer codes.” In Ref. [1], some small examples of these codes were given as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regime, using hundreds to thousands of qubits. We use BCH inner codes [2], combined with various outer codes. We extend the protocols of Ref. [1] by adding error correction in some cases. We present a variety of protocols in various input error regimes; in many cases these protocols require significantly fewer input magic states to obtain a given output error than previous protocols.

Quantum Information and Computation•Feb 1, 2018•8 citations

Low-Overhead Magic State Distillation with Color Codes

Seok-Hyung Lee, Felix Thomsen, Nicholas Fazio +2 more

Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing with quantum error-correcting codes. Magic state distillation is the most well-studied method for this but requires significant resources. Hence, it is crucial to tailor and optimize magic state distillation for specific codes from both logical- and physical-level perspectives. In this work, we perform such optimization for two-dimensional color codes, which are promising due to their higher encoding rates compared to surface codes, transversal implementation of Clifford gates, and efficient lattice surgery. We propose two carefully designed distillation schemes based on the 15-to-1 distillation circuit and lattice surgery, differing in their methods for handling faulty rotations. Our first scheme employs faulty T measurement, achieving infidelities of O ( p 3 ) for physical noise strength p . To achieve lower infidelities, our second scheme integrates distillation with “cultivation” (a distillation-free approach to fault tolerantly prepare magic states through transversal Clifford measurements). Our second scheme achieves significantly lower infidelities (e.g., approximately 2 × 10 − 16 at p = 10 − 3 ), surpassing the capabilities of both cultivation and single-level distillation. Notably, to reach a given target infidelity, our schemes require approximately 2 orders of magnitude fewer resources than the previous best magic-state-distillation schemes for color codes.

arXiv:2409.07707•PRX Quantum•May 30, 2025•31 citations

Zero-level $CCZ$ Distillation

Tomohiro Itogawa, Yutaka Hirano, Yutaro Akahoshi +1 more

Magic state distillation is a key component of fault-tolerant quantum computation, as it enables the implementation of non-Clifford gates such as the $T$ gate and the $CCZ$ gate via gate teleportation. However, conventional distillation protocols require a large number of logical qubits and introduce substantial spatial and temporal overhead, posing a significant bottleneck for scalable fault-tolerant quantum computation. In this work, we propose a zero-level distillation protocol that efficiently generates a high-fidelity logical $CCZ$ magic state using only physical qubits on a two-dimensional square lattice with nearest-neighbor interactions. Our method leverages the transversal $T/T^\dagger$ operation of the $[[ 8,3,2 ]]$ code to fault-tolerantly encode the state $\overline{CCZ}|+++\rangle$, which is subsequently teleported to three surface-code logical qubits via lattice surgery. To enable teleportation between codes with different distances, we introduce adaptively initialized teleportation (AIT), a tailored initialization procedure for the surface code. Numerical simulations demonstrate that the logical error rate scales as $p_L \simeq 300 \times p^2$ with respect to the physical error rate $p$. For example, the proposed method improves the logical error rate by approximately one and two orders of magnitude at $p = 10^{-3}$ and $p = 10^{-4}$, respectively, compared to conventional seven-$T$-gate approaches. The distillation circuit requires only 22 physical qubits, 3 logical qubits, and a circuit depth of 24, reducing the space-time overhead by a factor of approximately 5-10 compared to previous methods. This result highlights the practicality of $CCZ$-state distillation in early fault-tolerant quantum computation and offers a new direction toward resource-efficient physical-level magic state distillation beyond conventional $T$-state generation.

quant-pharXiv:2605.21867•May 22, 2026•1 citation
We develop a procedure for distilling magic states used in universal quantum computing that requires substantially fewer initial resources than prior schemes. Our distillation circuit is based on a family of concatenated quantum codes that possess a transversal Hadamard operation, enabling each of these codes to distill the eigenstate of the Hadamard operator. A crucial result of this design is that low-fidelity magic states can be consumed to purify other high-fidelity magic states to even higher fidelity, which we call multilevel distillation. When distilling in the asymptotic regime of infidelity \ensuremathϵ\ensuremath→0\ensuremath{\epsilon}\ensuremath{\rightarrow}0\ensuremathϵ\ensuremath→0 for each input magic state, the number of input magic states consumed on average to yield an output state with infidelity O(\ensuremathϵ2r)O({\ensuremath{\epsilon}}^{{2}^{r}})O(\ensuremathϵ2r) approaches 2r+1{2}^{r}+12r+1, which comes close to saturating the conjectured bound in another investigation [Bravyi and Haah, Phys. Rev. A 86, 052329 (2012)]. We show numerically that there exist multilevel protocols such that the average number of magic states consumed to distill from error rate \ensuremathϵin=0.01{\ensuremath{\epsilon}}_{\mathrm{in}}=0.01\ensuremathϵin​=0.01 to \ensuremathϵout{\ensuremath{\epsilon}}_{\mathrm{out}}\ensuremathϵout​ in the range 10\ensuremath−5{10}^{\ensuremath{-}5}10\ensuremath−5--10\ensuremath−40{10}^{\ensuremath{-}40}10\ensuremath−40 is about 14log10(1/\ensuremathϵout)\ensuremath−4014{\mathrm{log}}_{10}(1/{\ensuremath{\epsilon}}_{\mathrm{out}})\ensuremath{-}4014log10​(1/\ensuremathϵout​)\ensuremath−40; the efficiency of multilevel distillation dominates all other reported protocols when distilling Hadamard magic states from initial infidelity 0.01 to any final infidelity below 10\ensuremath−7{10}^{\ensuremath{-}7}10\ensuremath−7. These methods are an important advance for magic-state distillation circuits in high-performance quantum computing and provide insight into the limitations of nearly resource-optimal quantum error correction.
The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the +1+1+1 eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the 151515-to-111 distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.
Magic-state distillation is a resource intensive subroutine for quantum computation. The ratio of noisy input states to output states with an error rate at most ε scales as O(log^{γ}(1/ε)) [S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86, 052329 (2012)10.1103/PhysRevA.86.052329]. In a breakthrough paper, Hastings and Haah [Distillation with Sublogarithmic Overhead, Phys. Rev. Lett. 120, 050504 (2018)10.1103/PhysRevLett.120.050504] showed that it is possible to construct distillation routines with a sublogarithmic overhead, achieving γ≈0.6779 and falsifying a conjecture that γ is lower bounded by 1. They then ask whether γ can be made arbitrarily close to 0. We answer this question in the affirmative for magic-state distillation routines using qudits of prime dimension (d dimensional quantum systems for prime d).
Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford operations, it needs to be performed on the logical qubits and hence incurs a large spatiotemporal overhead, which is one of the major bottlenecks for the realization of fault-tolerant quantum computers (FTQCs). Here we propose zero-level distillation, which prepares a high-fidelity logical magic state at the physical level, namely , using physical qubits and nearest-neighbor two-qubit gates on a square lattice. We develop a zero-level distillation circuit and show that distillation can be made even more efficient than the conventional sophisticated approaches with logical level distillations. The key idea involves the Knill -type distillation using the Steane code and its careful mapping to the square-lattice architecture with error detection. The distilled magic state on the Steane-code state is then teleported or converted to surface codes. We numerically find that the error rate of the logical magic state scales as approximately 100 × p 2 in terms of the physical error rate p . For example, with a physical error rate of p = 10 − 4 ( 10 − 3 ), the logical error rate is reduced to p L = 10 − 6 ( 10 − 4 ), resulting in an improvement of 2 (1) orders of magnitude. This contributes to reducing both space and time overhead for early FTQC as well as full-fledged FTQC combined with conventional multilevel distillation protocols.
Recently [1] we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called “inner codes” and “outer codes.” In Ref. [1], some small examples of these codes were given as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regime, using hundreds to thousands of qubits. We use BCH inner codes [2], combined with various outer codes. We extend the protocols of Ref. [1] by adding error correction in some cases. We present a variety of protocols in various input error regimes; in many cases these protocols require significantly fewer input magic states to obtain a given output error than previous protocols.
Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing with quantum error-correcting codes. Magic state distillation is the most well-studied method for this but requires significant resources. Hence, it is crucial to tailor and optimize magic state distillation for specific codes from both logical- and physical-level perspectives. In this work, we perform such optimization for two-dimensional color codes, which are promising due to their higher encoding rates compared to surface codes, transversal implementation of Clifford gates, and efficient lattice surgery. We propose two carefully designed distillation schemes based on the 15-to-1 distillation circuit and lattice surgery, differing in their methods for handling faulty rotations. Our first scheme employs faulty T measurement, achieving infidelities of O ( p 3 ) for physical noise strength p . To achieve lower infidelities, our second scheme integrates distillation with “cultivation” (a distillation-free approach to fault tolerantly prepare magic states through transversal Clifford measurements). Our second scheme achieves significantly lower infidelities (e.g., approximately 2 × 10 − 16 at p = 10 − 3 ), surpassing the capabilities of both cultivation and single-level distillation. Notably, to reach a given target infidelity, our schemes require approximately 2 orders of magnitude fewer resources than the previous best magic-state-distillation schemes for color codes.
Zero-level CCZCCZCCZ Distillation
Magic state distillation is a key component of fault-tolerant quantum computation, as it enables the implementation of non-Clifford gates such as the TTT gate and the CCZCCZCCZ gate via gate teleportation. However, conventional distillation protocols require a large number of logical qubits and introduce substantial spatial and temporal overhead, posing a significant bottleneck for scalable fault-tolerant quantum computation. In this work, we propose a zero-level distillation protocol that efficiently generates a high-fidelity logical CCZCCZCCZ magic state using only physical qubits on a two-dimensional square lattice with nearest-neighbor interactions. Our method leverages the transversal T/T†T/T^\daggerT/T† operation of the [[8,3,2]][[ 8,3,2 ]][[8,3,2]] code to fault-tolerantly encode the state CCZ‾∣+++⟩\overline{CCZ}|+++\rangleCCZ∣+++⟩, which is subsequently teleported to three surface-code logical qubits via lattice surgery. To enable teleportation between codes with different distances, we introduce adaptively initialized teleportation (AIT), a tailored initialization procedure for the surface code. Numerical simulations demonstrate that the logical error rate scales as pL≃300×p2p_L \simeq 300 \times p^2pL​≃300×p2 with respect to the physical error rate ppp. For example, the proposed method improves the logical error rate by approximately one and two orders of magnitude at p=10−3p = 10^{-3}p=10−3 and p=10−4p = 10^{-4}p=10−4, respectively, compared to conventional seven-TTT-gate approaches. The distillation circuit requires only 22 physical qubits, 3 logical qubits, and a circuit depth of 24, reducing the space-time overhead by a factor of approximately 5-10 compared to previous methods. This result highlights the practicality of CCZCCZCCZ-state distillation in early fault-tolerant quantum computation and offers a new direction toward resource-efficient physical-level magic state distillation beyond conventional TTT-state generation.