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

Efficient error models for fault-tolerant architectures and the Pauli twirling approximation

Michael R. Geller, Zhongyuan Zhou

Published Jul 12, 2013• 139 citations
arXivHTMLPDF

Abstract

The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical general-purpose method for constructing such an error model is to twirl a given completely positive channel over the Pauli basis, a procedure we refer to as the Pauli twirling approximation (PTA). In this work we test the accuracy of the PTA for a small stabilizer measurement circuit relevant to fault-tolerant quantum computation, in the presence of both intrinsic gate errors and decoherence, and find excellent agreement over a wide range of physical error rates. The combined simplicity and accuracy of the PTA, along with its direct connection to the $\ensuremath{\chi}$ matrix of process tomography, suggests that it can be used as a standard reference point for more refined error model constructions.

DOI
10.1103/physreva.88.012314

Related papers

Logical error rate in the Pauli twirling approximation

Amara Katabarwa, Michael R. Geller

The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling an arbitrary completely positive error channel over the Pauli basis, resulting in a Pauli channel. In this work, we test the PTA's accuracy at predicting the logical error rate by simulating the 5-qubit code using a 9-qubit circuit with realistic decoherence and unitary gate errors. We find evidence for good agreement with exact simulation, with the PTA overestimating the logical error rate by a factor of 2 to 3. Our results suggest that the PTA is a reliable predictor of the logical error rate, at least for low-distance codes.

Scientific Reports•Sep 30, 2015•24 citations

Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction

Sean R. Garner, Nathan M. Myers, Meng Wang +3 more

Stabilizer-based simulation of quantum error-correcting codes typically relies on the Pauli-twirling approximation (PTA) to render non-Clifford noise classically tractable, but PTA can distort the behavior of physically relevant channels such as thermal relaxation. Physically accurate noise simulation is needed to train decoders and understand the noise suppression capabilities of quantum error correction codes. In this work, we develop an exact and stabilizer-compatible model of qubit thermal relaxation noise and show that the combined amplitude damping and dephasing channel admits a fully positive probability decomposition into Clifford operations and reset whenever $T_2 \leqslant T_1$. For $T_2 > T_1$, the resulting decomposition is negative, but allows a smaller sampling overhead versus independent channels. We further introduce an approximated error channel with reset that removes the negativity of the decomposition while achieving higher channel fidelity to the true thermal relaxation than PTA, and extend our construction to finite temperature relaxation. We apply the exact combined model to investigate large surface codes and bivariate bicycle codes on superconducting platforms with realistic thermal relaxation error. The differing logical performances across code states further indicate that noise-model-informed decoders will be essential for accurately capturing thermal-noise structure in future fault-tolerant architectures.

quant-pharXiv:2512.09189•Physical Review Research•Dec 11, 2025•2 citations

A dynamical interpretation of the Pauli Twirling Approximation and Quantum Error Correction

Amara Katabarwa

One of simplest and most widely used error model in working with quantum circuits is the Pauli Twirling Approximation (PTA). Restricting ourselves to analysis of free dynamics of qubits we show explicitly how application of PTA is equivalent to ignoring most of the quantum back action of the system and give a general argument as to why this approximation leads to low logical error rates in fault tolerant stabilizer circuits as compared to other quantum channels. We provide numerical evidence that PTA's performance in modeling noise gets worse as number of qubits increase.

arXiv:1701.03708•Jan 13, 2017•15 citations

Scalable Exact Non-Pauli Noise Simulation for Fault-Tolerant Quantum Circuits

Yuewen Hou, Gokul Subramanian Ravi

Fault-tolerant quantum design relies on simulating noisy quantum error correction (QEC) circuits with hundreds to thousands of physical qubits and large circuit depths. High-throughput stabilizer simulators, such as Stim, are the de facto tools for this regime. However, these simulators typically support only Clifford gates and stochastic Pauli noise. As a result, more realistic device noise models-such as coherent control errors and thermal relaxation-are often approximated using Pauli Twirling. This replacement offers speed but can introduce inaccuracies. To address this, we propose QuasiStim for scalable exact QEC simulation of realistic noise, with QuasiFold as a compiler frontend and DeltaFrame as a sampling backend. QuasiFold lowers sampling overhead by merging equivalent non-Pauli sites in the quantum circuit. DeltaFrame samples the resulting stabilizer trajectories by reusing precomputed predicted references instead of resimulating the full tableau for each shot. QuasiFold can reduce the number of shots by over $100\times$ on bivariate-bicycle (BB) codes. Compared to a per-shot tableau simulator, DeltaFrame is $166\times$--$1331\times$ faster on rotated surface-code memory under coherent $R_Z$ noise as $d$ grows from 5 to 35. QuasiStim also makes the PTA bias measurable: the gap is non-negligible and varies with noise strength, decoder, and circuit schedule. QuasiStim will be open-sourced upon publication at https://github.com/isaachyw/QuasiStim

quant-pharXiv:2610.15975•Oct 13, 2026•0 citations

Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels

Zhenyu Cai, Simon C. Benjamin

Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirling and a way to construct a twirling gate set with a number of members comparable to the size of the Pauli basis of the given error channel, which is usually much smaller than the full set of Pauli gates. We also show that twirling is equivalent to stabiliser measurements with discarded measurement results, which enables us to further reduce the size of the twirling gate set.

arXiv:1807.04973•Scientific Reports•Aug 2, 2019•84 citations

