-
Quantum LDPC codes with Ω(√(n)log^kn) distance, for any k
In this work we construct quantum LDPC codes of distance √(n)log^k n for...
08/21/2020 ∙ by Tali Kaufman, et al. ∙
0
∙
share
read it
-
Decodable quantum LDPC codes beyond the √(n) distance barrier using high dimensional expanders
Constructing quantum LDPC codes with a minimum distance that grows faste...
04/16/2020 ∙ by Shai Evra, et al. ∙
0
∙
share
read it
-
List Decoding with Double Samplers
We develop the notion of "double samplers", first introduced by Dinur an...
08/01/2018 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
Good Distance Lattices from High Dimensional Expanders
We show a new framework for constructing good distance lattices from hig...
03/07/2018 ∙ by Tali Kaufman, et al. ∙
0
∙
share
read it
