Fetching the paper…
Reading the bibliography…
In this work we introduce a new notion of expansion in higher dimensions that is stronger than the well studied cosystolic expansion notion, and is termed {\em Collective-cosystolic expansion}.
Fleming, Wendell H. Flat chains over a finite coefficient group, Transactions of the American mathematical society 121.1 (1966): 160-186
1966
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica
1988
Earlier work this paper cites.
M. Mihail and U. Vazirani. On the expansion of 0/1 polytopes. in Journal of Combinatorial Theory. B
1989
Earlier work this paper cites.
Good quantum error-correcting codes exist
A Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
Multiple-particle interference and quantum error correction
Andrew Steane · 1996
Earlier work this paper cites.
A. Hatcher. Algebraic Topology. Cambridge University Press, 2000
2000
Earlier work this paper cites.
M. H. Freedman, D. A. Meyer, and F. Luo. Z 2 Z_{2} -systolic freedom and quantum codes, Mathematics of quantum computation, Chapman & Hall/CRC, 287-320 (2002)
2002
Earlier work this paper cites.
Alexey Yu. Kitaev. Fault-tolerant quantum computation by anyons, Ann. Physics
2003
Earlier work this paper cites.
A. Lubotzky, B. Samuels, and U. Vishne. Ramanujan complexes of type A ~ d \widetilde{A}_{d} , Israel Journal of Mathematics
2005
Earlier work this paper cites.
A. Lubotzky, B. Samuels, and U. Vishne. Explicit construction of Ramanujan complexes of type A ~ d \widetilde{A}_{d} , European Journal of Combinatorics
2005
Earlier work this paper cites.
A. Lubotzky and R. Meshulam Homological connectivity of random 2-complexes, Combinatorica
2006
Cited alongside, same era.
A. Lubotzky and R. Meshulam. A Moore bound for simplicial complexes, Bulletin of the London Mathematical Society
2007
Cited alongside, same era.
Abramenko, Peter, and Kenneth S. Brown. Buildings: theory and applications. Vol. 248. Springer Science & Business Media, 2008
2008
Cited alongside, same era.
M. Gromov. Singularities, Expanders and Topology of Maps. Part 2: from Combinatorics to Topology Via Algebraic Isoperimetry, Geometric and Functional Analysis
2010
Cited alongside, same era.
J. Fox, M. Gromov, V. Lafforgue, A. Naor, J. Pach. Overlap properties of geometric expanders, in Journal fr die reine und angewandte Mathematik
2012
Cited alongside, same era.
Shai Evra, and Tali Kaufman. Bounded degree cosystolic expanders of every dimension, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. 2016
2016
Later among the works it cites.
Tali Kaufman, David Kazhdan, and Alexander Lubotzky. Isoperimetric inequalities for Ramanujan complexes and topological expanders. Geometric and Functional Analysis 26.1 (2016): 250-287
2016
Later among the works it cites.
A. Lubotzky, R. Meshulam, S. Mozes, Expansion of building-like complexes, Groups, Geometry, and Dynamics
2016
Later among the works it cites.
M. A. Hastings. Weight reduction for quantum codes. Quantum Information & Computation
2017
Later among the works it cites.
Benjamin Audoux, and Alain Couvreur. On tensor products of CSS codes, Annales de l’Institut Henri Poincaré (D)
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A Course in Geometric Measure Theory by Brian White, Lecture Notes by Otis Chodosh. http://web.stanford.edu/ ochodosh/GMTnotes.pdf Stanford University, Spring 2012
2012
Cited alongside, same era.
L. Guth, and A. Lubotzky. Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds, J. of Mathematical physics
2013
Cited alongside, same era.
S. Bravyi, and M. A. Hastings. Homological product codes, Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14. New York, NY, USA, May 31– June 04, 2014, ACM, 2014, pp. 273–282
2014
Cited alongside, same era.
M. H. Freedman and M. B. Hastings. Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs. Quantum Inf. Comput., 14(1-2):144–180, (2014)
2014
Cited alongside, same era.
J-P. Tillich, and G. Zémor. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inf. Theory
2014
Cited alongside, same era.
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2019
Later among the works it cites.
Shai Evra, Tali Kaufman ,and Gilles Zémor. Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high dimensional expanders, arXiv 2004.07935 (2020)
2020
Closest in time.
2020
Closest in time.
Tali Kaufman, Izhar Oppenheim: High Order Random Walks: Beyond Spectral Gap. in Combinatorica
2020
Closest in time.