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:2510.10835

Rigorous estimation of error thresholds of transversal Clifford logical circuits

Yichen Xu, Yiqing Zhou, James P. Sethna, Eun-Ah Kim

Published Oct 12, 2025• 0 citations
arXivHTMLPDF

Abstract

The threshold theorem promises a path to fault-tolerant quantum computation, provided the physical error rate is below a critical threshold. While transversal gates efficiently implement logical operations, they propagate errors and can lower this threshold relative to a static quantum memory. In this work, we generalize the statistical-mechanical (stat-mech) mapping from quantum memories to logical circuits with transversal gates, thereby enabling rigorous, decoder-independent thresholds for fault-tolerant logical computation. We first demonstrate the framework for two toric code blocks undergoing a transversal CNOT (tCNOT) gate, quantifying two independent error-spreading mechanisms. For persistent bit-flip errors with perfect syndromes, the stat-mech model is a 2D random Ashkin-Teller model. Monte Carlo simulation and finite-size scaling show that the tCNOT reduces the optimal bit-flip threshold to $p=0.080$, a $26\%$ decrease from the toric code memory threshold $p=0.109$. With syndrome errors included, the circuit maps to a 3D random 4-body Ising model with a plane defect, yielding a conservative estimate $p\geq 0.028$, a modest $15\%$ reduction from the memory threshold $p=0.033$. Beyond the tCNOT gate, we derive stat-mech models for all transversal Clifford gates of the toric code, including the fold-transversal Hadamard and $S$ gates, and generalize the framework to arbitrary CSS codes, proving that each transversal gate modifies the stat-mech model only locally in time. By reducing threshold analysis of fault-tolerant logical circuits to the study of classical spin models with local defects, our framework provides a systematic, decoder-independent benchmark for near-term fault-tolerant architectures.

DOI
10.48550/arxiv.2510.10835

Related papers

Novel Methods in Quantum Error Correction

Tomas Jochym-O’Connor

Quantum error correction is the backbone of fault-tolerant quantum computation, a necessary requirement for any large scale quantum computer. The fault-tolerance threshold theorem has long been a target for experimental precision, allowing for the possibility of reducing logical error rates to arbitrarily low levels without excessive overhead. While there are many promising fault-tolerant architectures, the path towards the most practical fault-tolerant scheme is far from decided and may vary for differing physical models. This thesis proposes new schemes for universal fault-tolerant quantum computation in both the concatenated and topological code settings. \n \nThrough the concatenation of two different error correcting codes, a set of universal fault-tolerant gates can be obtained without requiring the need for magic state distillation. A lower bound of $1.28 \\times 10^{-3}$ for the fault-tolerance threshold under circuit level depolarizing noise is obtained. Additionally, stacked codes are proposed as a means to simulate the action of a 3D topological code in 2D, allowing for the application of a universal set of transversal operations. While fault-tolerant, unfortunately the scheme does not exhibit a threshold due to the decreasing pseudo-threshold with growing code distance, yet points to potential interesting avenues for fault-tolerant computation in 2D without distillation. \n \nOne of the primary avenues to constructing fault-tolerant logical operations is through transversal operations. In this thesis, the set of single qubit logical gates that can be implemented transversally are characterized and determined to all belong to the Clifford hierarchy. Moreover, any diagonal two-qubit operation that can be applied transversally must belong to the same level of the Clifford hierarchy as the set of gates that can be implemented in the single-qubit case. \n \nThe opposite to quantum error correction is privacy, where the output of a channel is disguised from its input. The two are fundamentally related through the complementary channel construction. This thesis presents a new class of private quantum channels, expanding the existing class beyond a seemingly fundamental restriction. This yields interesting insights into the structure of quantum information and the leaking of information to external environments. Additionally, the duality is only recovered when extending the complementary channel to sufficiently high environmental dimension. \n \nFinally, the error properties of bucket brigade quantum Random Access Memory (qRAM) are assessed. It is determined that using the bucket brigade qRAM architecture for the running of Grover's algorithm necessitates reducing the error rate of the individual components to exponentially small levels for an exponential sized memory. As such, fault-tolerant architectures will likely play an essential role in the construction of such computing primitives.

•Aug 24, 2016•0 citations

A Topologically Fault-Tolerant Quantum Computer with Four Dimensional Geometric Codes

