Related papers: Quantum Computing with Majorana Fermion Codes
We present a theoretical analysis of a Majorana-based qubit consisting of two topological superconducting islands connected via a Josephson junction. The qubit is operated by electrostatic gates which control the coupling of two of the four…
Modular architectures offer a scalable path toward fault-tolerant quantum computing by interconnecting smaller quantum processing units (QPUs) provided that high-rate, fault-tolerant interfaces can be realized across modules. We present a…
We study and generalize the class of qubit topological stabilizer codes that arise in the Abelian phase of the honeycomb lattice model. The resulting family of codes, which we call `matching codes' realize the same anyon model as the…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
Topological quantum computations can be implemented with local Majorana zero modes. To simplify manipulations, one can use Majorana edge states in gapped two-dimensional systems. Here we demonstrate how this approach can be used for a…
Braiding of anyons such as Majoranas or parafermions provides only Clifford gates which do not form a universal set of quantum gates. We propose a robust and resource-efficient scheme to perform a non-Clifford gate on a logical qudit…
As the building blocks of topological quantum computation, Majorana zero modes (MZMs) have attracted tremendous attention in recent years. Scalable mesoscopic island designs with MZMs show great potential in quantum information processing.…
Non-abelian anyons are highly desired for topological quantum computation purposes, with Majorana fermions providing a promising route, particularly zero modes with non-trivial mutual statistics. Yet realizing Majorana zero modes in matter…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
We describe in detail how to perform universal fault-tolerant quantum computation on a 2-D color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple defect…
We relax one of the requirements for topological quantum computation with Majorana fermions. Topological quantum computation was discussed so far as manipulation of the wave function within degenerate many body ground state. The simplest…
We propose to use the recently predicted two-dimensional `weak-pairing' $p_x + ip_y$ superfluid state of fermionic cold atoms as a platform for topological quantum computation. In the core of a vortex, this state supports a zero-energy…
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system. These extra degrees of freedom enable the detection and correction of errors, but also increase the operational complexity of the…
A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical…
We propose a realization of the one-dimensional Kitaev topological superconductor in classical mechanical metamaterials. By designing appropriate braiding protocols, we demonstrate that the system's mid-gap vibrational modes, termed…
Recent advances in quantum dot platforms have opened new pathways for realizing Majorana zero modes (MZMs) and simulating topological quantum computation. Here we propose an experimentally feasible setup for implementing topological…
Gottesman-Kitaev-Preskill (GKP) codes are a promising candidate for implementing fault tolerant quantum computation in quantum harmonic oscillator systems such as superconducting resonators, optical photons and trapped ions, and in recent…
Photonics provides a viable path to a scalable fault-tolerant quantum computer. The natural framework for this platform is measurement-based quantum computation, where fault-tolerant graph states supersede traditional quantum…
Hypergraph product codes are a class of quantum low density parity check (LDPC) codes discovered by Tillich and Z\'emor. These codes have a constant encoding rate and were recently shown to have a constant fault-tolerant error threshold.…
Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable…