{ "id": "epnah31dfd", "slug": "state-distillation-quantum-computing", "title": "State distillation (quantum computing)", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.algorithms" } ], "geo": [ { "id": "geo.nongeo.t2001.technology.computing.ai.algorithms", "label": "Non-geographic · 2001 to 2020: Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.algorithms", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.algorithms" } ] } ], "excerpt": "State distillation is a quantum computing protocol that converts many noisy quantum states into fewer, higher-fidelity copies, enabling the non-Clifford gates required for universal fault-tolerant computation.", "snippet": "State distillation is a quantum computing protocol that converts many noisy quantum states into fewer, higher-fidelity copies, enabling the non-Clifford gates required for universal fault-tolerant computation.", "node": "technology.computing.ai.algorithms", "markdown": "# State distillation (quantum computing)\n\nState distillation is a quantum computing protocol that converts many noisy quantum states into fewer, higher-fidelity copies, the standard route to the non-Clifford gates required for universal fault-tolerant quantum computation.[1](https://iopscience.iop.org/article/10.1088/2058-9565/ace6ca) A protocol consumes \\( n \\) noisy |T⟩ states with input error \\( p_{\\mathrm{in}} \\) and produces \\( k \\) cleaner states with \\( p_{\\mathrm{out}} = C \\cdot p_{\\mathrm{in}}^{d} \\) at first order, for some distance \\( d > 1 \\) and prefactor \\( C > 0 \\).[2](https://arxiv.org/pdf/2606.07734) The central trade-off is fidelity against overhead: runs in which an error is detected are discarded.[3](https://www.nature.com/articles/ncomms1166)\n\n| Key fact | Value |\n|---|---|\n| Input–output relation | \\( n \\) noisy |T⟩ states in, \\( k \\) cleaner states out, with \\( p_{\\mathrm{out}} = C \\cdot p_{\\mathrm{in}}^{d} \\)[2](https://arxiv.org/pdf/2606.07734) |\n| 15-to-1 protocol | 15 noisy |T⟩ states to 1 cleaner state via the quantum Reed–Muller [[15, 1, 3]] code, with \\( p_{\\mathrm{out}} = 35 p_{\\mathrm{in}}^{3} \\)[2](https://arxiv.org/pdf/2606.07734) |\n| Convergence thresholds | About 65% polarization along a magic direction[4](https://journals.aps.org/pra/abstract/10.1103/PhysRevA.71.022316); 14.148% input error for H eigenstates in the 15-qubit-code protocol[5](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036) |\n| Scaling exponents \\( \\gamma \\) | ≈ 2.46 (15-to-1), ≈ 2.32 (10-to-2), ≈ 1.6 (triorthogonal codes); multilevel protocols approach 1[6](https://ar5iv.labs.arxiv.org/html/1210.3388) |\n| Example factory cost | (15-to-1)\\(_{7,3,3}\\) at physical error rate \\( 10^{-4} \\): output error \\( 4.4 \\times 10^{-8} \\), 810 qubits, 18.1 cycles, 14,600 qubit-cycles per state[7](https://quantum-journal.org/papers/q-2019-12-02-205/pdf/) |\n| Cultivation alternative | Logical error rates as low as \\( 2 \\times 10^{-9} \\) at \\( 10^{-3} \\) circuit noise, with an order of magnitude fewer qubit·rounds than prior work[8](https://doi.org/10.48550/arxiv.2409.17595) |\n| Recent development | Constant-overhead protocols with exponent \\( \\gamma = 0 \\) for |T⟩ and |CCZ⟩ states[9](https://www.nature.com/articles/s41567-025-03026-0) |\n\n## How it works\n\nStabilizer operations, meaning Clifford unitaries plus Pauli measurements, are efficiently classically simulatable by the [Gottesman–Knill theorem](https://www.edgepedia.org/gottesman-knill-theorem) and therefore not universal; adding any one-qubit unitary that is not a Clifford up to overall phase restores universality.[10](https://www.rintonpress.com/xxqic9/qic-9-1112/1030-1052.pdf) Magic states are the resource states from which such non-Clifford gates are constructed, combining with the transversal Clifford gates of stabilizer codes to give universal fault-tolerant computation.[1](https://iopscience.iop.org/article/10.1088/2058-9565/ace6ca) Because fault-tolerant schemes can produce magic states only with realistic error rates of about \\( 10^{-3} \\), while useful computation demands error rates below \\( 10^{-10} \\), a purification step is required.[2](https://arxiv.org/pdf/2606.07734)\n\nThe mechanism is postselected error detection. In the five-qubit protocol, five copies of a faulty magic state are projected into the codespace of the five-qubit code with stabilizer generators \\( XZZX \\, I \\), \\( I \\, XZZX \\), \\( X \\, I \\, XZZ \\), and \\( ZX \\, I \\, XZ \\).[10](https://www.rintonpress.com/xxqic9/qic-9-1112/1030-1052.pdf) Four stabilizers are measured, and if any outcome is −1 the state is discarded and the attempt fails.[3](https://www.nature.com/articles/ncomms1166) Runs with the trivial syndrome are kept, and the decoding transformation yields an output whose m-polarization exceeds the input's; iterating drives the polarization toward 1.[3](https://www.nature.com/articles/ncomms1166) The procedure is a many-to-one map that keeps only runs with no detected error, rather than a copying operation.[3](https://www.nature.com/articles/ncomms1166)\n\n## How it is done\n\nThe 15-to-1 protocol encodes 15 copies of \\( \\rho \\) into a 15-qubit code, applies the decoding circuit, and rejects the output if any errors are detected.[5](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036) The code is the quantum Reed–Muller [[15, 1, 3]] code, and the result is 15 noisy |T⟩ states distilled to 1 cleaner |T⟩ state with \\( p_{\\mathrm{out}} = 35 p_{\\mathrm{in}}^{3} \\).[2](https://arxiv.org/pdf/2606.07734) The exact output error is\n\n\\[ p_{\\mathrm{out}} = \\frac{1 - 15(1-2p)^{7} + 15(1-2p)^{8} - (1-2p)^{15}}{2\\left(1 + 15(1-2p)^{8}\\right)} \\]\n\nwhich gives an error threshold of about 14.148% below which H eigenstates can be distilled.[5](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036) The output error is cubic in the input error.[2](https://arxiv.org/pdf/2606.07734)\n\n## Origin\n\nThe 2004 preprint \"Universal Quantum Computation with ideal Clifford gates and noisy ancillas\" by Sergei Bravyi and [Alexei Kitaev](https://www.edgepedia.org/alexei-kitaev) considered a model limited to Clifford unitaries, |0⟩ preparation, and computational-basis measurement, plus a noisy one-qubit ancilla \\( \\rho \\), and constructed the purification protocols described above.[11](https://doi.org/10.48550/arxiv.quant-ph/0403025) The work was published in [Physical Review A](https://www.edgepedia.org/physical-review-a) in 2005.[4](https://journals.aps.org/pra/abstract/10.1103/PhysRevA.71.022316) A follow-up paper by Bravyi describes a scheme due to Knill, based on using fourteen copies of \\( \\rho \\) to apply a faulty logical controlled-Hadamard to the 7-bit Steane/[Hamming code](https://www.edgepedia.org/hamming-code), that achieves the exact same \\( p_{\\mathrm{out}} \\); encoding a fifteenth copy makes it equivalent in output error, though with a \\( 2^{14} \\) times smaller acceptance probability.[5](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036) Published accounts differ on attribution: one credits the 15-to-1 routine to that independent scheme,[6](https://ar5iv.labs.arxiv.org/html/1210.3388) while another credits the 15-to-1 Reed–Muller protocol to Bravyi and Kitaev;[2](https://arxiv.org/pdf/2606.07734) both constructions give the same output error.\n\n## Variants\n\nProtocol efficiency is characterized by the exponent \\( \\gamma \\): \\( O(\\log^{\\gamma}(\\epsilon_{\\mathrm{in}}/\\epsilon_{\\mathrm{out}})) \\) input states are needed per output state of infidelity \\( \\epsilon_{\\mathrm{out}} \\).[6](https://ar5iv.labs.arxiv.org/html/1210.3388) [Distillation](https://www.edgepedia.org/distillation) of the T eigenstate uses a projection onto the 5-qubit distance-3 code, with an input error threshold of 0.173, while H eigenstate distillation uses the 15-qubit [Reed–Muller code](https://www.edgepedia.org/reed-muller-code) with threshold 0.141.[12](https://doi.org/10.26421/qic13.3-4-2) The 10-to-2 routine, introduced by Adam M. Meier, Bryan Eastin, and [Emanuel Knill](https://www.edgepedia.org/emanuel-knill) in Quantum Information and Computation (2013), distills 2 improved |H⟩ states from 10 inputs using the four-qubit error-detecting code, with threshold \\( p_{t} = 0.089 \\). Triorthogonal codes, introduced in \"Magic-state distillation with low overhead\" by Sergey Bravyi and Jeongwan Haah (Physical Review A, 2012), reduce the overhead of magic-state distillation.[13](https://doi.org/10.1103/physreva.86.052329) Multilevel protocols with \\( r \\) rounds require \\( 2^{r} + 1 \\) input states per output, so \\( \\gamma = \\log(2^{r}+1)/\\log(2^{r}) \\rightarrow 1 \\) as \\( r \\rightarrow \\infty \\), approaching the conjectured bound \\( \\gamma \\geq 1 \\).[6](https://ar5iv.labs.arxiv.org/html/1210.3388) A related family, often called synthillation, consumes |T⟩ states to produce high-quality |CCZ⟩ = CCZ|+++⟩ states injected to perform Toffoli gates.[2](https://arxiv.org/pdf/2606.07734)\n\nThree recent developments have changed the overhead picture. Magic state cultivation, described by Craig Gidney, Noah Shutty, and Cody Jones in 2024, gradually grows the size and reliability of one T state inside a surface code (2D-lattice quantum error-correcting code) patch, using roughly the same number of physical gates as a lattice surgery CNOT gate of equivalent reliability; it reaches logical error rates as low as \\( 2 \\times 10^{-9} \\) under \\( 10^{-3} \\) uniform depolarizing circuit noise.[8](https://doi.org/10.48550/arxiv.2409.17595) Zero-level distillation, described by Tomohiro Itogawa and colleagues in PRX Quantum (2025), prepares a high-fidelity logical magic state at the physical level, using physical qubits and nearest-neighbor two-qubit gates on a square lattice.[14](https://doi.org/10.1103/thxx-njr6) Protocols using algebraic-geometry quantum codes with transversal non-Clifford gates and an efficient decoder achieve the optimal exponent \\( \\gamma = 0 \\), constant overhead, for |T⟩ and |CCZ⟩ states.[9](https://www.nature.com/articles/s41567-025-03026-0)\n\n## Applications\n\nResource-estimation work by Litinski quantifies what 15-to-1 distillation costs inside surface-code fault-tolerant schemes. A full-distance (15-to-1)\\(_{7,3,3}\\) factory at physical error rate \\( 10^{-4} \\) yields output error \\( 4.4 \\times 10^{-8} \\) using 810 qubits, 18.1 cycles, and 14,600 qubit-cycles per output state.[7](https://quantum-journal.org/papers/q-2019-12-02-205/pdf/) A four-level factory, (15-to-1)\\(_{9,3,3}\\) × (20-to-4)\\(_{15,7,9}\\) at \\( 10^{-4} \\), reaches output error \\( 2.4 \\times 10^{-15} \\) with 16,400 qubits, 90.3 cycles, and 371,000 qubit-cycles per output state.[7](https://quantum-journal.org/papers/q-2019-12-02-205/pdf/) Cultivation hits a floor at \\( p_{\\mathrm{out}} \\approx 10^{-7} \\) for input error rates of \\( p_{\\mathrm{in}} \\approx 10^{-3} \\), so recent resource estimation uses cultivation as a first step followed by a final distillation phase.[2](https://arxiv.org/pdf/2606.07734)\n\n## Limitations and alternatives\n\nDistillation converges only above its threshold: inputs must have error below about 14.148% for H states in the 15-to-1 routine, 0.173 for T states via the five-qubit code, and 0.089 for the 10-to-2 routine.[5](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036) The postselection mechanism also means most attempts are discarded. The main documented alternative is cultivation, which is cheaper per state in the \\( 10^{-7} \\) to \\( 10^{-9} \\) regime but does not by itself reach the \\( 10^{-10} \\) or better error rates that \\( 10^{8} \\)-gate computations require, leaving a final distillation stage in current designs.[2](https://arxiv.org/pdf/2606.07734) • [8](https://doi.org/10.48550/arxiv.2409.17595) Failure modes such as correlated errors and leakage are not quantified in the protocols described above, which treat input error as an independent per-state probability.\n\n## References\n\n1. [Magic state distillation and cost analysis in fault-tolerant universal quantum computation (Quantum Science and Technology, 2023)](https://iopscience.iop.org/article/10.1088/2058-9565/ace6ca)\n2. [Exploring the landscape of compact magic-state distillation factories (arXiv:2606.07734)](https://arxiv.org/pdf/2606.07734)\n3. [Experimental magic state distillation for fault-tolerant quantum computing (Nature Communications)](https://www.nature.com/articles/ncomms1166)\n4. [Universal quantum computation with ideal Clifford gates and noisy ancillas (Bravyi & Kitaev, Phys. Rev. A 71, 022316, 2005)](https://journals.aps.org/pra/abstract/10.1103/PhysRevA.71.022316)\n5. [Improved magic states distillation for quantum universality (Bravyi, quant-ph/0411036)](https://ar5iv.labs.arxiv.org/html/quant-ph/0411036)\n6. [Multilevel distillation of magic states for quantum computing (arXiv:1210.3388)](https://ar5iv.labs.arxiv.org/html/1210.3388)\n7. [Magic State Distillation: Not as Costly as You Think (Litinski, Quantum)](https://quantum-journal.org/papers/q-2019-12-02-205/pdf/)\n8. [Gidney, Craig, Shutty, Noah, Jones, Cody (2024). Magic state cultivation: growing T states as cheap as CNOT gates. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2409.17595)\n9. [Constant-overhead magic state distillation (Nature Physics, 2025)](https://www.nature.com/articles/s41567-025-03026-0)\n10. [Stabilizer Quantum Mechanics and Magic State Distillation (Quantum Information & Computation 9, 1030–1052)](https://www.rintonpress.com/xxqic9/qic-9-1112/1030-1052.pdf)\n11. [Bravyi, Sergei, Kitaev, Alexei (2004). Universal Quantum Computation with ideal Clifford gates and noisy ancillas. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.quant-ph/0403025)\n12. [Magic state distillation with the four-qubit code (Meier, Eastin, Knill)](https://doi.org/10.26421/qic13.3-4-2)\n13. [Sergey Bravyi, Jeongwan Haah (2012). Magic-state distillation with low overhead. Physical Review A.](https://doi.org/10.1103/physreva.86.052329)\n14. [Tomohiro Itogawa and colleagues (2025). Efficient Magic State Distillation by Zero-Level Distillation. PRX Quantum.](https://doi.org/10.1103/thxx-njr6)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Algorithms and computational methods*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [], "url": "https://www.edgepedia.org/state-distillation-quantum-computing", "markdown_url": "https://www.edgepedia.org/state-distillation-quantum-computing.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"State distillation (quantum computing)\", Edgepedia (EdgeChat), https://www.edgepedia.org/state-distillation-quantum-computing. Edgepedia Community License 1.0.", "credit_md": "\"[State distillation (quantum computing)](https://www.edgepedia.org/state-distillation-quantum-computing)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/state-distillation-quantum-computing](https://www.edgepedia.org/state-distillation-quantum-computing). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"State distillation (quantum computing)\", Edgepedia (EdgeChat), https://www.edgepedia.org/state-distillation-quantum-computing. Edgepedia Community License 1.0.", "speakable": "State distillation is a quantum computing protocol that converts many noisy quantum states into fewer, higher-fidelity copies, enabling the non-Clifford gates required for universal fault-tolerant computation." }