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

Bulletin of the American Physical Society

Magic state distillation protocols with noisy Clifford gates

Peter Brooks

Published Mar 20, 2013• 0 citations
OpenAlex

Related papers

Magic State Distillation from Qudit Stabilizer Codes

Abhi Kumar Sharma, Shayan Srinivasa Garani

Magic state distillation (MSD) is a procedure to purify noisy non-stabilizer states from a quantum code, useful towards fault-tolerant quantum computing. Quantum circuits requiring non-Clifford gates can be realized using special states called magic states that are the eigenstates of both non-Clifford and Clifford gates. The purification of noisy states is realized by projecting these magic states onto the space spanned by the eigenstates of the projection operator of the stabilizer code. Given a noisy non- stabilizer state from a given stabilizer code, not all states can be distilled towards magic states. In this paper, we provide the condition for distillability of magic states specific to the choice of qudit stabilizer codes. We derive the noise threshold for magic state distillation depending on the code parameters. We prove that magic state distillation is a convergent map in the entropic sense. We also give an efficient decoding circuit for the best-known code to distill the$\left|H_i\right\rangle$state, which is an eigenstate of the qutrit Hadamard gate.

International Conference on Communications•Jun 9, 2024•0 citations

On the Structure of Protocols for Magic State Distillation

Earl T. Campbell, Dan E. Browne

Lecture notes in computer science•Jan 1, 2009•25 citations

A study of the robustness of magic state distillation against Clifford gate faults

Tomas Jochym-O’Connor

Quantum error correction and fault-tolerance are at the heart of any scalable quantum computation architecture. Developing a set of tools that satisfy the requirements of fault- tolerant schemes is thus of prime importance for future quantum information processing implementations. The Clifford gate set has the desired fault-tolerant properties, preventing bad propagation of errors within encoded qubits, for many quantum error correcting codes, yet does not provide full universal quantum computation. Preparation of magic states can enable universal quantum computation in conjunction with Clifford operations, however preparing magic states experimentally will be imperfect due to implementation errors. Thankfully, there exists a scheme to distill pure magic states from prepared noisy magic states using only operations from the Clifford group and measurement in the Z-basis, such a scheme is called magic state distillation [1]. This work investigates the robustness of magic state distillation to faults in state preparation and the application of the Clifford gates in the protocol. We establish that the distillation scheme is robust to perturbations in the initial state preparation and characterize the set of states in the Bloch sphere that converge to the T-type magic state in different fidelity regimes. Additionally, we show that magic state distillation is robust to low levels of gate noise and that performing the distillation scheme using noisy Clifford gates is a more efficient than using encoded fault-tolerant gates due to the large overhead in fault-tolerant quantum computing architectures.

•Sep 4, 2012•0 citations

Experimental magic state distillation for fault-tolerant quantum computing

Alexandre M. Souza, Jingfu Zhang, Colm A. Ryan +1 more

arXiv:1103.2178•Nature Communications•Jan 25, 2011•55 citations

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

Experimental demonstration of logical magic state distillation

Pedro Sales Rodriguez, J. Michael Robinson, Niklas Jepsen +70 more

arXiv:2412.15165•Nature•Jul 14, 2025•133 citations
Magic state distillation (MSD) is a procedure to purify noisy non-stabilizer states from a quantum code, useful towards fault-tolerant quantum computing. Quantum circuits requiring non-Clifford gates can be realized using special states called magic states that are the eigenstates of both non-Clifford and Clifford gates. The purification of noisy states is realized by projecting these magic states onto the space spanned by the eigenstates of the projection operator of the stabilizer code. Given a noisy non- stabilizer state from a given stabilizer code, not all states can be distilled towards magic states. In this paper, we provide the condition for distillability of magic states specific to the choice of qudit stabilizer codes. We derive the noise threshold for magic state distillation depending on the code parameters. We prove that magic state distillation is a convergent map in the entropic sense. We also give an efficient decoding circuit for the best-known code to distill the∣Hi⟩\left|H_i\right\rangle∣Hi​⟩state, which is an eigenstate of the qutrit Hadamard gate.
Quantum error correction and fault-tolerance are at the heart of any scalable quantum computation architecture. Developing a set of tools that satisfy the requirements of fault- tolerant schemes is thus of prime importance for future quantum information processing implementations. The Clifford gate set has the desired fault-tolerant properties, preventing bad propagation of errors within encoded qubits, for many quantum error correcting codes, yet does not provide full universal quantum computation. Preparation of magic states can enable universal quantum computation in conjunction with Clifford operations, however preparing magic states experimentally will be imperfect due to implementation errors. Thankfully, there exists a scheme to distill pure magic states from prepared noisy magic states using only operations from the Clifford group and measurement in the Z-basis, such a scheme is called magic state distillation [1]. This work investigates the robustness of magic state distillation to faults in state preparation and the application of the Clifford gates in the protocol. We establish that the distillation scheme is robust to perturbations in the initial state preparation and characterize the set of states in the Bloch sphere that converge to the T-type magic state in different fidelity regimes. Additionally, we show that magic state distillation is robust to low levels of gate noise and that performing the distillation scheme using noisy Clifford gates is a more efficient than using encoded fault-tolerant gates due to the large overhead in fault-tolerant quantum computing architectures.
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.