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:2007.07929 · Quantum

Measurement sequences for magic state distillation

Jeongwan Haah, Matthew B. Hastings

Published Jan 20, 2021• 4 citations
arXivHTMLPDF

Abstract

Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of ZZ on horizontal pairs of qubits, XX on vertical pairs, and Z,X on single qubits.

DOI
10.22331/q-2021-01-20-383

Related papers

Magic state distillation with permutation-invariant codes and a two-qubit example

Heather Leitch, Yingkai Ouyang

Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.

quant-pharXiv:2603.04310•Mar 5, 2026•1 citation

Pre-distillation of magic states via composite schemes

Muhammad Erew, Moshe Goldstein, Yaron Oz +1 more

Magic state distillation (MSD) is a cornerstone of fault-tolerant quantum computing, enabling non-Clifford gates via state injection into stabilizer circuits. However, the substantial overhead of current MSD protocols remains a major obstacle to scalable implementations. We propose a general framework for pre-distillation, based on composite pulse sequences that suppress systematic errors in the generation of magic states. While most composite designs target simple gates such as X, Z, or Hadamard, our schemes directly implement the non-Clifford T gate with enhanced robustness to the targeted systematic errors. We develop composite sequences tailored to the dominant control imperfections in superconducting, trapped-ion, neutral-atom, and integrated photonic platforms. To quantify improvement in the implementation, we introduce an operationally motivated fidelity measure specifically tailored to the T gate: the T-magic error, which captures the gate's effectiveness in preparing high-fidelity magic states. We further show that the error in the channel arising from the injection of faulty magic states scales linearly with the leading-order error of the states. Within the systematic-error-dominated regimes considered, this approach lowers the number of required distillation levels by up to three across the platforms we study, translating to substantial qubit-overhead savings and offering a practical route toward more resource-efficient universal quantum computation.

arXiv:2510.00804•Physical Review A•May 29, 2026•2 citations

Magic state distillation with low space overhead and optimal asymptotic input count

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

We present an infinite family of protocols to distill magic states for T -gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T -gate depth of the circuit scale linearly in the logarithm of the target error δ (up to log ⁡ log ⁡ 1 / δ ). Unlike other distillation protocols, this protocol achieves this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. The protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. The protocol relies on the construction of weakly self-dual CSS codes with many logical qubits and large distance, allowing us to implement control-SWAPs on multiple qubits. We call this code the "inner code". The control-SWAPs are then used to measure properties of the magic state and detect errors, using another code that we call the "outer code". Alternatively, we use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. We present several specific small examples of this protocol.

arXiv:1703.07847•Quantum•Oct 3, 2017•89 citations

Magic-state distillation with low overhead

Sergey B. Bravyi, Jeongwan Haah

We propose a family of error-detecting stabilizer codes with an encoding rate of $1/3$ that permit a transversal implementation of the gate $T=\mathrm{exp}(\ensuremath{-}i\ensuremath{\pi}Z/8)$ on all logical qubits. These codes are used to construct protocols for distilling high-quality ``magic'' states $T\left|+\right\ensuremath{\rangle}$ by Clifford group gates and Pauli measurements. The distillation overhead scales as $O({\mathrm{log}}^{\ensuremath{\gamma}}(1/\ensuremath{\epsilon}))$, where $\ensuremath{\epsilon}$ is the output accuracy and $\ensuremath{\gamma}={\mathrm{log}}_{2}(3)\ensuremath{\approx}1.6$. To construct the desired family of codes, we introduce the notion of a triorthogonal matrix, a binary matrix in which any pair and any triple of rows have even overlap. Any triorthogonal matrix gives rise to a stabilizer code with a transversal $T$ gate on all logical qubits, possibly augmented by Clifford gates. A powerful numerical method for generating triorthogonal matrices is proposed. Our techniques lead to a twofold overhead reduction for distilling magic states with accuracy $\ensuremath{\epsilon}\ensuremath{\sim}{10}^{\ensuremath{-}12}$ compared with previously known protocols.

