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

Majorana qubit codes that also correct odd-weight errors

Sourav Kundu, Ben W. Reichardt

Published Nov 3, 2023• 1 citation
arXivHTMLPDF

Abstract

The tetron architecture is a promising candidate for topological quantum computation. Each tetron Majorana island has four Majorana zero modes, and possible measurements are constrained to span zero or two Majoranas per tetron. Such measurements are known to be sufficient for correcting so-called "bosonic errors," which affect an even number of Majoranas per tetron. We demonstrate that such measurements are also sufficient for correcting "fermionic errors," which affect an odd number of Majoranas per tetron. In contrast, previous proposals for "fermionic error correction" on tetrons introduce more experimental challenges. We show that "fermionic codes" can be derived from traditional "bosonic codes" by inclusion of tetrons in the stabilizer group.

DOI
10.48550/arxiv.2311.01779

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%.

New Journal of Physics•May 3, 2024•2 citations

Physical implementation of a Majorana fermion surface code for fault-tolerant quantum computation

Sagar Vijay, Liang Fu

We propose a physical realization of a commuting Hamiltonian of interacting Majorana fermions realizing Z 2 topological order, using an array of Josephson-coupled topological superconductor islands. The required multi-body interaction Hamiltonian is naturally generated by a combination of charging energy induced quantum phase-slips on the superconducting islands and electron tunneling between islands. Our setup improves on a recent proposal for implementing a Majorana fermion surface code (Vijay et al 2015 Phys. Rev. X 5 041038 ), a 'hybrid' approach to fault-tolerant quantum computation that combines (1) the engineering of a stabilizer Hamiltonian with a topologically ordered ground state with (2) projective stabilizer measurements to implement error correction and a universal set of logical gates. Our hybrid strategy has advantages over the traditional surface code architecture in error suppression and single-step stabilizer measurements, and is widely applicable to implementing stabilizer codes for quantum computation.

arXiv:1509.08134•Physica Scripta•Jan 25, 2016•36 citations

Quantum Error Correction for Complex and Majorana Fermion Qubits

Sagar Vijay, Liang Fu

We introduce error-correcting codes that can correct for fermion parity-violating (quasiparticle poisoning) and parity-conserving errors in systems of complex fermions and of Majorana fermions. After establishing properties of fermion codes, we introduce a generic construction of fermion codes from weakly self-dual classical, binary error-correcting codes. We use this method to construct (i) the shortest fermion code to correct for quasiparticle poisoning errors, (ii) translationally-invariant fermion codes and (iii) other codes that correct higher-weight errors. We conclude by discussing a possible physical realizations of one such code in mesoscopic superconductors hosting Majorana zero modes.

arXiv:1703.00459•Mar 1, 2017•18 citations

Majorana-Pauli stabilizer codes and duality webs of fermionic topological phases

Meng Sun, Zongyuan Wang, Nathanan Tantivasadakarn +1 more

Stabilizer codes provide exact lattice realizations of bosonic topological orders. In contrast, systematic stabilizer descriptions of intrinsically fermionic topological phases remain much less developed. In this work, we introduce Majorana-Pauli stabilizer codes, a class of exactly solvable fermionic lattice models whose stabilizers are built from both generalized Pauli operators and Majorana operators. As a main example, we construct an exactly solvable stabilizer realization of the fermionic toric code: an intrinsically fermionic $\mathbb Z_2$ topological order in $(2{+}1)$ dimensions, using $\mathbb Z_8$ Pauli operators coupled to Majorana modes. Within this stabilizer framework, the anyons, string operators, fusion rules, and braiding statistics all follow naturally from the stabilizer algebra. More broadly, we show that the fermionic toric code belongs to a duality web generated by anyon condensation and by gauging or ungauging bosonic or fermionic symmetries. This web connects bosonic topological orders, symmetry-enriched topological (SET) phases, and both bosonic and fermionic symmetry-protected topological (SPT) phases, all within a common stabilizer description. We extend this construction to all Abelian fermionic topological orders with gapped boundaries and to fermionic SPT phases whose fully gauged theories are Abelian. Going beyond Majorana operators, we introduce fermionic versions of the clock and shift operators and use them to construct an exact bosonization map for $\mathbb Z_D^F$ symmetries for $D$ even. Using this, we realize a stabilizer model for a nontrivial $\mathbb Z_8^F$ fermionic SPT phase with no free-fermion analog. Altogether, these results extend the stabilizer-code paradigm to a broad class of intrinsically fermionic phases bridging fermionic quantum many-body physics to quantum error correction.

