DeepAI AI Chat
Log In Sign Up

Quantum LDPC codes with Ω(√(n)log^kn) distance, for any k

by   Tali Kaufman, et al.

In this work we construct quantum LDPC codes of distance √(n)log^k n for any k, improving a recent result of Evra et. al. <cit.>. The work of <cit.> took advantage of the high dimensional expansion notion known as cosystolic expansion, that occurs in Ramanujan complexes. Our improvement is achieved by considering tensor product of Ramanujan complexes. The main conceptual contribution of our work is the following: a tensor product of a cosystolic expander with a complex with a linear cosystole has a linear cosystole.


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

Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances

In many quantum channels, dephasing errors occur more frequently than th...

Dynamic Complexity of Expansion

Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see al...

Memory and Capacity of Graph Embedding Methods

This paper analyzes the graph embedding method introduced in <cit.>, whi...

A generalization of the construction of quantum codes from Hermitian self-orthogonal codes

An important strength of the q-ary stabilizer quantum codes is that they...

Tamper Detection against Unitary Operators

We consider (Enc, Dec) schemes which are used to encode a classical/quan...

Two-sided Robustly Testable Codes

We show that the tensor product of two random linear codes is robustly t...