Related papers: General tensor network decoding of 2D Pauli codes
We compute the error threshold for the semion code, the companion of the Kitaev toric code with the same gauge symmetry group $\mathbb{Z}_2$. The application of statistical mechanical mapping methods is highly discouraged for the semion…
Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer…
We introduce a novel type of quantum error correcting code, called the spinor code, based on spaces defined by total spin. The code is a nonstabilizer code, and is also a nonlinear quantum error correcting code, meaning that quantum…
In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the…
We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network that can be successfully applied to both classical and quantum systems on and off criticality. The key innovation in our scheme is to…
A striking feature of quantum error correcting codes is that they can sometimes be used to correct more errors than they can uniquely identify. Such degenerate codes have long been known, but have remained poorly understood. We provide a…
Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential…
With the advent of noisy intermediate-scale quantum (NISQ) devices, practical quantum computing has seemingly come into reach. However, to go beyond proof-of-principle calculations, the current processing architectures will need to scale up…
We derive two families of EA-QC quantum LDPC (EA-QC-QLDPC) codes by tiling permutation matrices of prime and composite orders. The unassisted portion of the Tanner graphs corresponding to these codes, constructed from two distinct classical…
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be…
We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically codes that are uniquely decodable from $\frac{1-\varepsilon}{2}$ fraction of errors and list decodable from $1-\varepsilon$ fraction of…
This paper presents a comprehensive guide to designing minimal trellises for both non-degenerate and degenerate decoding of quantum stabilizer codes. For non-degenerate decoding, various strategies are explored, leveraging insights from…
We study the performance of distance-three surface code layouts under realistic multi-parameter noise models. We first calculate their thresholds under depolarizing noise. We then compare a Pauli-twirl approximation of amplitude and phase…
The two-dimensional color code is an alternative to the toric code that encodes more logical qubits while maintaining crucial features of the $\mathbb{Z}_2\times\mathbb{Z}_2$ toric code in the long wavelength limit. However its short range…
The problem of low complexity, close to optimal, channel decoding of linear codes with short to moderate block length is considered. It is shown that deep learning methods can be used to improve a standard belief propagation decoder,…
Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…
We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted $Z$-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on…
Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where…
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…
We introduce a convolutional neural network for inferring a compact disentangled graphical description of objects from 2D images that can be used for volumetric reconstruction. The network comprises an encoder and a twin-tailed decoder. The…