Building manifolds from quantum codes
Abstract
We give a procedure for "reverse engineering" a closed, simply connected, Riemannian manifold with bounded local geometry from a sparse chain complex over . Applying this procedure to chain complexes obtained by "lifting" recently developed quantum codes, which correspond to chain complexes over , we construct the first examples of power law systolic freedom. As a result that may be of independent interest in graph theory, we give an efficient randomized algorithm to construct a weakly fundamental cycle basis for a graph, such that each edge appears only polylogarithmically times in the basis. We use this result to trivialize the fundamental group of the manifold we construct.
Keywords
Cite
@article{arxiv.2012.02249,
title = {Building manifolds from quantum codes},
author = {Michael Freedman and Matthew B. Hastings},
journal= {arXiv preprint arXiv:2012.02249},
year = {2021}
}
Comments
32 pages, 7 figures; v2 minor clarifications, improved result using improved codes as input; v3 minor clarifications and corrections