Related papers: Decoding toric codes on three dimensional simplica…
The robustness of the topological color code, which is a class of error correcting quantum codes, is investigated under the influence of an uniform magnetic field on the honeycomb lattice. Our study relies on two high-order series…
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a…
Subsystem quantum error-correcting codes typically involve measuring a sequence of non-commuting parity check operators. They can sometimes exhibit greater fault-tolerance than conventional subspace codes, which use commuting checks.…
Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed…
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 subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of this single-shot property remain elusive, in part due to…
Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice $\Lambda_{\textrm{c}}$ and shaping lattice $\Lambda_{\textrm{s}}$ satisfy $\Lambda_{\textrm{s}}…
Ongoing research and experiments have enabled quantum memory to realize the storage of qubits. On the other hand, interleaving techniques are used to deal with burst of errors. Effective interleaving techniques for combating burst of errors…
We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We…
Topological subsystem color codes (TSCCs) are an important class of topological subsystem codes that allow for syndrome measurement with only 2-body measurements. It is expected that such low complexity measurements can help in fault…
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by…
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…
It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…
We study topological order in a toric code in three spatial dimensions, or a 3+1D Z_2 gauge theory, at finite temperature. We compute exactly the topological entropy of the system, and show that it drops, for any infinitesimal temperature,…
While quantum low-density parity check (qLDPC) codes are a low-overhead means of quantum information storage, it is valuable for quantum codes to possess fault-tolerant features beyond this resource efficiency. In this work, we introduce…
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit…
In this note, a class of error-correcting codes is associated to a toric variety associated to a fan defined over a finite field $\fff_q$, analogous to the class of Goppa codes associated to a curve. For such a ``toric code'' satisfying…
Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by…
We propose a novel construction of the Floquet 3D toric code and Floquet $X$-cube code through the coupling of spin chains. This approach not only recovers the coupling layer construction on foliated lattices in three dimensions but also…