quant-pharXiv:2606.25048•Jun 25, 2026•0 citations

Quantum computing with Majorana fermion codes

Daniel Litinski, Felix von Oppen

Majorana-based qubits are candidates for qubits with long coherence times. Just like conventional qubits, these qubits require active error correction in order to run arbitrarily long quantum computations. Unlike conventional quits though, Majorana-based qubits can use not only qubit-based codes, but also Majorana fermion codes for error correction. Several proposals for Majorana-based quantum computing with and without error correction exist, each featuring individual strategies to implement a universal set of gates. This paper unites all these approaches in a general framework, in which a certain set of operations---Clifford gates---are implemented with zero time overhead.

arXiv:1801.08143•Physical review. B./Physical review. B•May 2, 2018•73 citations

Fermionic quantum error correction is never free

Yifan Tang, Ingo Roth, Philippe Faist +3 more

Fermionic platforms offer compelling architectures for quantum computing, ranging from topologically protected Majorana-based qubits to fermionic cold atoms. To achieve scalability, however, they require quantum error correction. In this work, we prove that any exact and sufficiently accurate approximate fermionic quantum error correction necessarily requires non-Gaussian operations, beyond the free-fermion regime of quadratic dynamics. This is in sharp contrast to the qubit setting, where the efficiently classically simulable stabilizer operations form the standard framework for quantum error correction. Specifically, we show that the logical space of any non-trivial fermionic error-correcting code contains no pure fermionic Gaussian state, utilizing a fundamental incompatibility between fermionic error correction and Wick's theorem. We further show that the required number of bounded-weight non-Gaussian gates for unitary codeword preparation grows at least linearly with both the code distance and the number of encoded modes, revealing an intrinsic resource overhead that increases simultaneously with error-protection strength and logical capacity. Furthermore, we analyze the performance of fermionic Gaussian operations in entanglement distillation, revealing a distinction from their bosonic counterparts. Our results reveal fundamental difficulties for fermionic error correction from the perspectives of both physical implementation and classical simulation, suggesting connections to fermionic phases of matter and state preparation complexity.

