Fetching the paper…
Reading the bibliography…
We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders.
A recursive approach to low complexity codes
R Tanner · 1981
Earlier work this paper cites.
Ramanujan graphs
A Philips, R Lubotsky, and P Sarnak · 1988
Earlier work this paper cites.
Explicit construction of linear sized tolerant networks
Noga Alon and Fan RK Chung · 1988
Earlier work this paper cites.
Expander codes
Michael Sipser and Daniel A Spielman · 1996
Earlier work this paper cites.
Linear-time encodable and decodable error-correcting codes
Daniel A Spielman · 1996
Earlier work this paper cites.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Algebraic Topology
Allen Hatcher · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
Robust locally testable codes and products of codes
Eli Ben-Sasson and Madhu Sudan · 2004
Earlier work this paper cites.
Homological connectivity of random 2-complexes
Nathan Linial* and Roy Meshulam* · 2006
Earlier work this paper cites.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Earlier work this paper cites.
Robust local testability of tensor products of ldpc codes
Irit Dinur, Madhu Sudan, and Avi Wigderson · 2006
Earlier work this paper cites.
Short locally testable codes and proofs: A survey in two parts
Oded Goldreich · 2010
Earlier work this paper cites.
Fast decoders for topological quantum codes
Guillaume Duclos-Cianci and David Poulin · 2010
Earlier work this paper cites.
Singularities, expanders and topology of maps. part 2: From combinatorics to topology via algebraic isoperimetry
Mikhail Gromov · 2010
Earlier work this paper cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
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 · 2013
Cited alongside, same era.
Guest column: the quantum pcp conjecture
Dorit Aharonov, Itai Arad, and Thomas Vidick · 2013
Cited alongside, same era.
Ramanujan complexes and bounded degree topological expanders
Tali Kaufman, David Kazhdan, and Alexander Lubotzky · 2014
Cited alongside, same era.
Ramanujan complexes and high dimensional expanders
Alexander Lubotzky · 2014
Cited alongside, same era.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Cited alongside, same era.
Quantum locally testable codes
Dorit Aharonov and Lior Eldar · 2015
Cited alongside, same era.
Explicit sos lower bounds from high-dimensional expanders
Irit Dinur, Yuval Filmus, Prahladh Harsha, and Madhur Tulsiani · 2020
Later among the works it cites.
Locally testable codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2021
Later among the works it cites.
Fiber bundle codes: breaking the n 1/2 polylog (n) barrier for quantum ldpc codes
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Later among the works it cites.
Quantum ldpc codes with almost linear minimum distance
Pavel Panteleev and Gleb Kalachev · 2021
Later among the works it cites.
Balanced product quantum codes
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bounded degree cosystolic expanders of every dimension
Shai Evra and Tali Kaufman · 2016
Cited alongside, same era.
High dimensional expanders imply agreement expanders
Irit Dinur and Tali Kaufman · 2017
Cited alongside, same era.
Boolean function analysis on high-dimensional expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha · 2018
Cited alongside, same era.
Degenerate quantum ldpc codes with good finite length performance, 2019
Pavel Panteleev and Gleb Kalachev · 2019
Cited alongside, same era.
Log-concave polynomials ii: high-dimensional walks and an fpras for counting bases of a matroid
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant · 2019
Cited alongside, same era.
Agreement testing theorems on layered set systems
Yotam Dikstein and Irit Dinur · 2019
Cited alongside, same era.
Pavel Panteleev and Gleb Kalachev · 2021
Later among the works it cites.
Quantum low-density parity-check codes
Nikolas P Breuckmann and Jens Niklas Eberhardt · 2021
Later among the works it cites.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H Nickerson · 2021
Later among the works it cites.
Near-linear time decoding of ta-shma’s codes via splittable regularity
Fernando Granha Jeronimo, Shashank Srivastava, and Madhur Tulsiani · 2021
Later among the works it cites.
Hypercontractivity on high dimensional expanders
Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett · 2021
Later among the works it cites.
Hypercontractivity on high dimensional expanders
Tom Gur, Noam Lifshitz, and Siqi Liu · 2021
Later among the works it cites.
Anthony Leverrier and Gilles Zémor · 2022
Closest in time.
Towards local testability for quantum coding
Anthony Leverrier, Vivien Londe, and Gilles Zémor · 2022
Closest in time.
c 3 c^{3} -local testable codes from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Closest in time.
Good quantum ldpc codes with linear time decoder from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Closest in time.
Explicit lower bounds against ω ( n ) \omega(n) -rounds of sum-of-squares
Max Hopkins and Ting-Chun Lin · 2022
Closest in time.