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

12/22/2017
by   Vivien Londe, et al.
0

We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like n^0.2 where n is the number of physical qubits. Similarly as in [arXiv:1310.5555], our homological code family stems from tessellated hyperbolic 4-manifolds. The main novelty of this work is that we consider a regular tessellation consisting of hypercubes. We exploit this strong local structure to design and analyze an efficient decoding algorithm.

READ FULL TEXT
research
07/27/2021

On decoding hyperbolic codes

Few decoding algorithms for hyperbolic codes are known in the literature...
research
04/17/2018

Hyperbolic quantum color codes

Current work presents a new approach to quantum color codes on compact s...
research
08/25/2019

Holographic Code Rate

Holographic codes grown with perfect tensors on regular hyperbolic tesse...
research
11/08/2019

Towards local testability for quantum coding

We introduce the hemicubic codes, a family of quantum codes obtained by ...
research
09/26/2019

Quantum Bicyclic Hyperbolic Codes

Bicyclic codes are a generalization of the one dimensional (1D) cyclic c...
research
10/06/2022

NLTS Hamiltonians from classical LTCs

We provide a completely self-contained construction of a family of NLTS ...
research
05/24/2021

On the pathwidth of hyperbolic 3-manifolds

According to Mostow's celebrated rigidity theorem, the geometry of close...

Please sign up or login with your details

Forgot password? Click here to reset