Fetching the paper…
Reading the bibliography…
We give a general procedure for weight reducing quantum codes.
Z 2 Z_{2} -systolic freedom and quantum codes
Michael H. Freedman, David A. Meyer, and Feng Luo · 2002
Earlier work this paper cites.
Strong colorings of hypergraphs
Geir Agnarsson and Magnús M Halldórsson · 2004
Earlier work this paper cites.
A constructive proof of the general lovász local lemma
Robin A Moser and Gábor Tardos · 2010
Earlier work this paper cites.
Homological product codes
Sergey Bravyi and Matthew B Hastings · 2014
Earlier work this paper cites.
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2014
Cited alongside, same era.
Weight reduction for quantum codes
Mathew B Hastings · 2017
Cited alongside, same era.
Balanced product quantum codes
N. Breuckman and J. Eberhardt · 2020
Cited alongside, same era.
Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high dimensional expanders
Shai Evra, Tali Kaufman, and Gilles Zémor · 2020
Cited alongside, same era.
Building manifolds from quantum codes
M. H. Freedman and M. B. Hastings
Cited in the paper.
https://ncatlab.org/nlab/show/quasi-isomorphism
Cited in the paper.
https://mathoverflow.net/questions/38853/bounds-on-strong-vertex-colourings-of-regular-hypergraphs
Cited in the paper.
Decodable quantum ldpc codes beyond the n \sqrt{n} distance barrier using high dimensional expanders
Shai Evra, Tali Kaufman, and Gilles Zémor · 2020
Later among the works it cites.
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell · 2020
Later among the works it cites.
Quantum LDPC codes with Ω ( n log k n ) \Omega(\sqrt{n}\log^{k}n) distance, for any k k
Tali Kaufman and Ran J. Tessler · 2020
Later among the works it cites.
Quantum ldpc codes with almost linear distance
Pavel Panteleev and Gleb Kalachev · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…