Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Codes from High-Dimensional Manifolds (1608.05089v1)

Published 17 Aug 2016 in quant-ph, math-ph, and math.MP

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 ${\mathbb T}n={\mathbb R}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 $Cn$ 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 invariants\cite{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 codes\cite{qltc}). We also provide an short, alternative proof that the shortest vector in the exterior power of a lattice may be non-split\cite{coulangeon}.

Summary

We haven't generated a summary for this paper yet.