Homological error correction: Classical and quantum codes
From MaRDI portal
Publication:3529698
Abstract: We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension , while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension . We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.
Recommendations
Cites work
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 41062 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- P/NP , and the quantum field computer
- A Mathematical Theory of Communication
- A modular functor which is universal for quantum computation
- Anyons in an exactly solved model and beyond
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Error Correcting Codes in Quantum Theory
- Fault-tolerant quantum computation by anyons
- Mixed-state entanglement and quantum error correction
- Multiple-particle interference and quantum error correction
- Permutationally invariant codes for quantum error correction
- Quantum Error Correction and Orthogonal Geometry
- Quantum hair
- Reliable quantum computers
- Self-dual random-plaquette gauge model and the quantum toric code
- Simulation of topological field theories by quantum computers
- The physical nature of information
- Topological quantum computation
- Topological quantum memory
Cited in
(27)- Euclidean and hyperbolic asymmetric topological quantum codes
- On quantum SPC product codes
- Projective plane and planar quantum codes
- An application of Khovanov homology to quantum codes
- Hypermap-homology quantum codes
- On the construction of new toric quantum codes and quantum burst-error-correcting codes
- Bounding the distance of quantum surface codes
- Self-correcting quantum computers
- Homological quantum codes associated with a class of surface maps
- Topological color codes and two-body quantum lattice Hamiltonians
- On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
- On geometrically uniform codes and topological quantum MDS codes
- Homological stabilizer codes
- Qudit surface codes and hypermap codes
- Spacetime replication of continuous variable quantum information
- Topological quantum codes from self-complementary self-dual graphs
- Generalized toric codes coupled to thermal baths
- Homological quantum rotor codes: logical qubits from torsion
- Anomaly inflow for CSS and fractonic lattice models and dualities via cluster state measurement
- Quantum codes from high-dimensional manifolds
- Asymptotically good homological error correcting codes
- A new class of quantum codes associate with a class of maps
- On tensor products of CSS codes
- New classes of quantum codes on closed orientable surfaces
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Hyperbolic quantum color codes with normal subgroup structure derived from the Reidemeister-Schreier method
- Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphs
This page was built for publication: Homological error correction: Classical and quantum codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529698)
