Related papers: Unfolding the color code
An algorithm which encodes the $L\times L$ 2D toric code logical state with a circuit of depth $2L+1$, using only local controlled-NOT($CX$) and Hadamard($H$) gates, is presented.
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' nonabelian…
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…
We prove the existence of a finitely dependent proper colouring of the integer lattice Z^d that is fully isometry-invariant in law, for all dimensions d. Previously this was known only for d=1, while only translation-invariant examples were…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…
We provide a simplified, yet rigorous presentation of the ideas from Bomb\'{i}n's paper "Gauge Color Codes" [arXiv:1311.0879v3]. Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide…
We consider the $\mathbb{Z}_2$ toric code, surface code and Floquet code defined on a non-orientable surface, which can be considered as families of codes extending Shor's 9-qubit code. We investigate the fault-tolerant logical gates of the…
In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were…
We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-\epsilon}$ for any…
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several…
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this…
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which…
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
Topological stabilizer codes, such as the toric and surface codes, are leading candidates for fault-tolerant quantum computation. While their decodability under stochastic noise has been extensively studied, the effects of coherent errors,…
Local decoders provide a promising approach to real-time quantum error-correction by replacing centralized classical decoding, with significant hardware constraints, by a fully distributed architecture based on a simple, local update rule.…
Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed…