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

Universal fault-tolerant quantum computation with Bacon-Shor codes

Theodore J. Yoder

Published May 4, 2017• 46 citations
arXivHTMLPDF

Abstract

We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an $m\times m^k$ lattice have transversal $k$-qubit-controlled $Z$. Through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant CCZ. We calculate pseudothresholds for our universal gate set on the smallest $3\times3$ Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.

DOI
10.48550/arxiv.1705.01686

Related papers

Practical fault-tolerant quantum computation

Theodore J. Yoder

For the past two and a half decades, a subset of the physics community has been focused on building a new type of computer, one that exploits the superposition, interference, and entanglement of quantum states to compute faster than a classical computer on select tasks. Manipulating quantum systems requires great care, however, as they are quite sensitive to many sources of noise. Surpassing the limits of hardware fabrication and control, quantum error-correcting codes can reduce error-rates to arbitrarily low levels, albeit with some overhead. This thesis takes another look at several aspects of stabilizer code quantum error-correction to discover solutions to the practical problems of choosing a code, using it to correct errors, and performing fault-tolerant operations. Our first result looks at limitations on the simplest implementation of fault-tolerant operations, transversality. By defining a new property of stabilizer codes, the disjointness, we find transversal operations on stabilizer codes are limited to the Clifford hierarchy and thus are not universal for computation. Next, we address these limitations by designing non-transversal fault-tolerant operations that can be used to universally compute on some codes. The key idea in our constructions is that error-correction is performed at various points partway through the non-transversal operation (even at points when the code is not-necessarily still a stabilizer code) to catch errors before they spread. Since the operation is thus divided into pieces, we dub this pieceable fault-tolerance. In applying pieceable fault tolerance to the Bacon-Shor family of codes, we find an interesting tradeoff between space and time, where a fault-tolerant controlled-controlled-Z operation takes less time as the code becomes more asymmetric, eventually becoming transversal. Further, with a novel error-correction procedure designed to preserve the coherence of errors, we design a reasonably practical implementation of the controlled-controlled-Z operation on the smallest Bacon-Shor code. Our last contribution is a new family of topological quantum codes, the triangle codes, which operate within the limits of a 2-dimensional plane. These codes can perform all encoded Clifford operations within the plane. Moreover, we describe how to do the same for the popular family of surface codes, by relation to the triangle codes.

•Jan 1, 2018•1 citation

Low Overhead Universal Quantum Computation with Triorthogonal Codes

Dawei Jiao, Mahdi Bayanifar, Alexei Ashikhmin +1 more

We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a transversal gate set. We show that our methods reduce the resource overhead compared with existing fault-tolerant protocols. We develop a simple fault-tolerant implementation of the logical Hadamard gate for triorthogonal codes by exploiting the fact that they have transversal controlled-Z (CZ) gates, resulting in a circuit with reduced overhead. We also introduce a procedure for generating a symmetric Calderbank-Shor-Steane code paired with a triorthogonal code, which allows CNOT and CZ gate transversality across the pair of codes. In addition, we present logical state teleportation circuits that transfer encoded states between the two codes, allowing all logical operations to be performed transversally. Our methods can be integrated into the Steane error correction framework without incurring additional resource cost. Finally, using the 15-qubit code as an example, we demonstrate that our protocols significantly reduce the gate overhead compared with other existing methods. These results highlight the potential of combining distinct code structures to achieve low-overhead, universal fault-tolerant quantum computation.

quant-pharXiv:2510.05708•Oct 8, 2025•2 citations

Universal Quantum Computation via Scalable Measurement-Free Error Correction

Stefano Veroni, Alexandru Paler, Giacomo Giudice

We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical gate. Combined with a fold-transversal logical Hadamard gate, this enables a universal set of fault-tolerant operations using only transversal gates and qubit permutations. For the purpose of benchmarking under circuit-level noise, we develop an efficient method to simulate non-Clifford circuits with a small number of Hadamard gates. Separately, we demonstrate that certain CSS codes can be concatenated without measurements or having to rely on a universal logical gate set. This is made possible by means of a resource-efficient gadget—termed the “disposable Toffoli gadget”—that realizes the error-correcting feedback. Then, under concatenation of the Bacon-Shor code, we observe a fault-tolerance threshold at a circuit-level depolarizing noise rate of approximately 0.12 % . Together, the deformation and concatenation protocols outline a blueprint for a fully fault-tolerant architecture without any feed-forward operation, particularly suited to state-of-the-art neutral-atom platforms.

arXiv:2412.15187•PRX Quantum•Nov 14, 2025•11 citations

Addressable gate-based logical computation with quantum LDPC codes

Laura Pecorari, Francesco Paolo Guerci, Hugo Perrin +1 more

Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.

quant-pharXiv:2511.06124•Nov 11, 2025•9 citations

