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

by   Shai Evra, et al.

Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in particular Ramanujan complexes. These naturally give rise to very unbalanced quantum error correcting codes that have a large X-distance but a much smaller Z-distance. However, together with a classical expander LDPC code and a tensoring method that generalises a construction of Hastings and also the Tillich-Zemor construction of quantum codes, we obtain quantum LDPC codes whose minimum distance exceeds the square root of the code length and whose dimension comes close to a square root of the code length. When the ingredient is a 3-dimensional Ramanujan complex, we show that its 2-systole behaves like a square of the log of the complex size, which results in an overall quantum code of minimum distance n^1/2log n, and sets a new record for quantum LDPC codes. When we use a 2-dimensional Ramanujan complex, or the 2-skeleton of a 3-dimensional Ramanujan complex, we obtain a quantum LDPC code of minimum distance n^1/2log^1/2n. We then exploit the expansion properties of the complex to devise the first polynomial time algorithm that decodes above the square root barrier for quantum LDPC codes.



There are no comments yet.


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...

High dimensional affine codes whose square has a designed minimum distance

Given a linear code C, its square code C^(2) is the span of all componen...

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(...

Towards local testability for quantum coding

We introduce the hemicubic codes, a family of quantum codes obtained by ...

Good Distance Lattices from High Dimensional Expanders

We show a new framework for constructing good distance lattices from hig...

Sequences of linear codes where the rate times distance grows rapidly

For a linear code C of length n with dimension k and minimum distance d,...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.