quant-pharXiv:2609.15059•Sep 15, 2026•0 citations
The tetron architecture is a promising candidate for topological quantum computation. Each tetron Majorana island has four Majorana zero modes, and possible measurements are constrained to span zero or two Majoranas per tetron. Such measurements are known to be sufficient for correcting so-called "bosonic errors," which affect an even number of Majoranas per tetron. We demonstrate that such measurements are also sufficient for correcting "fermionic errors," which affect an odd number of Majoranas per tetron. In contrast, previous proposals for "fermionic error correction" on tetrons introduce more experimental challenges. We show that "fermionic codes" can be derived from traditional "bosonic codes" by inclusion of tetrons in the stabilizer group.
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%.
We propose a physical realization of a commuting Hamiltonian of interacting Majorana fermions realizing Z 2 topological order, using an array of Josephson-coupled topological superconductor islands. The required multi-body interaction Hamiltonian is naturally generated by a combination of charging energy induced quantum phase-slips on the superconducting islands and electron tunneling between islands. Our setup improves on a recent proposal for implementing a Majorana fermion surface code (Vijay et al 2015 Phys. Rev. X 5 041038 ), a 'hybrid' approach to fault-tolerant quantum computation that combines (1) the engineering of a stabilizer Hamiltonian with a topologically ordered ground state with (2) projective stabilizer measurements to implement error correction and a universal set of logical gates. Our hybrid strategy has advantages over the traditional surface code architecture in error suppression and single-step stabilizer measurements, and is widely applicable to implementing stabilizer codes for quantum computation.
We introduce error-correcting codes that can correct for fermion parity-violating (quasiparticle poisoning) and parity-conserving errors in systems of complex fermions and of Majorana fermions. After establishing properties of fermion codes, we introduce a generic construction of fermion codes from weakly self-dual classical, binary error-correcting codes. We use this method to construct (i) the shortest fermion code to correct for quasiparticle poisoning errors, (ii) translationally-invariant fermion codes and (iii) other codes that correct higher-weight errors. We conclude by discussing a possible physical realizations of one such code in mesoscopic superconductors hosting Majorana zero modes.
Stabilizer codes provide exact lattice realizations of bosonic topological orders. In contrast, systematic stabilizer descriptions of intrinsically fermionic topological phases remain much less developed. In this work, we introduce Majorana-Pauli stabilizer codes, a class of exactly solvable fermionic lattice models whose stabilizers are built from both generalized Pauli operators and Majorana operators. As a main example, we construct an exactly solvable stabilizer realization of the fermionic toric code: an intrinsically fermionic Z2\mathbb Z_2Z2​ topological order in (2+1)(2{+}1)(2+1) dimensions, using Z8\mathbb Z_8Z8​ Pauli operators coupled to Majorana modes. Within this stabilizer framework, the anyons, string operators, fusion rules, and braiding statistics all follow naturally from the stabilizer algebra. More broadly, we show that the fermionic toric code belongs to a duality web generated by anyon condensation and by gauging or ungauging bosonic or fermionic symmetries. This web connects bosonic topological orders, symmetry-enriched topological (SET) phases, and both bosonic and fermionic symmetry-protected topological (SPT) phases, all within a common stabilizer description. We extend this construction to all Abelian fermionic topological orders with gapped boundaries and to fermionic SPT phases whose fully gauged theories are Abelian. Going beyond Majorana operators, we introduce fermionic versions of the clock and shift operators and use them to construct an exact bosonization map for ZDF\mathbb Z_D^FZDF​ symmetries for DDD even. Using this, we realize a stabilizer model for a nontrivial Z8F\mathbb Z_8^FZ8F​ fermionic SPT phase with no free-fermion analog. Altogether, these results extend the stabilizer-code paradigm to a broad class of intrinsically fermionic phases bridging fermionic quantum many-body physics to quantum error correction.
Majorana-based qubits are candidates for qubits with long coherence times. Just like conventional qubits, these qubits require active error correction in order to run arbitrarily long quantum computations. Unlike conventional quits though, Majorana-based qubits can use not only qubit-based codes, but also Majorana fermion codes for error correction. Several proposals for Majorana-based quantum computing with and without error correction exist, each featuring individual strategies to implement a universal set of gates. This paper unites all these approaches in a general framework, in which a certain set of operations---Clifford gates---are implemented with zero time overhead.
Fermionic platforms offer compelling architectures for quantum computing, ranging from topologically protected Majorana-based qubits to fermionic cold atoms. To achieve scalability, however, they require quantum error correction. In this work, we prove that any exact and sufficiently accurate approximate fermionic quantum error correction necessarily requires non-Gaussian operations, beyond the free-fermion regime of quadratic dynamics. This is in sharp contrast to the qubit setting, where the efficiently classically simulable stabilizer operations form the standard framework for quantum error correction. Specifically, we show that the logical space of any non-trivial fermionic error-correcting code contains no pure fermionic Gaussian state, utilizing a fundamental incompatibility between fermionic error correction and Wick's theorem. We further show that the required number of bounded-weight non-Gaussian gates for unitary codeword preparation grows at least linearly with both the code distance and the number of encoded modes, revealing an intrinsic resource overhead that increases simultaneously with error-protection strength and logical capacity. Furthermore, we analyze the performance of fermionic Gaussian operations in entanglement distillation, revealing a distinction from their bosonic counterparts. Our results reveal fundamental difficulties for fermionic error correction from the perspectives of both physical implementation and classical simulation, suggesting connections to fermionic phases of matter and state preparation complexity.