David Aasen, Matthew B. Hastings, Vadym Kliuchnikov +8 more

Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional self-correcting quantum memory, and present codes targeted to both near-term and utility-scale quantum computers. We identify a full set of logical Clifford operations and with it design a universal fault-tolerant quantum architecture. Our design achieves single-shot error correction, significant reductions in required qubits, and low-depth logical operations. In turn, our proposed architecture relaxes the requirements for achieving fault tolerance and offers an efficient path for realization in several near-term quantum hardware implementations. Our [[96,6,8]] 4D Hadamard lattice code has low weight-6 stabilizers and depth-8 syndrome extraction circuits, a high pseudo-threshold of $\sim 0.01$, and a logical error rate of $\sim 10^{-6}$ per logical qubit per round of error correction at $10^{-3}$ physical error rate under a standard circuit-level noise model. A Clifford-complete logical gate set is presented, including a constructive and efficient method for Clifford gate synthesis.

arXiv:2506.15130•Jun 18, 2025•0 citations

High-threshold decoding of non-Pauli codes for 2D universality

Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert +1 more

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit $X$ corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of $\approx 2.5\,\%$, close to the $\approx 2.9\,\%$ of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for $Z$ errors is required and the non-Clifford gates in the circuit reduce the threshold from $\approx 2.9\,\%$ to $\approx 1.8\,\%$ with a naive decoder. We show how $Z$ decoding can be improved using knowledge of the $X$ corrections, pushing the threshold to $\approx 2.2\,\%$. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose $X$ stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by $CCZ$, $CS$, and $T$ gates.

quant-pharXiv:2604.02033•Apr 3, 2026•0 citations

Fault-tolerant quantum computing with three-dimensional surface codes

Michael Vasmer

Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.

•Dec 28, 2019•2 citations

Ising on the donut: Regimes of topological quantum error correction from statistical mechanics

Lucas H. English, Sam Roberts, Stephen D. Bartlett +2 more

Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.

quant-pharXiv:2512.10399•PRX Quantum•Dec 12, 2025•0 citations

Error Correction of Transversal cnot Gates for Scalable Surface-Code Computation

Kaavya Sahay, Yingjia Lin, Shilin Huang +2 more

Recent experimental advances have made it possible to implement logical multiqubit transversal gates on surface codes in a multitude of platforms. A transversal controlled- (t) gate on two surface codes introduces correlated errors across the code blocks and thus requires modified decoding compared to established methods of decoding surface-code quantum memory (SCQM) or lattice-surgery operations. In this work, we examine and benchmark the performance of three different decoding strategies for the t for scalable fault-tolerant quantum computation. In particular, we present a low-complexity decoder based on minimum-weight perfect matching (MWPM) that achieves the same threshold as the SCQM MWPM decoder. We extend our analysis with a study of tailored decoding of a transversal-teleportation circuit, along with a comparison between the performance of lattice-surgery and transversal operations under Pauli- and erasure-noise models. Our investigation builds toward systematic estimation of the cost of implementing large-scale quantum algorithms based on transversal gates in the surface code.

