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:2503.01165 · npj Quantum Information

Fragility of Magic State Distillation under Imperfect Measurements

Yunzhe Zheng, Yuanchen Zhao, Dong E. Liu

Published Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

Magic state distillation (MSD) is the leading approach for producing the non-Clifford resources required for universal fault-tolerant quantum computation. Most prior analyses of MSD assume ideal projective stabilizer measurements, but this assumption becomes questionable on near-term hardware, where measurement fidelity is limited and large quantum error-correcting codes are unavailable. We consider imperfect measurements that are modeled as noisy projector controlled by measurement strength , which can be regarded as the inverse of measurement noise, and develop a general framework for analyzing MSD under imperfect stabilizer measurements. We focus on MSD protocols that are based on CSS codes with transversal non-Clifford gates, and show that MSD exhibits a measurement-strength threshold that is distinct from the previously known threshold on input-state error. When measurement strength is below a critical threshold, MSD loses its distillation power entirely; When measurement strength is above this threshold, distillation under imperfect measurements remains possible, but the asymptotic target states may deviate from the ideal magic states. In particular, this deviation is at most first-order biased. Moreover, we show that imperfect measurements with finite measurement strength reduce the distillation efficiency to linear, implying exponentially larger distillation overheads than in the ideal-measurement case. We further show that this fragility can be mitigated generally up to the code capacity of MSD protocols by choosing the stabilizer generators to measure in the standard form . Our results reveal fundamental constraints imposed by imperfect measurements on MSD and provide guidance for designing more robust distillation protocols in realistic quantum hardware.

DOI
10.1038/s41534-026-01373-1

Related papers

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•0 citations

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

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

The robustness of magic state distillation against errors in Clifford gates

Tomas Jochym-O’Connor, Ya-Fei Yu, Bassam Helou +1 more

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state~\cite{Bravyi}. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.

Quantum Information and Computation•May 1, 2013•17 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•2 citations

The robustness of magic state distillation against errors in Clifford gates

Tomas Jochym-O’Connor, Ya-Fei Yu, Bassam Helou +1 more

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state [1]. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.

arXiv:1205.6715•May 30, 2012•1 citation
Magic state distillation (MSD) is the leading approach for producing the non-Clifford resources required for universal fault-tolerant quantum computation. Most prior analyses of MSD assume ideal projective stabilizer measurements, but this assumption becomes questionable on near-term hardware, where measurement fidelity is limited and large quantum error-correcting codes are unavailable. We consider imperfect measurements that are modeled as noisy projector controlled by measurement strength , which can be regarded as the inverse of measurement noise, and develop a general framework for analyzing MSD under imperfect stabilizer measurements. We focus on MSD protocols that are based on CSS codes with transversal non-Clifford gates, and show that MSD exhibits a measurement-strength threshold that is distinct from the previously known threshold on input-state error. When measurement strength is below a critical threshold, MSD loses its distillation power entirely; When measurement strength is above this threshold, distillation under imperfect measurements remains possible, but the asymptotic target states may deviate from the ideal magic states. In particular, this deviation is at most first-order biased. Moreover, we show that imperfect measurements with finite measurement strength reduce the distillation efficiency to linear, implying exponentially larger distillation overheads than in the ideal-measurement case. We further show that this fragility can be mitigated generally up to the code capacity of MSD protocols by choosing the stabilizer generators to measure in the standard form . Our results reveal fundamental constraints imposed by imperfect measurements on MSD and provide guidance for designing more robust distillation protocols in realistic quantum hardware.
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.
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.
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state~\cite{Bravyi}. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.
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 have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state [1]. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.