Fault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes

Isaac L. Chuang, Andrew W. Cross

Quantum computers have been shown to efficiently solve a class of problems for which no efficient solution is otherwise known. Physical systems can implement quantum computation, but devising realistic schemes is an extremely challenging problem largely due to the effect of noise. A quantum computer that is capable of correctly solving problems more rapidly than modern digital computers requires some use of so-called fault-tolerant components. Code-based fault-tolerance using quantum error-correcting codes is one of the most promising and versatile of the known routes for fault-tolerant quantum computation. This dissertation presents three main, new results about code-based fault-tolerant quantum computer architectures. The first result is a large new family of quantum codes that go beyond stabilizer codes, the most well-studied family of quantum codes. Our new family of codeword stabilized codes contains all known codes with optimal parameters. Furthermore, we show how to systematically find, construct, and understand such codes as a pair of codes: an additive quantum code and a classical (nonlinear) code. Second, we resolve an open question about universality of so-called transversal gates acting on stabilizer codes. Such gates are universal for classical fault-tolerant computation, but they were conjectured to be insufficient for universal fault-tolerant quantum computation. We show that transversal gates have a restricted form and prove that some important families of them cannot be quantum universal. This is strong evidence that so-called quantum software is necessary to achieve universality, and, therefore, fault-tolerant quantum computer architecture is fundamentally different from classical computer architecture. Finally, we partition the fault-tolerant design problem into levels of a hierarchy of concatenated codes and present methods, compatible with rigorous threshold theorems, for numerically evaluating these codes. The methods are applied to measure inner error-correcting code performance, as a first step toward elucidation of an effective fault-tolerant quantum computer architecture that uses no more than a physical, inner, and outer level of coding. Of the inner codes, the Golay code gives the highest pseudothreshold of 2 × 10-3. A comparison of logical error rate and overhead shows that the Bacon-Shor codes are competitive with Knill's C 4/C6 scheme at a base error rate of 10 -4. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)

•Jan 1, 2008•7 citations

Complementary 3D color codes for transversal quantum logic

Friederike Butt, Luis Colmenarez, Erik Weilandt +3 more

Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantum error-correcting code. We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-transformed counterpart, which we call the H-tetrahedral code. The two encodings support complementary transversal non-Clifford operations. Combined with bitwise Hadamard transformations that switch between the two encodings and a one-way transversal logical CNOT from the tetrahedral code to the H-tetrahedral code, these operations realize an almost-universal transversal logical gate set that enables both the creation of entanglement and logical states with magic. We complete a universal gate set through a pieceably fault-tolerant round-robin construction of a logical controlled-$Z$ gate between two H-tetrahedral codes. This logical entangling gate is interleaved with reduced-overhead Steane-type syndrome extraction using logical two-dimensional color-code auxiliary qubits. Our construction provides a new route toward implementing classically hard-to-simulate quantum algorithms where magic and most entangling operations are transversal while the resource overhead is concentrated in a small number of non-transversal Clifford entangling operations.

