Quantum codes from high-dimensional manifolds

DOI10.4230/LIPICS.ITCS.2017.25MaRDI QIDQ4638075zbMATH OpenOpenAlexFDO

Authors M. B. Hastings

Publication date 3 May 2018

Full work available at URL https://arxiv.org/abs/1608.05089

zbMATH Keywords

quantum codesrandom latticesRankin invariants

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Quantum computation (81P68) Quantum coding (general) (81P70) Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-epsilon}$ for any $epsilon>0$. The conjecture is that there is a constant $C>0$ such that for any $n$-dimensional torus ${mathbbT}^n={mathbbR}^n/Lambda$, where $Lambda$ is a lattice, the least volume unoriented $n/2$-dimensional surface (using the Euclidean metric) representing nontrivial homology has volume at least $C^n$ times the volume of the least volume $n/2$-dimensional hyperplane representing nontrivial homology; in fact, it would suffice to have this result for $Lambda$ an integral lattice with the surface restricted to faces of a cubulation by unit hypercubes. The main technical result is an estimate of Rankin invariantscite{rankin} for certain random lattices, showing that in a certain sense they are optimal. Additionally, we construct codes with square-root distance, logarithmic weight stabilizers, and inverse polylogarithmic soundness factor (considered as quantum locally testable codescite{qltc}). We also provide an short, alternative proof that the shortest vector in the exterior power of a lattice may be non-splitcite{coulangeon}.

Recommendations

• Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
• scientific article; zbMATH DE number 1796840
• scientific article; zbMATH DE number 5556270
• Building manifolds from quantum codes
• Bounding the distance of quantum surface codes

Cites work

• Asymptotic formulae for point lattices of bounded determinant and subspaces of bounded height
• Calibrated geometries
• Fault-tolerant quantum computation by anyons
• Good error-correcting codes based on very sparse matrices
• Homological error correction: Classical and quantum codes
• Homological product codes
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 3456979 (Why is no real title available?)
• scientific article; zbMATH DE number 1796840 (Why is no real title available?)
• scientific article; zbMATH DE number 1859030 (Why is no real title available?)
• Lattices Which Are Good for (Almost) Everything
• Minimal vectors in the second exterior power of a lattice
• Normal and integral currents
• On Positive Definite Quadratic Forms
• Projective plane and planar quantum codes
• Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
• Quantum locally testable codes
• Rankin’s Constant and Blockwise Lattice Reduction
• Sparse quantum codes from quantum circuits
• Systolic freedom of orientable manifolds1
• Topological quantum memory

Cited in

(11)

• Building manifolds from quantum codes
• Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
• scientific article; zbMATH DE number 1796840 (Why is no real title available?)
• Approximate low-weight check codes and circuit lower bounds for noisy ground states
• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Hypermap-homology quantum codes
• Single-shot decoding of good quantum LDPC codes
• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
• Robust quantum entanglement at (nearly) room temperature
• Towards local testability for quantum coding

This page was built for publication: Quantum codes from high-dimensional manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638075)