Abstract A closely coupled pair of conjectures/questions-one in differential geometry (by M. Gromov), the other in quantum information theory-are both answered in the negative. The answer derives from a certain metrical flexibility of manifolds and a corresponding improvement to the theoretical efficiency of existing local quantum codes. We exhibit this effect by constructing a family of metrics on S2 × S1, and other three and four dimensional manifolds. Quantitatively, the explicit “freedom” exhibited is too weak (a log1/2 factor in the natural scaling) to yield practical codes but we cannot rule out the possibility of other families of geometries with more dramatic freedom.
Abstract A closely coupled pair of conjectures/questions-one in differential geometry (by M. Gromov), the other in quantum information theory-are both answered in the negative. The answer derives from a certain metrical flexibility of manifolds and a corresponding improvement to the theoretical efficiency of existing local quantum codes. We exhibit this effect by constructing a family of metrics on S2 × S1, and other three and four dimensional manifolds. Quantitatively, the explicit “freedom” exhibited is too weak (a log1/2 factor in the natural scaling) to yield practical codes but we cannot rule out the possibility of other families of geometries with more dramatic freedom.
Homological quantum codes (also called topological codes) are low density parity check error correcting codes that come from surfaces and higher dimension manifolds. Homological codes from surfaces, i.e., surface codes, have also been suggested as a possible way to construct stable quantum memory and fault-tolerant computation. It has been conjectured that all homological codes have a square root bound on there distance and therefore cannot produce good codes. This claim has been disputed in dimension four using the geometric property of systolic freedom. We will show in this paper that the conjecture holds in dimension two due to the negation of systolic freedom, i.e., systolic rigidity.
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 N1−ε for any ε>0. The conjecture is that there is a constant C>0 such that for any n-dimensional torus Tn=Rn/Λ, where Λ 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 Λ 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}.
Abstract Our purpose here is to draw attention to an interesting relationship that can be shown to hold between (a) information geometry, and (b) quantum geometry. By ‘information geometry’, we mean the natural geometry associated with families of probability distributions. This is a subject that goes back more than half a century to the pioneering work of Rao (1945), who showed that the Fisher information matrix associated with a parametrised family of probability dis tributions gives rise to a natural Riemannian metric on the parameter space. This then allows one to speak in a precise way of the ‘distance’ between two probability distributions, an idea that turns out to be useful in problems of statistical inference. An extensive literature has thus developed, following this line of enquiry, on applications of differential geometry to statistics (see, e.g., Amari (1985), Barndorff-Nielsen et al. (1986), Murray and Rice (1993)). By ‘quantum geometry’, on the other hand, we mean the geometry of the manifold of states associated with a given quantum mechanical system. In particular, we consider the manifold of ‘pure’ states associated with a given complex Hilbert space. This is the space of ‘rays’ through the origin in the Hilbert space, which has the structure of a complex projective space. It is known that the usual rules of quantum mechanics allow one to construct a natural metric on this space, namely the Fubini-Study metric, the specification of which is equivalent to all the familiar structure associated with ordinary quantum mechanics.
Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are low density parity check codes with linear rate and distance n [superscript ε]. Their rate is evaluated via Euler characteristic arguments and their distance using Z[subscript 2] -systolic geometry. This construction answers a question of Zémor [“On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction,” in Proceedings of Second International Workshop on Coding and Cryptology (IWCC), (Lecture Notes in Computer Science). Vol. 5557 (2009), pp. 259–273], who asked whether homological codes with such parameters could exist at all.
Quantum computation and information has become a central research area in theoretical computer science. It studies how information is encoded in nature according to the laws of quantum mechanics and what this means for its computational power. On one hand, the ability of a quantum system to be in a superposition of states provides a way to encode an exponential amount of information in a quantum state. However, this information is accessible only indirectly via measurements. The goal of this thesis is precisely to investigate the fundamental question of how information is encoded and processed in quantum mechanical systems. (1) We investigate their power relative to classical encodings in the model of one-way communication complexity and show that they can be exponentially more efficient, answering a long standing open question in the area of quantum communication complexity. (2) We show how the theory developed for the study of quantum information can be employed in order to answer questions about classical coding theory and complexity. We resolve a main open question about the efficiency of Locally Decodable Codes by reducing the problem to one about quantum codes and solving the latter using tools from quantum information theory. This is the first example where quantum techniques are essential in resolving a purely classical question. (3) We investigate the power of quantum encodings in the area of cryptography. We study certain cryptographic primitives, such as Private Information Retrieval, Symmetrically-Private Information Retrieval and Coin Flipping.
Transversal non-Clifford gates on qLDPC codes breaking the N distance barrier and quantum-inspired geometry with Z2 systolic freedom
Historically, a Nlog1/2(N) distance barrier for quantum low-density parity-check (LDPC) codes with N qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether such a distance barrier can be broken while preserving the ability to perform transversal non-Clifford gates. In this direction, another long-standing distance barrier of N1/3 for LDPC stabilizer codes -- present since the discovery of the 3D color code -- was only recently overcome by a construction achieving an Ω(N) distance (arXiv:2501.19375). The present work further breaks the N distance barrier by taking a homological product of three good qLDPC codes, combined with the Freedman-Hastings code-to-manifold mapping and the triple cup product to implement transversal CCZ gates. The resulting code achieves an Ω(N2/3) distance (a linear X-distance of Θ(N)) and a dimension of Θ(N2/3), which enables fault-tolerant preparation of Θ(N1/3) independent logical CCZ magic states in a single shot, without distillation (`magic state fountain'). This new quantum code also inspires the discovery of a family of exotic 3q-dimensional manifolds M, which exhibit both a power-law Z2-(q, 2q)-systolic freedom and Θ(vol(M)) triple intersection points of 2q-dimensional submanifolds.