Magic state distillation (MSD) is the canonical route to non-Clifford gates in fault-tolerant quantum computation, but conventional nested factories exhibit qubit occupancy that grows multiplicatively with the number of distillation rounds. Recent work on constant-sized-support distillation protocols with qubit recycling (arXiv:2609.17044v1) proposes to hold the active qubit footprint fixed across rounds by recycling output qubits back into input registers. This paper develops a transparent, fully arithmetized resource-budget model of that proposal. We derive (i) the leading-order error suppression of a two-round 15-to-1 distillation ladder, giving output error 1,500,625 p⁹ for input error p (1.500625 × 10⁻²¹ at p = 10⁻³; 1.500625 × 10⁻¹² at p = 10⁻²); (ii) a peak-occupancy comparison showing that a recycled constant-support factory with a 15-state buffer reduces peak qubit count from 240 to 30, a factor-of-8 reduction; (iii) a recycling error budget showing that, under a stated worst-case linear depolarization model with per-reuse error δ = 10⁻⁵ and input error p₀ = 10⁻³, at most 10 reuses preserve input fidelity within 10% of nominal; and (iv) an energy attribution under one stated convention that yields ≈ 0.55 J per distilled magic state (± 0.07 J) when the model is anchored to a publicly reported benchmark energy of 5.5 × 10⁵ J per inference against a classical baseline of 0.0365 J (ratio 1.5 × 10⁷). All numerical results are analytic projections under explicitly stated assumptions, not simulations; divergences among independent draft analyses are documented in Appendix A, and every claim is attributed in Appendix B. We identify the experimental conditions under which the recycling advantage would be falsified. ## 1. Introduction Fault-tolerant quantum computation requires a gate set executed with error rates far below the threshold of the underlying quantum error-correcting code. For most code families, the transversal or lattice-surgery-accessible gate set i Full text and updates: papers.qnfo.org/papers/constant-sized-support-magic-state-distillation-with-qubit-recycling-a-reconcile/
Magic state distillation (MSD) is the canonical route to non-Clifford gates in fault-tolerant quantum computation, but conventional nested factories exhibit qubit occupancy that grows multiplicatively with the number of distillation rounds. Recent work on constant-sized-support distillation protocols with qubit recycling (arXiv:2609.17044v1) proposes to hold the active qubit footprint fixed across rounds by recycling output qubits back into input registers. This paper develops a transparent, fully arithmetized resource-budget model of that proposal. We derive (i) the leading-order error suppression of a two-round 15-to-1 distillation ladder, giving output error 1,500,625 p⁹ for input error p (1.500625 × 10⁻²¹ at p = 10⁻³; 1.500625 × 10⁻¹² at p = 10⁻²); (ii) a peak-occupancy comparison showing that a recycled constant-support factory with a 15-state buffer reduces peak qubit count from 240 to 30, a factor-of-8 reduction; (iii) a recycling error budget showing that, under a stated worst-case linear depolarization model with per-reuse error δ = 10⁻⁵ and input error p₀ = 10⁻³, at most 10 reuses preserve input fidelity within 10% of nominal; and (iv) an energy attribution under one stated convention that yields ≈ 0.55 J per distilled magic state (± 0.07 J) when the model is anchored to a publicly reported benchmark energy of 5.5 × 10⁵ J per inference against a classical baseline of 0.0365 J (ratio 1.5 × 10⁷). All numerical results are analytic projections under explicitly stated assumptions, not simulations; divergences among independent draft analyses are documented in Appendix A, and every claim is attributed in Appendix B. We identify the experimental conditions under which the recycling advantage would be falsified. ## 1. Introduction Fault-tolerant quantum computation requires a gate set executed with error rates far below the threshold of the underlying quantum error-correcting code. For most code families, the transversal or lattice-surgery-accessible gate set i Full text and updates: papers.qnfo.org/papers/constant-sized-support-magic-state-distillation-with-qubit-recycling-a-reconcile/
In order to circumvent that no universal set of gates can be achieved on a given quantum error-correcting codes, additional gates can be performed through magic state injection. This however requires to have access to high fidelity magic state, which can be obtained by the distillation of low quality states to fewer higher quality ones. In this paper, we provide a family of distillation protocols able to produce diagonal states at every level of the Clifford hierarchy. This family is obtained recursively using code doubling techniques and leveraging qubit recycling, the fact that some idle qubits of the protocols can be measured and re-used. At a given level of the Clifford hierarchy, we show that the protocols we derive can be performed at arbitrary high distance on a fix number of logical qubits. This family recovers many known efficient protocols, and uncovers new ones, such as a 111→1 protocol for ∣T⟩ state distillation at distance 7, which are the most compact in term of volume. Finally, we discuss possible extension of this framework for distillation protocols producing more than one output state.
Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance. Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates.
In this work, we present practical magic state distillation factories on Bivariate Bicycle (BB) codes that execute Pauli-measurement-based Clifford circuits inside a single BB code block. We formulate distillation circuit design as a joint optimization of logical qubit mapping, gate scheduling, measurement nativization, and protocol compression via qubit recycling. Based on detailed resource analysis and simulations, our BB factories have space-time volume comparable to that of leading distillation factories while delivering lower target error at a smaller qubit footprint, and are particularly compelling as second-round distillers following magic state cultivations.
Producing high-fidelity magic states using the smallest possible number of physical qubits and operations stands as a very important challenge to achieve fault-tolerant quantum computation at scale. Besides emerging proposals for alternative methods such as cultivation, magic state distillation remains essential for achieving very low error rates. Known distillation protocols are usually built through quantum codes derived from triorthogonal matrices. Here, exploiting the specific noise structure present in magic state distillation protocols, we show that classical error-correcting codes offer a simpler framework for deriving these protocols. This formulation is particularly well suited to systematic numerical and analytical studies of distillation protocols involving a fixed number of qubits. Specifically, we use a SAT solver to derive a series of no-go theorems that relate key figures of merit, including the number of qubits and the factory distance. In particular, considering the standard implementation as a circuit of Z-diagonal Pauli product rotations followed by measurements, we show that no T-to-T distillation protocol on fewer than eight qubits can exceed distance 3, and no T-to-CCZ protocol distance 2. Our results also include new such distillation protocols with the smallest number of qubits for a given distance in the literature, namely distance 4 and 5 T-to-T protocols supported on 10 and 11 qubits, as well as distance 3 and 4 T-to-CCZ distillation protocols supported on 9 and 10 qubits. Finally, going beyond unitary circuits by recycling qubits through mid-circuit measurement and reinitialization, we obtain an implementation of the distance-5 49T-to-1T protocol on only 5 active qubits.
Zero-level CCZ 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 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† operation of the [[8,3,2]] code to fault-tolerantly encode the state CCZ∣+++⟩, 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×p2 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.
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below ε, typically grows as O(logγ(1/ε)). Achieving smaller overheads, i.e., smaller exponents γ, is highly desirable; however, all existing protocols require polylogarithmically growing overheads with some γ>0, and identifying the smallest achievable exponent γ for distilling magic states of qubits has remained challenging. To address this issue, we develop magic state distillation protocols for qubits with efficient, polynomial-time decoding that achieve an O(1) overhead, meaning the optimal exponent γ=0; this improves over the previous best of γ≈0.678 due to Hastings and Haah. In our construction, we employ algebraic geometry codes to explicitly present asymptotically good quantum codes for 210-dimensional qudits that support transversally implementable logical gates in the third level of the Clifford hierarchy. The use of asymptotically good codes with non-vanishing rate and relative distance leads to the constant overhead. These codes can be realised by representing each 210-dimensional qudit as a set of 10 qubits, using stabiliser operations on qubits. The 10-qubit magic states distilled with these codes can be converted to and from conventional magic states for the controlled-controlled-Z (CCZ) and T gates on qubits with only a constant overhead loss, making it possible to achieve constant-overhead distillation of such standard magic states for qubits. These results resolve the fundamental open problem in quantum information theory concerning the construction of magic state distillation protocols with the optimal exponent.
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.