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

Hybrid magic state distillation for universal fault-tolerant quantum computation

Wenqiang Zheng, Ya-Fei Yu, Jian Pan, Jingfu Zhang, Jun Li, Zhaokai Li, Dieter Suter, Xianyi Zhou, Xinhua Peng, Jiangfeng Du

Published Feb 17, 2015• 6 citations
arXivHTMLPDF

Abstract

A set of stabilizer operations augmented by some special initial states known as ``magic states'' gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that introduce noise. The most common method to eliminate the noise is magic state distillation (MSD) by stabilizer operations. Here we propose a hybrid MSD protocol by connecting a four-qubit $H$-type MSD with a five-qubit $T$-type MSD in order to overcome the shortcomings of the previous MSD protocols. The hybrid MSD protocol further integrates distillable ranges of different existing MSD protocols and provides considerable improvement in qubit cost. Moreover, we experimentally demonstrate the four-qubit $H$-type MSD protocol using nuclear magnetic resonance technology, together with the previous five-qubit MSD experiment, to show the feasibility of the hybrid MSD protocol.

DOI
10.1103/physreva.91.022314

Related papers

Qutrit magic state distillation

Hussain Anwar, Earl T. Campbell, Dan E. Browne

Magic state distillation (MSD) is a purification protocol that plays an important role in fault-tolerant quantum computation. Repeated iteration of the steps of an MSD protocol generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. MSD was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher-dimensional qudit-based computation. Here, we describe a general approach for studying MSD in higher dimensions. We use it to investigate the features of a qutrit MSD protocol based on the five-qutrit stabilizer code. We show that this protocol distils non-stabilizer magic states, and identify two types of states that are attractors of this iteration map. Finally, we show how these states may be converted, via stabilizer circuits alone, into a state suitable for state-injected implementation of a non-Clifford phase gate, enabling non-Clifford unitary computation.

arXiv:1202.2326•New Journal of Physics•Jun 7, 2012•110 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 and cost analysis in fault-tolerant universal quantum computation

Yiting Liu, Zhi Ma, Lan Luo +5 more

Abstract Magic states have been widely studied in recent years as resource states that help quantum computers achieve fault-tolerant universal quantum computing. The fault-tolerant quantum computing requires fault-tolerant implementation of a set of universal logical gates. Stabilizer code, as a commonly used error correcting code with good properties, can apply the Clifford gates transversally which is fault tolerant. But only Clifford gates cannot realize universal computation. Magic states are introduced to construct non-Clifford gates that combine with Clifford operations to achieve universal quantum computing. Since the preparation of quantum states is inevitably accompanied by noise, preparing the magic state with high fidelity and low overhead is the crucial problem to realizing universal quantum computation. In this paper, we survey the related literature in the past 20 years and introduce the common types of magic states, the protocols to obtain high-fidelity magic states, and overhead analysis for these protocols. Finally, we discuss the future directions of this field.

Quantum Science and Technology•Jul 12, 2023•9 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

From Magic State Distillation to Dynamical Systems

Yunzhe Zheng, Dong E. Liu

Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes with transversal T gates, there exists quite several protocols that don't fall into this class. Here we propose a method to map MSD protocols to iterative dynamical systems under the framework of stabilizer reduction. With the proposed mapping, we are able to analyze the performance of MSD protocols using techniques from dynamical systems theory, easily simulate the distillation process of input states under arbitrary noise and visualize it using flow diagram. We apply our mapping to common MSD protocols for |T⟩ state and find some interesting properties: The [[15,1,3]] code may distill states corresponding to T gate and the [[5,1,3]] code can distill the magic state corresponding to the T gate. Besides, we examine the exotic MSD protocols that may distill into other magic states proposed in [Eur. Phys. J. D 70, 55 (2016)] and identify the condition for distillable magic states. We also study new MSD protocols generated by concatenating different codes and numerically demonstrate that concatenation can generate MSD protocols with various magic states. By concatenating efficient codes with exotic codes, we can reduce the overhead of the exotic MSD protocols. We believe our proposed method will be a useful tool for simulating and visualization MSD protocols for canonical MSD protocols on |T⟩ as well as other unexplored MSD protocols for other states.

arXiv:2412.04402•Quantum•Sep 15, 2025•6 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
A set of stabilizer operations augmented by some special initial states known as ``magic states'' gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that introduce noise. The most common method to eliminate the noise is magic state distillation (MSD) by stabilizer operations. Here we propose a hybrid MSD protocol by connecting a four-qubit HHH-type MSD with a five-qubit TTT-type MSD in order to overcome the shortcomings of the previous MSD protocols. The hybrid MSD protocol further integrates distillable ranges of different existing MSD protocols and provides considerable improvement in qubit cost. Moreover, we experimentally demonstrate the four-qubit HHH-type MSD protocol using nuclear magnetic resonance technology, together with the previous five-qubit MSD experiment, to show the feasibility of the hybrid MSD protocol.
Magic state distillation (MSD) is a purification protocol that plays an important role in fault-tolerant quantum computation. Repeated iteration of the steps of an MSD protocol generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. MSD was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher-dimensional qudit-based computation. Here, we describe a general approach for studying MSD in higher dimensions. We use it to investigate the features of a qutrit MSD protocol based on the five-qutrit stabilizer code. We show that this protocol distils non-stabilizer magic states, and identify two types of states that are attractors of this iteration map. Finally, we show how these states may be converted, via stabilizer circuits alone, into a state suitable for state-injected implementation of a non-Clifford phase gate, enabling non-Clifford unitary computation.
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.
Abstract Magic states have been widely studied in recent years as resource states that help quantum computers achieve fault-tolerant universal quantum computing. The fault-tolerant quantum computing requires fault-tolerant implementation of a set of universal logical gates. Stabilizer code, as a commonly used error correcting code with good properties, can apply the Clifford gates transversally which is fault tolerant. But only Clifford gates cannot realize universal computation. Magic states are introduced to construct non-Clifford gates that combine with Clifford operations to achieve universal quantum computing. Since the preparation of quantum states is inevitably accompanied by noise, preparing the magic state with high fidelity and low overhead is the crucial problem to realizing universal quantum computation. In this paper, we survey the related literature in the past 20 years and introduce the common types of magic states, the protocols to obtain high-fidelity magic states, and overhead analysis for these protocols. Finally, we discuss the future directions of this field.
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.
Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes with transversal T gates, there exists quite several protocols that don't fall into this class. Here we propose a method to map MSD protocols to iterative dynamical systems under the framework of stabilizer reduction. With the proposed mapping, we are able to analyze the performance of MSD protocols using techniques from dynamical systems theory, easily simulate the distillation process of input states under arbitrary noise and visualize it using flow diagram. We apply our mapping to common MSD protocols for |T⟩ state and find some interesting properties: The [[15,1,3]] code may distill states corresponding to T gate and the [[5,1,3]] code can distill the magic state corresponding to the T gate. Besides, we examine the exotic MSD protocols that may distill into other magic states proposed in [Eur. Phys. J. D 70, 55 (2016)] and identify the condition for distillable magic states. We also study new MSD protocols generated by concatenating different codes and numerically demonstrate that concatenation can generate MSD protocols with various magic states. By concatenating efficient codes with exotic codes, we can reduce the overhead of the exotic MSD protocols. We believe our proposed method will be a useful tool for simulating and visualization MSD protocols for canonical MSD protocols on |T⟩ as well as other unexplored MSD protocols for other states.
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.