Surface code with decoherence: An analysis of three superconducting architectures

Joydip Ghosh, Austin G. Fowler, Michael R. Geller

We consider realistic, multiparameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli ``depolarization'' channel via the Pauli twirl approximation, and obtain the logical error rate as a function of the qubit ${T}_{1,2}$ and state preparation, gate, and readout errors. A numerical Monte Carlo simulation is performed to obtain the logical error rates, and a leading-order analytic formula is derived to estimate their behavior below threshold. Our results suggest that scalable fault-tolerant quantum computation should be possible with existing superconducting devices.

arXiv:1210.5799•Physical Review A•Dec 19, 2012•93 citations
The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical general-purpose method for constructing such an error model is to twirl a given completely positive channel over the Pauli basis, a procedure we refer to as the Pauli twirling approximation (PTA). In this work we test the accuracy of the PTA for a small stabilizer measurement circuit relevant to fault-tolerant quantum computation, in the presence of both intrinsic gate errors and decoherence, and find excellent agreement over a wide range of physical error rates. The combined simplicity and accuracy of the PTA, along with its direct connection to the \ensuremathχ\ensuremath{\chi}\ensuremathχ matrix of process tomography, suggests that it can be used as a standard reference point for more refined error model constructions.
The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling an arbitrary completely positive error channel over the Pauli basis, resulting in a Pauli channel. In this work, we test the PTA's accuracy at predicting the logical error rate by simulating the 5-qubit code using a 9-qubit circuit with realistic decoherence and unitary gate errors. We find evidence for good agreement with exact simulation, with the PTA overestimating the logical error rate by a factor of 2 to 3. Our results suggest that the PTA is a reliable predictor of the logical error rate, at least for low-distance codes.
Stabilizer-based simulation of quantum error-correcting codes typically relies on the Pauli-twirling approximation (PTA) to render non-Clifford noise classically tractable, but PTA can distort the behavior of physically relevant channels such as thermal relaxation. Physically accurate noise simulation is needed to train decoders and understand the noise suppression capabilities of quantum error correction codes. In this work, we develop an exact and stabilizer-compatible model of qubit thermal relaxation noise and show that the combined amplitude damping and dephasing channel admits a fully positive probability decomposition into Clifford operations and reset whenever T2⩽T1T_2 \leqslant T_1T2​⩽T1​. For T2>T1T_2 > T_1T2​>T1​, the resulting decomposition is negative, but allows a smaller sampling overhead versus independent channels. We further introduce an approximated error channel with reset that removes the negativity of the decomposition while achieving higher channel fidelity to the true thermal relaxation than PTA, and extend our construction to finite temperature relaxation. We apply the exact combined model to investigate large surface codes and bivariate bicycle codes on superconducting platforms with realistic thermal relaxation error. The differing logical performances across code states further indicate that noise-model-informed decoders will be essential for accurately capturing thermal-noise structure in future fault-tolerant architectures.
One of simplest and most widely used error model in working with quantum circuits is the Pauli Twirling Approximation (PTA). Restricting ourselves to analysis of free dynamics of qubits we show explicitly how application of PTA is equivalent to ignoring most of the quantum back action of the system and give a general argument as to why this approximation leads to low logical error rates in fault tolerant stabilizer circuits as compared to other quantum channels. We provide numerical evidence that PTA's performance in modeling noise gets worse as number of qubits increase.
Fault-tolerant quantum design relies on simulating noisy quantum error correction (QEC) circuits with hundreds to thousands of physical qubits and large circuit depths. High-throughput stabilizer simulators, such as Stim, are the de facto tools for this regime. However, these simulators typically support only Clifford gates and stochastic Pauli noise. As a result, more realistic device noise models-such as coherent control errors and thermal relaxation-are often approximated using Pauli Twirling. This replacement offers speed but can introduce inaccuracies. To address this, we propose QuasiStim for scalable exact QEC simulation of realistic noise, with QuasiFold as a compiler frontend and DeltaFrame as a sampling backend. QuasiFold lowers sampling overhead by merging equivalent non-Pauli sites in the quantum circuit. DeltaFrame samples the resulting stabilizer trajectories by reusing precomputed predicted references instead of resimulating the full tableau for each shot. QuasiFold can reduce the number of shots by over 100×100\times100× on bivariate-bicycle (BB) codes. Compared to a per-shot tableau simulator, DeltaFrame is 166×166\times166×--1331×1331\times1331× faster on rotated surface-code memory under coherent RZR_ZRZ​ noise as ddd grows from 5 to 35. QuasiStim also makes the PTA bias measurable: the gap is non-negligible and varies with noise strength, decoder, and circuit schedule. QuasiStim will be open-sourced upon publication at https://github.com/isaachyw/QuasiStim
Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirling and a way to construct a twirling gate set with a number of members comparable to the size of the Pauli basis of the given error channel, which is usually much smaller than the full set of Pauli gates. We also show that twirling is equivalent to stabiliser measurements with discarded measurement results, which enables us to further reduce the size of the twirling gate set.
We consider realistic, multiparameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli ``depolarization'' channel via the Pauli twirl approximation, and obtain the logical error rate as a function of the qubit T1,2{T}_{1,2}T1,2​ and state preparation, gate, and readout errors. A numerical Monte Carlo simulation is performed to obtain the logical error rates, and a leading-order analytic formula is derived to estimate their behavior below threshold. Our results suggest that scalable fault-tolerant quantum computation should be possible with existing superconducting devices.