arXiv:1209.2426•Physical Review A•Nov 27, 2012•436 citations

Constant-depth magic state cultivation with Clifford measurements by gauging

Bence Hetényi, Benjamin J. Brown, Dominic J. Williamson

Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measuring the transversal Clifford operator of the color code. Cultivation achieves $\sim 10^{-9}$ logical error rates for the $d=5$ color code, with substantially lower space-time overhead than magic state distillation. However, due to the $\mathcal{O}(d)$ depth of the Clifford measurement circuit, magic state cultivation becomes impractical for $d>5$. Here, we perform logical $XS^\dagger$ measurements on the color code by gauging a transversal Clifford gate, resulting in a constant-depth logical measurement circuit. We employ repeated gauging measurements with post-selection rather than performing error correction on the Clifford stabilizer code that emerges during the gauging protocol, thus gaining simplicity at the cost of scalability. Our protocol requires a regular square grid connectivity and yields logical error rates comparable to magic state cultivation. The $d=7$ version of our protocol gives access to the $10^{-12}$ logical error rate regime at $0.05\%$ physical error rate while retaining more than $1\%$ of the shots after the equivalent of the cultivation stage.

quant-pharXiv:2603.05429•Physical Review Letters•Mar 6, 2026•15 citations

Magic state distillation without measurements and post-selection

Sascha Heußen

Magic state distillation (MSD) is a quantum algorithm that enables performing logical non-Clifford gates with, in principle, arbitrarily low noise levels. It is typically assumed herein that logical Clifford gates can be executed without noise. Therefore, MSD is a standard subroutine used to obtain a fault-tolerant universal set of quantum gate operations on error-corrected logical qubits. Well-known schemes conventionally rely on performing operator measurements and post-selection based on the measurement result, which makes distillation protocols non-deterministic in the presence of noise. In this work, we adapt the 15-to-1 MSD protocol such that it deterministically suppresses noise by using a coherent feedback network on the output states without the need to perform individual-qubit measurements. These advantages over textbook MSD come at the price of reducing the noise suppression per round from O(p3) to O(p2). Our technique can be applied to any MSD protocol with an acceptance rate of 1 in the absence of noise. It may be desirable to use our scheme if the coherent feedback network can be executed faster and more reliably than the measurements, and/or if logical clock cycles in the quantum processor should be kept synchronous at all times. Our result broadens the path of potential experimental realizations of MSD in near-term devices and advances the development of fault-tolerant quantum computers with practical use.

