Related papers: A no-go theorem for a two-dimensional self-correct…
We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and G\'acs. Our decoder is a circuit of strictly local quantum operations preserving a logical state for…
We present a family of quantum stabilizer codes using the structure of duadic constacyclic codes over $\mathbb{F}_4$. Within this family, quantum codes can possess varying dimensions, and their minimum distances are lower bounded by a…
The hypergraph product creates a quantum stabilizer code from two input classical linear codes; a paradigmatic example being the surface code as a hypergraph product of two classical repetition codes. Many properties of the hypergraph…
We analyze the effect of typical, unknown perturbations on the 2D toric code when acting as a quantum memory, incorporating the effects of error correction on read-out. By transforming the system into a 1D transverse Ising model undergoing…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for…
To build a fault-tolerant quantum computer, it is necessary to implement a quantum error correcting code. Such codes rely on the ability to extract information about the quantum error syndrome while not destroying the quantum information…
We present a new type of a quantum error correction code, termed Majorana-XYZ code, where the logical quantum information scales macroscopically yet is protected by topologically non-trivial degrees of freedom. It is a $[n,k,g,d]$ subsystem…
Stabilizer codes are a powerful method for implementing fault-tolerant quantum memory and in the case of topological codes, they form useful models for topological phases of matter. In this paper, we discuss the theory of stabilizer codes…
This thesis addresses whether it is possible to build a robust memory device for quantum information. A three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite…
Dynamical stabilizer codes (DSCs) have recently emerged as a powerful generalization of static stabilizer codes for quantum error correction, replacing a fixed stabilizer group with a sequence of non-commuting measurements. This dynamical…
We show how to explicitly construct an $O(nd)$ size and constant quantum depth circuit which encodes any given $n$-qubit stabilizer code with $d$ generators. Our construction is derived using the graphic description for stabilizer codes and…
We consider the problem of a generic stabilizer Hamiltonian under local, incoherent Pauli errors. Using two different approaches -- (i) Haah's polynomial formalism arXiv:1204.1063 and (ii) the homological perspective on CSS codes -- we…
We study the four-dimensional Z_2 random-plaquette lattice gauge theory as a model of topological quantum memory, the toric code in particular. In this model, the procedure of quantum error correction works properly in the ordered (Higgs)…
We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…
In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross (Ref. [23]) the number of $[[n,k]]_d$ stabilizer codes was computed for…
Quantum simulations before fault tolerance suffer from the intrinsic noise present in quantum computers. In this regime, extracting meaningful results greatly benefits from stability against that noise. This stability, defined as an error…
The postulate of gauge invariance in nature does not lend itself directly to implementations of lattice gauge theories in modern setups of quantum synthetic matter. Unavoidable gauge-breaking errors in such devices require gauge invariance…
The Bacon-Shor code is a quantum error correcting subsystem code composed of weight 2 check operators that admits a single logical qubit, and has distance $d$ on a $d \times d$ square lattice. We show that when viewed as a Floquet code, by…
Self-correcting quantum memories demonstrate robust properties that can be exploited to improve active quantum error-correction protocols. Here we propose a cellular automaton decoder for a variation of the color code where the bases of the…
We provide a detailed study of the general structure of two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. Under the sole assumption of translational invariance, we show that all such codes can…