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:1708.05012 · Physical review. B./Physical review. B

Braiding by Majorana tracking and long-range CNOT gates with color codes

Daniel Litinski, Felix von Oppen

Published Nov 8, 2017• 46 citations
arXivHTMLPDF

Abstract

Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional color codes, they enable the use of the Majoranas' non-Abelian statistics for gate operations at the code level. Here, we discuss the implementation of color codes in arrays of Majorana nanowires that avoid branched networks such as T junctions, thereby simplifying their realization. We show that, in such implementations, non-Abelian statistics can be exploited without ever performing physical braiding operations. Physical braiding operations are replaced by Majorana tracking, an entirely software-based protocol which appropriately updates the Majoranas involved in the color-code stabilizer measurements. This approach minimizes the required hardware operations for single-qubit Clifford gates. For Clifford completeness, we combine color codes with surface codes, and use color-to-surface-code lattice surgery for long-range multitarget CNOT gates which have a time overhead that grows only logarithmically with the physical distance separating control and target qubits. With the addition of magic state distillation, our architecture describes a fault-tolerant universal quantum computer in systems such as networks of tetrons, hexons, or Majorana box qubits, but can also be applied to nontopological qubit platforms.

DOI
10.1103/physrevb.96.205413

Related papers

Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes

Daniel Litinski, Felix von Oppen

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.

arXiv:1709.02318•Quantum•May 4, 2018•88 citations

Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes

Daniel Litinski, Felix von Oppen

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.

•Jan 1, 2018•74 citations

Topological Quantum Computing with Majorana Zero Modes and Beyond

Christina Knapp

Topological quantum computing seeks to store and manipulate information in a protected manner using topological phases of matter. Information encoded in the degenerate state space of pairs of non-Abelian anyons or defects is robust to local perturbations, reducing its susceptiblity to environmental errors and potentially providing a scalable approach to quantum computing. However, topological quantum computing faces significant challenges, not least of which is identifying an experimentally accessible platform supporting non-Abelian topological physics. In this thesis, we critically analyze topological quantum computing with Majorana zero modes, non-Abelian defects of a topological superconductor. We identify intrinsic error sources for Majorana-based systems and propose quantum computing architectures that minimize their effects. Additionally, we consider a new approach for realizing and detecting non-Abelian topological defects in fractional Chern insulators. Topological quantum computing is predicated on the idea that braiding non-Abelian anyons adiabatically can implement quantum gates fault tolerantly. However, any braiding experiment will necessarily depart from the strict adiabatic limit. We begin by analyzing the nature of diabatic errors for anyon braiding, paying particular attention to how such errors scale with braiding time. We find that diabatic errors are unfavorably large and worryingly sensitive to details of the time evolution. We present a measurement-based correction protocol for such errors, and illustrate its application in a particular Majorana-based qubit design. We next propose designs for Majorana-based qubits operated entirely by a measurement-based protocol, thereby avoiding the diabatic errors discussed above. Our designs can be scaled into large two dimensional arrays amenable to long-term quantum computing goals, whose core components are testable in near-term devices. These qubits are robust to quasiparticle poisoning, anticipated to be one of the dominant error sources coupling to Majorana zero modes. We demonstrate that our designs support topologically protected Clifford operations and can be augmented to a universal gate set without requiring additional control parameters.While topological protection greatly suppresses errors, residual coupling to noise limits the lifetimes of our proposed Majorana-based qubits. We analyze the dephasing times for our quasiparticle-poisoning-protected qubits by calculating their charge distribution using a particle number-conserving formalism. We find that fluctuations in the electromagnetic environment couple to an exponentially suppressed topological dipole moment. We estimate dephasing times due to $1/f$ noise, thermal quasiparticle excitations, and phonons for different qubit sizes.The residual errors discussed above will necessarily require error correction for a sufficiently long quantum computation. We develop physically motivated noise models for Majorana-based qubits that can be used to analyze the performance of a quantum error correcting code. We apply this noise model to estimate pseudo-thresholds for a small subsystem code, identifying the relative importance of difference error processes from a fault tolerance perspective. Our results emphasize the necessity of suppressing long-lived quasiparticle excitations that can spread across the code.Finally, we turn our attention to a different platform that could host non-Abelian topological defects: fractional Chern insulators in graphene. We study the edge states of fractional Chern insulators using the field theory of fractional quantum Hall edges supplemented with a symmetry action. We find that lattice symmetries impose a quantized momentum difference for edge electrons in a fractional state of a $C=2$ Chern band. This momentum difference can be used to selectively contact the different edge states, thereby allowing detection of topological defects in the bulk with a standard four terminal measurement. Our proposal could be implemented in graphene subject to an artificially patterned lattice.

•Jan 1, 2019•2 citations

Quantum computing by color-code lattice surgery

Andrew J. Landahl, Ciarán Ryan-Anderson

We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code lattice surgery can. Against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface-code lattice surgery when the noise rate is low enough and the error suppression demand is high enough.

arXiv:1407.5103•Jul 18, 2014•34 citations

Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout

Tomas Jochym-O’Connor, Stephen D. Bartlett

We introduce a class of three-dimensional color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows for the transversal implementation of a non-Clifford $\ensuremath{\pi}/8$ logical gate, which when combined with the logical Clifford gates that are transversal in the 2D color code give a gate set that is both fault-tolerant and universal without requiring nonstabilizer magic states. We then show that the layers forming the stacked code can be unfolded and arranged in a 2D layout. As only Clifford gates can be implemented transversally for 2D topological stabilizer codes, a nonlocal operation must be incorporated in order to allow for this transversal application of a non-Clifford gate. Our code achieves this operation through the transformation from a 2D color code to the unfolded stacked code induced by measuring only geometrically local stabilizers and gauge operators within the bulk of 2D color codes together with a nonlocal operator that has support on a one-dimensional boundary between such 2D codes. We believe that this proposed method to implement the nonlocal operation is a realistic one for 2D stabilizer layouts and would be beneficial in avoiding the large overheads caused by magic state distillation.

arXiv:1509.04255•Physical Review A•Feb 17, 2016•47 citations

Magic Quantum Code Surgery

Kathleen Chang, Anasuya Lyons, Yuanjie Ren +5 more

Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.

quant-pharXiv:2610.03920•Oct 6, 2026•0 citations
Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional color codes, they enable the use of the Majoranas' non-Abelian statistics for gate operations at the code level. Here, we discuss the implementation of color codes in arrays of Majorana nanowires that avoid branched networks such as T junctions, thereby simplifying their realization. We show that, in such implementations, non-Abelian statistics can be exploited without ever performing physical braiding operations. Physical braiding operations are replaced by Majorana tracking, an entirely software-based protocol which appropriately updates the Majoranas involved in the color-code stabilizer measurements. This approach minimizes the required hardware operations for single-qubit Clifford gates. For Clifford completeness, we combine color codes with surface codes, and use color-to-surface-code lattice surgery for long-range multitarget CNOT gates which have a time overhead that grows only logarithmically with the physical distance separating control and target qubits. With the addition of magic state distillation, our architecture describes a fault-tolerant universal quantum computer in systems such as networks of tetrons, hexons, or Majorana box qubits, but can also be applied to nontopological qubit platforms.
We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.
We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.
Topological quantum computing seeks to store and manipulate information in a protected manner using topological phases of matter. Information encoded in the degenerate state space of pairs of non-Abelian anyons or defects is robust to local perturbations, reducing its susceptiblity to environmental errors and potentially providing a scalable approach to quantum computing. However, topological quantum computing faces significant challenges, not least of which is identifying an experimentally accessible platform supporting non-Abelian topological physics. In this thesis, we critically analyze topological quantum computing with Majorana zero modes, non-Abelian defects of a topological superconductor. We identify intrinsic error sources for Majorana-based systems and propose quantum computing architectures that minimize their effects. Additionally, we consider a new approach for realizing and detecting non-Abelian topological defects in fractional Chern insulators. Topological quantum computing is predicated on the idea that braiding non-Abelian anyons adiabatically can implement quantum gates fault tolerantly. However, any braiding experiment will necessarily depart from the strict adiabatic limit. We begin by analyzing the nature of diabatic errors for anyon braiding, paying particular attention to how such errors scale with braiding time. We find that diabatic errors are unfavorably large and worryingly sensitive to details of the time evolution. We present a measurement-based correction protocol for such errors, and illustrate its application in a particular Majorana-based qubit design. We next propose designs for Majorana-based qubits operated entirely by a measurement-based protocol, thereby avoiding the diabatic errors discussed above. Our designs can be scaled into large two dimensional arrays amenable to long-term quantum computing goals, whose core components are testable in near-term devices. These qubits are robust to quasiparticle poisoning, anticipated to be one of the dominant error sources coupling to Majorana zero modes. We demonstrate that our designs support topologically protected Clifford operations and can be augmented to a universal gate set without requiring additional control parameters.While topological protection greatly suppresses errors, residual coupling to noise limits the lifetimes of our proposed Majorana-based qubits. We analyze the dephasing times for our quasiparticle-poisoning-protected qubits by calculating their charge distribution using a particle number-conserving formalism. We find that fluctuations in the electromagnetic environment couple to an exponentially suppressed topological dipole moment. We estimate dephasing times due to 1/f1/f1/f noise, thermal quasiparticle excitations, and phonons for different qubit sizes.The residual errors discussed above will necessarily require error correction for a sufficiently long quantum computation. We develop physically motivated noise models for Majorana-based qubits that can be used to analyze the performance of a quantum error correcting code. We apply this noise model to estimate pseudo-thresholds for a small subsystem code, identifying the relative importance of difference error processes from a fault tolerance perspective. Our results emphasize the necessity of suppressing long-lived quasiparticle excitations that can spread across the code.Finally, we turn our attention to a different platform that could host non-Abelian topological defects: fractional Chern insulators in graphene. We study the edge states of fractional Chern insulators using the field theory of fractional quantum Hall edges supplemented with a symmetry action. We find that lattice symmetries impose a quantized momentum difference for edge electrons in a fractional state of a C=2C=2C=2 Chern band. This momentum difference can be used to selectively contact the different edge states, thereby allowing detection of topological defects in the bulk with a standard four terminal measurement. Our proposal could be implemented in graphene subject to an artificially patterned lattice.
We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code lattice surgery can. Against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface-code lattice surgery when the noise rate is low enough and the error suppression demand is high enough.
We introduce a class of three-dimensional color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows for the transversal implementation of a non-Clifford $\ensuremath{\pi}/8$ logical gate, which when combined with the logical Clifford gates that are transversal in the 2D color code give a gate set that is both fault-tolerant and universal without requiring nonstabilizer magic states. We then show that the layers forming the stacked code can be unfolded and arranged in a 2D layout. As only Clifford gates can be implemented transversally for 2D topological stabilizer codes, a nonlocal operation must be incorporated in order to allow for this transversal application of a non-Clifford gate. Our code achieves this operation through the transformation from a 2D color code to the unfolded stacked code induced by measuring only geometrically local stabilizers and gauge operators within the bulk of 2D color codes together with a nonlocal operator that has support on a one-dimensional boundary between such 2D codes. We believe that this proposed method to implement the nonlocal operation is a realistic one for 2D stabilizer layouts and would be beneficial in avoiding the large overheads caused by magic state distillation.
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.