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

Majorana-XYZ subsystem code

Tobias Busse, Lauri Toikka

quant-phcond-mat.mes-hallcond-mat.str-elSubmitted Mar 27, 2026• Announced Mar 30, 2026• 2 citations• Revised Jul 14, 2026 (v2)
v1 · Mar 27, 2026v2 · Jul 14, 2026v3 · Aug 1, 2026
arXivHTMLPDF

Abstract

Building fault-tolerant quantum computers is a current priority for the quantum computing industry and academic counterparts. We present a quantum error correction code encoding a single logical qubit into $n=L^2$ physical qubits with distance $d = L$ as a subsystem code, and $n-O(\sqrt{n})$ logical qubits with distance $d=3$ as a standard stabiliser code. The logical single-qubit gates in the subsystem code are transversal. Under independent $X,Z$ noise we find a threshold of $1.1\% \pm 0.3\%$ for odd distance and $0.6\% \pm 0.1\%$ for even distance for the subsystem variant. The code detects every 1- and 2-qubit error, and additionally every error of weight 3 and higher (constrained by the distance) that is not a product of the 3-qubit check operations. These operations act on the gauge qubits leaving the subsystem code space invariant. The code can be implemented by qubits in a triangular configuration with the plaquettes as 3-qubit check operations.

Related papers

Majorana subsystem qubit codes that also correct odd-weight errors

Sourav Kundu, Ben W. Reichardt

Abstract A potential platform for topological quantum computation is the Majorana-based tetron architecture. Its building blocks are superconducting islands called tetrons, which host four Majorana zero modes. Existing error correcting codes can correct even-weight errors on tetrons. In a previous proposal by us, we had shown that incorporating tetrons in the stabilizer group allows us to correct a combination of odd-weight errors and even-weight errors on tetrons. In this work, we show that inclusion of tetrons in the gauge group lets us create subsystem codes from conventional Pauli stabilizer codes, which can correct both kinds of errors. Compared to the previous approach, the current approach lets us construct codes with fewer stabilizer generators. This leads to shorter fault-tolerant sequence length, and improves the fault-tolerant pseudothreshold by as much as 84%.

arXiv:2311.01779•New Journal of Physics•May 3, 2024•3 citations

Restrictions on Transversal Encoded Quantum Gate Sets

Bryan Eastin, Emanuel H. Knill

Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.

arXiv:0811.4262•Physical Review Letters•Mar 18, 2009•541 citations

Fault-Tolerant Encoding of Logical Qudits in Spin Systems

Sumin Lim

Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical qudits in finite-dimensional spin systems. We construct distance-$3$, distance-$5$ codewords, and general $2t+1$-distance codes that can be implemented using a single physical qudit or a small number of coupled qudits for higher distances, while requiring a Hilbert space dimension significantly smaller than conventional constructions based on multiple logical qubits. Logical operations and error correction protocols can be implemented with polynomial scaling in the number of elementary operations. We further discuss schematic designs for physical implementation and required single-gate fidelities, which are compatible with current spin qudit platforms. This strategy provides a resource-efficient path toward realizing fault-tolerant logical qudits in finite multi-level physical systems.

quant-pharXiv:2511.06620•Physical Review A•Nov 11, 2025•0 citations

Lower overhead fault-tolerant building blocks for noisy quantum computers

Prithviraj Prabhu

Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.

quant-pharXiv:2605.12385•May 13, 2026•0 citations

Fault-tolerant fermionic quantum computation based on color code

Ying Li

An important approach to fault-tolerant quantum computation is protecting logical information using quantum error correction. Usually, logical information is in the form of logical qubits, which are encoded in physical qubits using quantum error correction codes. Compared with qubit quantum computation, fermionic quantum computation has advantages in quantum simulations of fermionic systems, e.g., molecules. In this paper, we show that fermionic quantum computation can be universal and fault tolerant if we encode logical Majorana fermions in physical Majorana fermions. We take a color code as an example to demonstrate the universal set of fault-tolerant operations on logical Majorana fermions, and we numerically find that the fault-tolerance threshold is about $0.8%$.

arXiv:1709.06245•Physical Review A•Jul 31, 2018•21 citations

Gauge Color Codes

Héctor Bombín

In fault-tolerant quantum computation [1], quantum information is protected from noise by encoding it in somewhat non-local degrees of freedom, thus distributing it among many smaller subsystems, typically qubits. This makes sense under the physically relevant assumption that interactions with the environment have a local nature. The implementation of gates, consequently, must be also as local as possible to preserve the structure of noise. This is naturally achieved with transversal gates, i.e. unitary operators that transform encoded states by acting separately on suitable subsystems, in the simplest case independently on each qubit. Unfortunately, no code admits a universal transversal set of gates [2]. Topological quantum error correcting codes [3] introduce a richer notion of locality by considering the spatial location of the physical qubits, which are assumed to be arranged on a lattice. They come in families parametrized with a lattice size, for a fixed spatial dimension. Their defining features are (i) that the measurements needed to recover information about errors only involve a few neighbouring qubits and (ii) that no encoded information can be recovered without access to a number of physical qubits comparable to the system size. Rather than sticking to the above definition of transversality, for topological codes it is natural to consider instead quantum circuits of fixed depth with geometrically local gates [4, 5]. Remarkably, it has been recently shown that spatial dimension imposes constraints on the transversal gates that are allowed [5]. In particular, this is true in the case of topological stabilizer codes, where it has been found that transversal gates on D-dimensional codes have to belong to certain sets PD. A first main result of this work [6] is that codes that saturate these bounds can be constructed for every D, in the sense that they admit at least a transversal gate in PD (not belonging to PD−1). In particular, the result applies to color codes [7, 8, 9, 10], where the single-qubit gate RD := ( 1 0 0 e2πi/2 D ) is transversal (in the more strict non-topological sense).

