Towards local testability for quantum coding

by   Anthony Leverrier, et al.

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the p-faces of the n-cube (for n>p) and stabilizer constraints with faces of dimension (p±1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into N = 2^n-p-1np physical qubits and displays local testability with a soundness of Ω(log^-2 (N)) beating the current state-of-the-art of log^-3 (N) due to Hastings. We exploit this local testability to devise an efficient decoding algorithm that corrects arbitrary errors of size less than the minimum distance, up to polylog factors. We then extend this code family by considering the quotient of the n-cube by arbitrary linear classical codes of length n. We establish the parameters of these generalized hemicubic codes. Interestingly, if the soundness of the hemicubic code could be shown to be 1/log(N), similarly to the ordinary n-cube, then the generalized hemicubic codes could yield quantum locally testable codes of length not exceeding an exponential or even polynomial function of the code dimension.


page 1

page 2

page 3

page 4


Quantum LDPC Codes with Almost Linear Minimum Distance

We give a construction of quantum LDPC codes of dimension Θ(log N) and d...

Fiber Bundle Codes: Breaking the N^1/2polylog(N) Barrier for Quantum LDPC Codes

We present a quantum LDPC code family that has distance Ω(N^3/5/polylog(...

On the Cleaning Lemma of Quantum Coding Theory

The term "Cleaning Lemma" refers to a family of similar propositions tha...

Decodable quantum LDPC codes beyond the √(n) distance barrier using high dimensional expanders

Constructing quantum LDPC codes with a minimum distance that grows faste...

Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds

We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain...

Quantifying nonlocality: how outperforming local quantum codes is expensive

Quantum low-density parity-check (LDPC) codes are a promising avenue to ...

Efficiently decoding the 3D toric codes and welded codes on cubic lattices

The recent years have seen a growing interest in quantum codes in three ...