Building manifolds from quantum codes
read the original abstract
We give a procedure for "reverse engineering" a closed, simply connected, Riemannian manifold with bounded local geometry from a sparse chain complex over $\mathbb{Z}$. Applying this procedure to chain complexes obtained by "lifting" recently developed quantum codes, which correspond to chain complexes over $\mathbb{Z}_2$, we construct the first examples of power law $\mathbb{Z}_2$ 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Translation-invariant quantum low-density parity-check codes from compactified fracton models
Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.