•Nov 4, 2013•3 citations
Building fault-tolerant quantum computers is a current priority for the quantum computing industry and academic counterparts. We present a quantum error correction code encoding a single logical qubit into n=L2n=L^2n=L2 physical qubits with distance d=Ld = Ld=L as a subsystem code, and n−O(n)n-O(\sqrt{n})n−O(n​) logical qubits with distance d=3d=3d=3 as a standard stabiliser code. The logical single-qubit gates in the subsystem code are transversal. Under independent X,ZX,ZX,Z noise we find a threshold of 1.1%±0.3%1.1\% \pm 0.3\%1.1%±0.3% for odd distance and 0.6%±0.1%0.6\% \pm 0.1\%0.6%±0.1% for even distance for the subsystem variant. The code detects every 1- and 2-qubit error, and additionally every error of weight 3 and higher (constrained by the distance) that is not a product of the 3-qubit check operations. These operations act on the gauge qubits leaving the subsystem code space invariant. The code can be implemented by qubits in a triangular configuration with the plaquettes as 3-qubit check operations.
Abstract A potential platform for topological quantum computation is the Majorana-based tetron architecture. Its building blocks are superconducting islands called tetrons, which host four Majorana zero modes. Existing error correcting codes can correct even-weight errors on tetrons. In a previous proposal by us, we had shown that incorporating tetrons in the stabilizer group allows us to correct a combination of odd-weight errors and even-weight errors on tetrons. In this work, we show that inclusion of tetrons in the gauge group lets us create subsystem codes from conventional Pauli stabilizer codes, which can correct both kinds of errors. Compared to the previous approach, the current approach lets us construct codes with fewer stabilizer generators. This leads to shorter fault-tolerant sequence length, and improves the fault-tolerant pseudothreshold by as much as 84%.
Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.
Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical qudits in finite-dimensional spin systems. We construct distance-333, distance-555 codewords, and general 2t+12t+12t+1-distance codes that can be implemented using a single physical qudit or a small number of coupled qudits for higher distances, while requiring a Hilbert space dimension significantly smaller than conventional constructions based on multiple logical qubits. Logical operations and error correction protocols can be implemented with polynomial scaling in the number of elementary operations. We further discuss schematic designs for physical implementation and required single-gate fidelities, which are compatible with current spin qudit platforms. This strategy provides a resource-efficient path toward realizing fault-tolerant logical qudits in finite multi-level physical systems.
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.
An important approach to fault-tolerant quantum computation is protecting logical information using quantum error correction. Usually, logical information is in the form of logical qubits, which are encoded in physical qubits using quantum error correction codes. Compared with qubit quantum computation, fermionic quantum computation has advantages in quantum simulations of fermionic systems, e.g., molecules. In this paper, we show that fermionic quantum computation can be universal and fault tolerant if we encode logical Majorana fermions in physical Majorana fermions. We take a color code as an example to demonstrate the universal set of fault-tolerant operations on logical Majorana fermions, and we numerically find that the fault-tolerance threshold is about 0.80.8%0.8.
In fault-tolerant quantum computation [1], quantum information is protected from noise by encoding it in somewhat non-local degrees of freedom, thus distributing it among many smaller subsystems, typically qubits. This makes sense under the physically relevant assumption that interactions with the environment have a local nature. The implementation of gates, consequently, must be also as local as possible to preserve the structure of noise. This is naturally achieved with transversal gates, i.e. unitary operators that transform encoded states by acting separately on suitable subsystems, in the simplest case independently on each qubit. Unfortunately, no code admits a universal transversal set of gates [2]. Topological quantum error correcting codes [3] introduce a richer notion of locality by considering the spatial location of the physical qubits, which are assumed to be arranged on a lattice. They come in families parametrized with a lattice size, for a fixed spatial dimension. Their defining features are (i) that the measurements needed to recover information about errors only involve a few neighbouring qubits and (ii) that no encoded information can be recovered without access to a number of physical qubits comparable to the system size. Rather than sticking to the above definition of transversality, for topological codes it is natural to consider instead quantum circuits of fixed depth with geometrically local gates [4, 5]. Remarkably, it has been recently shown that spatial dimension imposes constraints on the transversal gates that are allowed [5]. In particular, this is true in the case of topological stabilizer codes, where it has been found that transversal gates on D-dimensional codes have to belong to certain sets PD. A first main result of this work [6] is that codes that saturate these bounds can be constructed for every D, in the sense that they admit at least a transversal gate in PD (not belonging to PD−1). In particular, the result applies to color codes [7, 8, 9, 10], where the single-qubit gate RD := ( 1 0 0 e2πi/2 D ) is transversal (in the more strict non-topological sense).