There are no good infinite families of toric codes
Jason P. Bell, Sean Monahan, Matthew Satriano, Karen Situ, Zheng Xie

TL;DR
This paper proves that good infinite families of toric codes do not exist by establishing a Szemerédi-type result about the unavoidable presence of large hypercubes in dense subsets of high-dimensional grids.
Contribution
It introduces a general Szemerédi-type theorem that implies the non-existence of good infinite families of toric codes.
Findings
Good infinite families of toric codes do not exist.
Dense subsets in high-dimensional grids contain arbitrarily large hypercubes.
The result generalizes Szemerédi's theorem to hypercubes in multidimensional settings.
Abstract
Soprunov and Soprunova introduced the notion of a good infinite family of toric codes. We prove that such good families do not exist by proving a more general Szemer\'edi-type result: for all and all positive integers , subsets of density at least in contain hypercubes of arbitrarily large dimension as grows.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Quantum-Dot Cellular Automata · Quantum Computing Algorithms and Architecture