arXiv:2504.17509•APL Quantum•Dec 1, 2025•3 citations
Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of ZZ on horizontal pairs of qubits, XX on vertical pairs, and Z,X on single qubits.
Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.
Magic state distillation (MSD) is a cornerstone of fault-tolerant quantum computing, enabling non-Clifford gates via state injection into stabilizer circuits. However, the substantial overhead of current MSD protocols remains a major obstacle to scalable implementations. We propose a general framework for pre-distillation, based on composite pulse sequences that suppress systematic errors in the generation of magic states. While most composite designs target simple gates such as X, Z, or Hadamard, our schemes directly implement the non-Clifford T gate with enhanced robustness to the targeted systematic errors. We develop composite sequences tailored to the dominant control imperfections in superconducting, trapped-ion, neutral-atom, and integrated photonic platforms. To quantify improvement in the implementation, we introduce an operationally motivated fidelity measure specifically tailored to the T gate: the T-magic error, which captures the gate's effectiveness in preparing high-fidelity magic states. We further show that the error in the channel arising from the injection of faulty magic states scales linearly with the leading-order error of the states. Within the systematic-error-dominated regimes considered, this approach lowers the number of required distillation levels by up to three across the platforms we study, translating to substantial qubit-overhead savings and offering a practical route toward more resource-efficient universal quantum computation.
We present an infinite family of protocols to distill magic states for T -gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T -gate depth of the circuit scale linearly in the logarithm of the target error δ (up to log ⁡ log ⁡ 1 / δ ). Unlike other distillation protocols, this protocol achieves this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. The protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. The protocol relies on the construction of weakly self-dual CSS codes with many logical qubits and large distance, allowing us to implement control-SWAPs on multiple qubits. We call this code the "inner code". The control-SWAPs are then used to measure properties of the magic state and detect errors, using another code that we call the "outer code". Alternatively, we use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. We present several specific small examples of this protocol.
We propose a family of error-detecting stabilizer codes with an encoding rate of 1/31/31/3 that permit a transversal implementation of the gate $T=\mathrm{exp}(\ensuremath{-}i\ensuremath{\pi}Z/8)$ on all logical qubits. These codes are used to construct protocols for distilling high-quality ``magic'' states $T\left|+\right\ensuremath{\rangle}$ by Clifford group gates and Pauli measurements. The distillation overhead scales as $O({\mathrm{log}}^{\ensuremath{\gamma}}(1/\ensuremath{\epsilon}))$, where $\ensuremath{\epsilon}$ is the output accuracy and $\ensuremath{\gamma}={\mathrm{log}}_{2}(3)\ensuremath{\approx}1.6$. To construct the desired family of codes, we introduce the notion of a triorthogonal matrix, a binary matrix in which any pair and any triple of rows have even overlap. Any triorthogonal matrix gives rise to a stabilizer code with a transversal TTT gate on all logical qubits, possibly augmented by Clifford gates. A powerful numerical method for generating triorthogonal matrices is proposed. Our techniques lead to a twofold overhead reduction for distilling magic states with accuracy $\ensuremath{\epsilon}\ensuremath{\sim}{10}^{\ensuremath{-}12}$ compared with previously known protocols.
Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measuring the transversal Clifford operator of the color code. Cultivation achieves ∼10−9\sim 10^{-9}∼10−9 logical error rates for the d=5d=5d=5 color code, with substantially lower space-time overhead than magic state distillation. However, due to the O(d)\mathcal{O}(d)O(d) depth of the Clifford measurement circuit, magic state cultivation becomes impractical for d>5d>5d>5. Here, we perform logical XS†XS^\daggerXS† measurements on the color code by gauging a transversal Clifford gate, resulting in a constant-depth logical measurement circuit. We employ repeated gauging measurements with post-selection rather than performing error correction on the Clifford stabilizer code that emerges during the gauging protocol, thus gaining simplicity at the cost of scalability. Our protocol requires a regular square grid connectivity and yields logical error rates comparable to magic state cultivation. The d=7d=7d=7 version of our protocol gives access to the 10−1210^{-12}10−12 logical error rate regime at 0.05%0.05\%0.05% physical error rate while retaining more than 1%1\%1% of the shots after the equivalent of the cultivation stage.
Magic state distillation (MSD) is a quantum algorithm that enables performing logical non-Clifford gates with, in principle, arbitrarily low noise levels. It is typically assumed herein that logical Clifford gates can be executed without noise. Therefore, MSD is a standard subroutine used to obtain a fault-tolerant universal set of quantum gate operations on error-corrected logical qubits. Well-known schemes conventionally rely on performing operator measurements and post-selection based on the measurement result, which makes distillation protocols non-deterministic in the presence of noise. In this work, we adapt the 15-to-1 MSD protocol such that it deterministically suppresses noise by using a coherent feedback network on the output states without the need to perform individual-qubit measurements. These advantages over textbook MSD come at the price of reducing the noise suppression per round from O(p3) to O(p2). Our technique can be applied to any MSD protocol with an acceptance rate of 1 in the absence of noise. It may be desirable to use our scheme if the coherent feedback network can be executed faster and more reliably than the measurements, and/or if logical clock cycles in the quantum processor should be kept synchronous at all times. Our result broadens the path of potential experimental realizations of MSD in near-term devices and advances the development of fault-tolerant quantum computers with practical use.