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

04/16/2020
by   Shai Evra, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2020

Quantum LDPC Codes with Almost Linear Minimum Distance

We give a construction of quantum LDPC codes of dimension Θ(log N) and d...
research
09/08/2020

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(...
research
07/30/2019

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...
research
11/08/2019

Towards local testability for quantum coding

We introduce the hemicubic codes, a family of quantum codes obtained by ...
research
02/28/2022

Quantum Tanner codes

Tanner codes are long error correcting codes obtained from short codes a...
research
07/06/2023

Improved rate-distance trade-offs for quantum codes with restricted connectivity

For quantum error-correcting codes to be realizable, it is important tha...

Please sign up or login with your details

Forgot password? Click here to reset