quant-pharXiv:2607.05107•Jul 7, 2026•2 citations
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an m×mkm\times m^km×mk lattice have transversal kkk-qubit-controlled ZZZ. Through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant CCZ. We calculate pseudothresholds for our universal gate set on the smallest 3×33\times33×3 Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.
For the past two and a half decades, a subset of the physics community has been focused on building a new type of computer, one that exploits the superposition, interference, and entanglement of quantum states to compute faster than a classical computer on select tasks. Manipulating quantum systems requires great care, however, as they are quite sensitive to many sources of noise. Surpassing the limits of hardware fabrication and control, quantum error-correcting codes can reduce error-rates to arbitrarily low levels, albeit with some overhead. This thesis takes another look at several aspects of stabilizer code quantum error-correction to discover solutions to the practical problems of choosing a code, using it to correct errors, and performing fault-tolerant operations. Our first result looks at limitations on the simplest implementation of fault-tolerant operations, transversality. By defining a new property of stabilizer codes, the disjointness, we find transversal operations on stabilizer codes are limited to the Clifford hierarchy and thus are not universal for computation. Next, we address these limitations by designing non-transversal fault-tolerant operations that can be used to universally compute on some codes. The key idea in our constructions is that error-correction is performed at various points partway through the non-transversal operation (even at points when the code is not-necessarily still a stabilizer code) to catch errors before they spread. Since the operation is thus divided into pieces, we dub this pieceable fault-tolerance. In applying pieceable fault tolerance to the Bacon-Shor family of codes, we find an interesting tradeoff between space and time, where a fault-tolerant controlled-controlled-Z operation takes less time as the code becomes more asymmetric, eventually becoming transversal. Further, with a novel error-correction procedure designed to preserve the coherence of errors, we design a reasonably practical implementation of the controlled-controlled-Z operation on the smallest Bacon-Shor code. Our last contribution is a new family of topological quantum codes, the triangle codes, which operate within the limits of a 2-dimensional plane. These codes can perform all encoded Clifford operations within the plane. Moreover, we describe how to do the same for the popular family of surface codes, by relation to the triangle codes.
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a transversal gate set. We show that our methods reduce the resource overhead compared with existing fault-tolerant protocols. We develop a simple fault-tolerant implementation of the logical Hadamard gate for triorthogonal codes by exploiting the fact that they have transversal controlled-Z (CZ) gates, resulting in a circuit with reduced overhead. We also introduce a procedure for generating a symmetric Calderbank-Shor-Steane code paired with a triorthogonal code, which allows CNOT and CZ gate transversality across the pair of codes. In addition, we present logical state teleportation circuits that transfer encoded states between the two codes, allowing all logical operations to be performed transversally. Our methods can be integrated into the Steane error correction framework without incurring additional resource cost. Finally, using the 15-qubit code as an example, we demonstrate that our protocols significantly reduce the gate overhead compared with other existing methods. These results highlight the potential of combining distinct code structures to achieve low-overhead, universal fault-tolerant quantum computation.
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical gate. Combined with a fold-transversal logical Hadamard gate, this enables a universal set of fault-tolerant operations using only transversal gates and qubit permutations. For the purpose of benchmarking under circuit-level noise, we develop an efficient method to simulate non-Clifford circuits with a small number of Hadamard gates. Separately, we demonstrate that certain CSS codes can be concatenated without measurements or having to rely on a universal logical gate set. This is made possible by means of a resource-efficient gadget—termed the “disposable Toffoli gadget”—that realizes the error-correcting feedback. Then, under concatenation of the Bacon-Shor code, we observe a fault-tolerance threshold at a circuit-level depolarizing noise rate of approximately 0.12 % . Together, the deformation and concatenation protocols outline a blueprint for a fully fault-tolerant architecture without any feed-forward operation, particularly suited to state-of-the-art neutral-atom platforms.
Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.
Quantum computers have been shown to efficiently solve a class of problems for which no efficient solution is otherwise known. Physical systems can implement quantum computation, but devising realistic schemes is an extremely challenging problem largely due to the effect of noise. A quantum computer that is capable of correctly solving problems more rapidly than modern digital computers requires some use of so-called fault-tolerant components. Code-based fault-tolerance using quantum error-correcting codes is one of the most promising and versatile of the known routes for fault-tolerant quantum computation. This dissertation presents three main, new results about code-based fault-tolerant quantum computer architectures. The first result is a large new family of quantum codes that go beyond stabilizer codes, the most well-studied family of quantum codes. Our new family of codeword stabilized codes contains all known codes with optimal parameters. Furthermore, we show how to systematically find, construct, and understand such codes as a pair of codes: an additive quantum code and a classical (nonlinear) code. Second, we resolve an open question about universality of so-called transversal gates acting on stabilizer codes. Such gates are universal for classical fault-tolerant computation, but they were conjectured to be insufficient for universal fault-tolerant quantum computation. We show that transversal gates have a restricted form and prove that some important families of them cannot be quantum universal. This is strong evidence that so-called quantum software is necessary to achieve universality, and, therefore, fault-tolerant quantum computer architecture is fundamentally different from classical computer architecture. Finally, we partition the fault-tolerant design problem into levels of a hierarchy of concatenated codes and present methods, compatible with rigorous threshold theorems, for numerically evaluating these codes. The methods are applied to measure inner error-correcting code performance, as a first step toward elucidation of an effective fault-tolerant quantum computer architecture that uses no more than a physical, inner, and outer level of coding. Of the inner codes, the Golay code gives the highest pseudothreshold of 2 × 10-3. A comparison of logical error rate and overhead shows that the Bacon-Shor codes are competitive with Knill's C 4/C6 scheme at a base error rate of 10 -4. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantum error-correcting code. We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-transformed counterpart, which we call the H-tetrahedral code. The two encodings support complementary transversal non-Clifford operations. Combined with bitwise Hadamard transformations that switch between the two encodings and a one-way transversal logical CNOT from the tetrahedral code to the H-tetrahedral code, these operations realize an almost-universal transversal logical gate set that enables both the creation of entanglement and logical states with magic. We complete a universal gate set through a pieceably fault-tolerant round-robin construction of a logical controlled-ZZZ gate between two H-tetrahedral codes. This logical entangling gate is interleaved with reduced-overhead Steane-type syndrome extraction using logical two-dimensional color-code auxiliary qubits. Our construction provides a new route toward implementing classically hard-to-simulate quantum algorithms where magic and most entangling operations are transversal while the resource overhead is concentrated in a small number of non-transversal Clifford entangling operations.