Fetching the paper…
Reading the bibliography…
We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes.
J. Wolf, “On codes derivable from the tensor product of check matrices,” IEEE Transactions on Information Theory , vol. 11, no. 2, pp. 281–284, Apr. 1965
1965
Earlier work this paper cites.
R. Chien and S. Ng, “Dual product codes for correction of multiple low-density burst errors,” IEEE Transactions on Information Theory , vol. 19, no. 5, pp. 672–677, Sep. 1973
1973
Earlier work this paper cites.
R. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
G. A. Margulis, “Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators,” Problemy peredachi informatsii , vol. 24, no. 1, pp. 51–60, 1988
1988
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs,” Combinatorica , vol. 8, no. 3, pp. 261–277, Sep. 1988. [Online]. Available: https://doi.org/10.1007/BF02126799
1988
Earlier work this paper cites.
R. Motwani and P. Raghavan, Randomized Algorithms . Cambridge University Press, Aug. 1995
1995
Earlier work this paper cites.
M. Sipser and D. Spielman, “Expander codes,” IEEE Transactions on Information Theory , vol. 42, no. 6, pp. 1710–1722, Nov. 1996
1996
Earlier work this paper cites.
G. Zémor, “On expander codes,” IEEE Transactions on Information Theory , vol. 47, no. 2, pp. 835–837, 2001
2001
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Transactions on Information Theory , vol. 50, no. 10, pp. 2315–2330, Oct. 2004
2004
Earlier work this paper cites.
N. Linial and R. Meshulam, “Homological connectivity of random 2-complexes,” Combinatorica , vol. 26, no. 4, pp. 475–487, Aug. 2006. [Online]. Available: https://doi.org/10.1007/s00493-006-0027-9
2006
Earlier work this paper cites.
E. Ben-Sasson and M. Sudan, “Robust locally testable codes and products of codes,” Random Structures & Algorithms , vol. 28, no. 4, pp. 387–402, 2006. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20120
2006
Earlier work this paper cites.
M. Hagiwara and H. Imai, “Quantum quasi-cyclic LDPC codes,” in 2007 IEEE international symposium on information theory , Jun. 2007, pp. 806–810
2007
Earlier work this paper cites.
M. Chen, C. Huang, and J. Li, “On the Maximally Recoverable Property for Multi-Protection Group Codes,” in 2007 IEEE International Symposium on Information Theory , Jun. 2007, pp. 486–490
2007
Earlier work this paper cites.
D. Spielman, “Spectral graph theory, fall 2009,” Course Notes, Applied Mathematics 561/Computer Science 662, Yale University, 2009. [Online]. Available: https://www.cs.yale.edu/homes/spielman/561/2009/lect12-09.pdf
2009
Earlier work this paper cites.
M. Gromov, “Singularities, expanders and topology of maps. part 2: from combinatorics to topology via algebraic isoperimetry,” Geometric and Functional Analysis , vol. 20, no. 2, pp. 416–526, Aug. 2010. [Online]. Available: https://doi.org/10.1007/s00039-010-0073-8
2010
Earlier work this paper cites.
O. Goldreich, “Short locally testable codes and proofs: A survey in two parts,” in Property Testing: Current Research and Surveys , ser. Lecture Notes in Computer Science, O. Goldreich, Ed. Berlin, Heidelberg: Springer, 2010, pp. 65–104
2010
Earlier work this paper cites.
J. Haah, “Local stabilizer codes in three dimensions without string logical operators,” Physical Review A , vol. 83, no. 4, p. 042330, Apr. 2011
2011
Cited alongside, same era.
D. Dotterrer and M. Kahle, “Coboundary expanders,” Journal of Topology and Analysis , vol. 04, no. 04, pp. 499–514, Dec. 2012
2012
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Quantum kronecker sum-product low-density parity-check codes with finite rate,” Physical Review A , vol. 88, no. 1, p. 012311, Jul. 2013
2013
Cited alongside, same era.
T. Kaufman and A. Lubotzky, “High dimensional expanders and property testing,” in Proceedings of the 5th conference on Innovations in theoretical computer science , ser. ITCS ’14. New York, NY, USA: Association for Computing Machinery, Jan. 2014, pp. 501–506
2014
Cited alongside, same era.
2022
Later among the works it cites.
A. Leverrier and G. Zémor, “Quantum Tanner codes,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) . Los Alamitos, CA, USA: IEEE Computer Society, Nov. 2022, pp. 872–883. [Online]. Available: https://doi.ieeecomputersociety.org/10.1109/FOCS54457.2022.00117
2022
Later among the works it cites.
A. Leverrier, V. Londe, and G. Zémor, “Towards local testability for quantum coding,” Quantum , vol. 6, p. 661, Feb. 2022
2022
Later among the works it cites.
T.-C. Lin and M.-H. Hsieh, “c3-locally testable codes from lossless expanders,” in 2022 IEEE International Symposium on Information Theory (ISIT) , 2022, pp. 1175–1180
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Kaufman, D. Kazhdan, and A. Lubotzky, “Ramanujan complexes and bounded degree topological expanders,” in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science , Oct. 2014, pp. 484–493
2014
Cited alongside, same era.
J. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory , vol. 60, no. 2, pp. 1193–1202, Feb. 2014
2014
Cited alongside, same era.
P. Gopalan, C. Huang, B. Jenkins, and S. Yekhanin, “Explicit Maximally Recoverable Codes With Locality,” IEEE Transactions on Information Theory , vol. 60, no. 9, pp. 5245–5256, Sep. 2014
2014
Cited alongside, same era.
D. Aharonov and L. Eldar, “Quantum locally testable codes,” SIAM Journal on Computing , vol. 44, no. 5, pp. 1230–1262, Jan. 2015
2015
Cited alongside, same era.
L. Eldar and A. W. Harrow, “Local Hamiltonians Whose Ground States Are Hard to Approximate,” in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) . Berkeley, CA, USA: IEEE, Oct. 2017, pp. 427–438
2017
Cited alongside, same era.
P. Harsha, “Lifting small locally testable codes (LTCs) to large LTCs via HDXs, Institute for Advanced Study,” Video , Nov. 2019
2019
Cited alongside, same era.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders,” in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , Nov. 2020, pp. 218–227
2020
Cited alongside, same era.
M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: breaking the N 1 / 2 polylog ( N ) N^{1/2}\operatorname{polylog}(N) barrier for quantum LDPC codes,” in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . New York, NY, USA: Association for Computing Machinery, Jun. 2021, pp. 1276–1288
2021
Cited alongside, same era.
I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, “Good quantum LDPC codes with linear time decoders,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , ser. STOC 2023. New York, NY, USA: Association for Computing Machinery, 2023, p. 905–918. [Online]. Available: https://doi.org/10.1145/3564246.3585101
2023
Later among the works it cites.
S. Gu, C. A. Pattison, and E. Tang, “An efficient decoder for a linear distance quantum LDPC code,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , ser. STOC 2023. New York, NY, USA: Association for Computing Machinery, 2023, p. 919–932. [Online]. Available: https://doi.org/10.1145/3564246.3585169
2023
Later among the works it cites.
A. Leverrier and G. Zémor, “Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes,” in Proceedings of the 2023 Annual ACM–SIAM Symposium on Discrete Algorithms (SODA) , N. Bansal and V. Nagarajan, Eds. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics (SIAM), 2023, pp. 1216–1244. [Online]. Available: https://epubs.siam.org/doi/abs/10.1137/1.9781611977554.ch45
2023
Later among the works it cites.
2023
Later among the works it cites.
S. Gu, E. Tang, L. Caha, S. H. Choe, Z. He, and A. Kubica, “Single-Shot Decoding of Good Quantum LDPC Codes,” Communications in Mathematical Physics , vol. 405, no. 3, p. 85, Mar. 2024
2024
Later among the works it cites.
A. Cross, Z. He, A. Natarajan, M. Szegedy, and G. Zhu, “Quantum Locally Testable Code with Constant Soundness,” Quantum , vol. 8, p. 1501, Oct. 2024
2024
Later among the works it cites.
I. Dinur, T.-C. Lin, and T. Vidick, “Expansion of High-Dimensional Cubical Complexes: With Application to Quantum Locally Testable Codes,” in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , Oct. 2024, pp. 379–385
2024
Later among the works it cites.
P. Panteleev and G. Kalachev, “Maximally Extendable Sheaf Codes,” Mar. 2024, unpublished. [Online]. Available: https://doi.org/10.48550/arXiv.2403.03651
2024
Later among the works it cites.
P. Harsha, “CS369E: Expanders in Computer Science,” https://www.tcs.tifr.res.in/~prahladh/teaching/05spring/ , 2005, accessed: Oct. 19, 2025
2025
Closest in time.
L. Golowich and V. Guruswami, “Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products,” in 40th Computational Complexity Conference (CCC 2025) , ser. Leibniz International Proceedings in Informatics (LIPIcs), S. Srinivasan, Ed., vol. 339. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, pp. 25:1–25:11
2025
Closest in time.
Q. T. Nguyen and C. A. Pattison, “Quantum Fault Tolerance with Constant-Space and Logarithmic-Time Overheads,” in Proceedings of the 57th Annual ACM Symposium on Theory of Computing , ser. STOC ’25. New York, NY, USA: Association for Computing Machinery, Jun. 2025, pp. 730–737
2025
Closest in time.