Building manifolds from quantum codes

@article{Freedman2021BuildingMF,
  title={Building manifolds from quantum codes},
  author={Michael H. Freedman and Matthew B. Hastings},
  journal={Geometric and Functional Analysis},
  year={2021}
}
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… 
On Quantum Weight Reduction
TLDR
By applying this technique to a quantum code whose X-st stabilizers are derived from a classical log-weight random code and whose Z-stabilizers have linear weight, this work constructs an LDPC quantum code with distance Ω̃(N) and Ω⩽(N), and gives a general procedure for weight reducing quantum codes.
Two-sided Robustly Testable Codes
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product
Systolic almost-rigidity modulo 2
. No power law systolic freedom is possible for the product of mod 2 systoles of dimension 1 and codimension 1. This means that any closed n dimensional Riemannian manifold M of bounded local
Quantum Codes, CFTs, and Defects
We give a general construction relating Narain rational conformal field theories (RCFTs) and associated 3d Chern-Simons (CS) theories to quantum stabilizer codes. Starting from an abelian CS theory
Quantum Low-Density Parity-Check Codes
TLDR
This Perspective discusses a particular class of quantum codes called “quantum low-density parity-check (LDPC) codes,” which are alternatives to the surface code and have potential for making quantum computers robust with regard to noise.
Degenerate Quantum LDPC Codes With Good Finite Length Performance
TLDR
It is shown that with the help of OSD-like post-processing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude.

References

SHOWING 1-10 OF 27 REFERENCES
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
TLDR
An alternative, algebraic, construction of the known classes of surface codes that have fixed rate and growing minimum distance is given, borrowed from Margulis's family of Cayley graphs with large girths, and highlights the analogy between quantum surface codes and cycle codes of graphs in the classical case.
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
TLDR
Using 4-dimensional arithmetic hyperbolic manifolds, some new homological quantum error correcting codes with linear rate and distance are constructed, answering the question whether homological codes with such parameters could exist at all.
Weight reduction for quantum codes
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights $O(1)$ and such that $O(1)$ generators
Surgery on compact manifolds
Preliminaries: Note on conventions Basic homotopy notions Surgery below the middle dimension Appendix: Applications Simple Poincare complexes The main theorem: Statement of results An important
A Course in Minimal Surfaces
Minimal surfaces date back to Euler and Lagrange and the beginning of the calculus of variations. Many of the techniques developed have played key roles in geometry and partial differential
Groups of Homotopy Spheres, I
DEFINITION. Two closed n-manifolds M, and M2 are h-cobordant1 if the disjoint sum M, + (- M2) is the boundary of some manifold W, where both M1 and (-M2) are deformation retracts of W. It is clear
Integral geometry and geometric probability
Part I. Integral Geometry in the Plane: 1. Convex sets in the plane 2. Sets of points and Poisson processes in the plane 3. Sets of lines in the plane 4. Pairs of points and pairs of lines 5. Sets of
Metric Structures for Riemannian and Non-Riemannian Spaces
Length Structures: Path Metric Spaces.- Degree and Dilatation.- Metric Structures on Families of Metric Spaces.- Convergence and Concentration of Metrics and Measures.- Loewner Rediscovered.-
Balanced Product Quantum Codes
TLDR
This work provides the first explicit and non-random family of LDPC quantum codes which encode logical qubits with distance and conjecture to have linear distance.
Quantum LDPC Codes With Almost Linear Minimum Distance
TLDR
A new operation called lifted product is introduced, which naturally generalizes the product operations for quantum codes and chain complexes, and as a simple byproduct of the results on quantum codes is a new result on classical codes.
...
...