Fetching the paper…
Reading the bibliography…
We show that the tensor product of two random linear codes is robustly testable with high probability.
Homology with local coefficients
N. E. Steenrod · 1943
Earlier work this paper cites.
Dihomology: I. relations between homology theories
E. C. Zeeman · 1962
Earlier work this paper cites.
Low-density parity-check codes
Robert G. Gallager · 1963
Earlier work this paper cites.
On codes derivable from the tensor product of check matrices
J. Wolf · 1965
Earlier work this paper cites.
Dual product codes for correction of multiple low-density burst errors
R. Chien and S. Ng · 1973
Earlier work this paper cites.
Cohomology of Groups
Kenneth S. Brown · 1982
Earlier work this paper cites.
The riemann-hilbert problem for holonomic systems
Masaki Kashiwara · 1984
Earlier work this paper cites.
A cellular description of the derived category of a stratified space
A.D. Shepard · 1985
Earlier work this paper cites.
Nearly-linear size holographic proofs
Alexander Polishchuk and Daniel A. Spielman · 1994
Earlier work this paper cites.
Good quantum error-correcting codes exist
A. R. Calderbank and Peter W. Shor · 1996
Earlier work this paper cites.
Error correcting codes in quantum theory
A. M. Steane · 1996
Earlier work this paper cites.
Sparse-graph codes for quantum error correction
D. J. C. MacKay, G. Mitchison, and P. L. McFadden · 2004
Earlier work this paper cites.
The tensor product of two codes is not necessarily robustly testable
Paul Valiant · 2005
Earlier work this paper cites.
Robust locally testable codes and products of codes
Eli Ben-Sasson and Madhu Sudan · 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.
Locally testable codes and pcps of almost-linear length
Oded Goldreich and Madhu Sudan · 2006
Cited alongside, same era.
Homological connectivity of random 2-complexes
Nathan Linial and Roy Meshulam · 2006
Cited alongside, same era.
Coding for errors and erasures in random network coding
Ralf Koetter and Frank R. Kschischang · 2008
Cited alongside, same era.
Quantum LDPC codes with positive rate and minimum distance proportional to n 1 / 2 n^{1/2}
J. Tillich and G. Zémor · 2009
Cited alongside, same era.
Singularities, expanders and topology of maps. part 2: from combinatorics to topology via algebraic isoperimetry
Mikhail Gromov · 2010
Cited alongside, same era.
The tensor product of two good codes is not necessarily robustly testable
Oded Goldreich and Or Meir · 2012
Quantum low-density parity-check codes
Nikolas P. Breuckmann and Jens Niklas Eberhardt · 2021
Later among the works it cites.
Building manifolds from quantum codes
Michael Freedman and Matthew Hastings · 2021
Later among the works it cites.
Fiber bundle codes: breaking the N 1 / 2 polylog ( N ) N^{1/2}\operatorname{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.
Locally testable codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes · 2022
Closest in time.
Explicit lower bounds against Ω ( n ) \Omega(n) -rounds of sum-of-squares
Max Hopkins and Ting-Chun Lin · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On the rectangle method in proofs of robustness of tensor products
Or Meir · 2012
Cited alongside, same era.
Sheaves, cosheaves and applications
Justin Michael Curry · 2014
Cited alongside, same era.
Elementary applied topology
Robert W. Ghrist · 2014
Cited alongside, same era.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Cited alongside, same era.
High dimensional expanders imply agreement expanders
Irit Dinur and Tali Kaufman · 2017
Cited alongside, same era.
Toward a spectral theory of cellular sheaves
Jakob Hansen and Robert Ghrist · 2019
Cited alongside, same era.
Closest in time.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Closest in time.
Asymptotically good quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Closest in time.
NLTS hamiltonians from good quantum codes
Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe · 2023
Closest in time.
Good quantum ldpc codes with linear time decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2023
Closest in time.
On Good 2-Query Locally Testable Codes from Sheaves on High Dimensional Expanders, May 2023
Uriya A. First and Tali Kaufman · 2023
Closest in time.
An efficient decoder for a linear distance quantum ldpc code
Shouzhen Gu, Christopher A. Pattison, and Eugene Tang · 2023
Closest in time.
High-dimensional expansion of product codes is stronger than robust and agreement testability, August 2023
Gleb Kalachev · 2023
Closest in time.
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Anthony Leverrier and Gilles Zémor · 2023
Closest in time.