arXiv:2408.01393•PRX Quantum•May 7, 2025•14 citations
The threshold theorem promises a path to fault-tolerant quantum computation, provided the physical error rate is below a critical threshold. While transversal gates efficiently implement logical operations, they propagate errors and can lower this threshold relative to a static quantum memory. In this work, we generalize the statistical-mechanical (stat-mech) mapping from quantum memories to logical circuits with transversal gates, thereby enabling rigorous, decoder-independent thresholds for fault-tolerant logical computation. We first demonstrate the framework for two toric code blocks undergoing a transversal CNOT (tCNOT) gate, quantifying two independent error-spreading mechanisms. For persistent bit-flip errors with perfect syndromes, the stat-mech model is a 2D random Ashkin-Teller model. Monte Carlo simulation and finite-size scaling show that the tCNOT reduces the optimal bit-flip threshold to p=0.080p=0.080p=0.080, a 26%26\%26% decrease from the toric code memory threshold p=0.109p=0.109p=0.109. With syndrome errors included, the circuit maps to a 3D random 4-body Ising model with a plane defect, yielding a conservative estimate p≥0.028p\geq 0.028p≥0.028, a modest 15%15\%15% reduction from the memory threshold p=0.033p=0.033p=0.033. Beyond the tCNOT gate, we derive stat-mech models for all transversal Clifford gates of the toric code, including the fold-transversal Hadamard and SSS gates, and generalize the framework to arbitrary CSS codes, proving that each transversal gate modifies the stat-mech model only locally in time. By reducing threshold analysis of fault-tolerant logical circuits to the study of classical spin models with local defects, our framework provides a systematic, decoder-independent benchmark for near-term fault-tolerant architectures.
Quantum error correction is the backbone of fault-tolerant quantum computation, a necessary requirement for any large scale quantum computer. The fault-tolerance threshold theorem has long been a target for experimental precision, allowing for the possibility of reducing logical error rates to arbitrarily low levels without excessive overhead. While there are many promising fault-tolerant architectures, the path towards the most practical fault-tolerant scheme is far from decided and may vary for differing physical models. This thesis proposes new schemes for universal fault-tolerant quantum computation in both the concatenated and topological code settings. \n \nThrough the concatenation of two different error correcting codes, a set of universal fault-tolerant gates can be obtained without requiring the need for magic state distillation. A lower bound of 1.28times10−31.28 \\times 10^{-3}1.28times10−3 for the fault-tolerance threshold under circuit level depolarizing noise is obtained. Additionally, stacked codes are proposed as a means to simulate the action of a 3D topological code in 2D, allowing for the application of a universal set of transversal operations. While fault-tolerant, unfortunately the scheme does not exhibit a threshold due to the decreasing pseudo-threshold with growing code distance, yet points to potential interesting avenues for fault-tolerant computation in 2D without distillation. \n \nOne of the primary avenues to constructing fault-tolerant logical operations is through transversal operations. In this thesis, the set of single qubit logical gates that can be implemented transversally are characterized and determined to all belong to the Clifford hierarchy. Moreover, any diagonal two-qubit operation that can be applied transversally must belong to the same level of the Clifford hierarchy as the set of gates that can be implemented in the single-qubit case. \n \nThe opposite to quantum error correction is privacy, where the output of a channel is disguised from its input. The two are fundamentally related through the complementary channel construction. This thesis presents a new class of private quantum channels, expanding the existing class beyond a seemingly fundamental restriction. This yields interesting insights into the structure of quantum information and the leaking of information to external environments. Additionally, the duality is only recovered when extending the complementary channel to sufficiently high environmental dimension. \n \nFinally, the error properties of bucket brigade quantum Random Access Memory (qRAM) are assessed. It is determined that using the bucket brigade qRAM architecture for the running of Grover's algorithm necessitates reducing the error rate of the individual components to exponentially small levels for an exponential sized memory. As such, fault-tolerant architectures will likely play an essential role in the construction of such computing primitives.
Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional self-correcting quantum memory, and present codes targeted to both near-term and utility-scale quantum computers. We identify a full set of logical Clifford operations and with it design a universal fault-tolerant quantum architecture. Our design achieves single-shot error correction, significant reductions in required qubits, and low-depth logical operations. In turn, our proposed architecture relaxes the requirements for achieving fault tolerance and offers an efficient path for realization in several near-term quantum hardware implementations. Our [[96,6,8]] 4D Hadamard lattice code has low weight-6 stabilizers and depth-8 syndrome extraction circuits, a high pseudo-threshold of ∼0.01\sim 0.01∼0.01, and a logical error rate of ∼10−6\sim 10^{-6}∼10−6 per logical qubit per round of error correction at 10−310^{-3}10−3 physical error rate under a standard circuit-level noise model. A Clifford-complete logical gate set is presented, including a constructive and efficient method for Clifford gate synthesis.
Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit XXX corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of ≈2.5 %\approx 2.5\,\%≈2.5%, close to the ≈2.9 %\approx 2.9\,\%≈2.9% of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for ZZZ errors is required and the non-Clifford gates in the circuit reduce the threshold from ≈2.9 %\approx 2.9\,\%≈2.9% to ≈1.8 %\approx 1.8\,\%≈1.8% with a naive decoder. We show how ZZZ decoding can be improved using knowledge of the XXX corrections, pushing the threshold to ≈2.2 %\approx 2.2\,\%≈2.2%. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose XXX stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by CCZCCZCCZ, CSCSCS, and TTT gates.
Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.
Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analysing QEC performance. However, predicting the behaviour of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly-solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansatze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.
Recent experimental advances have made it possible to implement logical multiqubit transversal gates on surface codes in a multitude of platforms. A transversal controlled- (t) gate on two surface codes introduces correlated errors across the code blocks and thus requires modified decoding compared to established methods of decoding surface-code quantum memory (SCQM) or lattice-surgery operations. In this work, we examine and benchmark the performance of three different decoding strategies for the t for scalable fault-tolerant quantum computation. In particular, we present a low-complexity decoder based on minimum-weight perfect matching (MWPM) that achieves the same threshold as the SCQM MWPM decoder. We extend our analysis with a study of tailored decoding of a transversal-teleportation circuit, along with a comparison between the performance of lattice-surgery and transversal operations under Pauli- and erasure-noise models. Our investigation builds toward systematic estimation of the cost of implementing large-scale quantum algorithms based on transversal gates in the surface code.