Relation Between Surface Codes and Hypermap-Homology Quantum Codes
arXiv:1312.6344 · doi:10.1103/PhysRevA.89.052316
Abstract
Recently, a new class of quantum codes based on hypermaps were proposed. These codes are obtained from embeddings of hypergraphs as opposed to surface codes which are obtained from the embeddings of graphs. It is natural to compare these two classes of codes and their relation to each other. In this context two related questions are addressed in this paper: Can the parameters of hypermap-homology codes be superior to those of surface codes and what is precisely the relation between these two classes of quantum codes? We show that a canonical hypermap code is identical to a surface code while a noncanonical hypermap code can be transformed to a surface code by CNOT gates alone. Our approach is constructive; we construct the related surface code and the transformation involving CNOT gates.
9 pages, LaTeX. Revised title, abstract and introduction. Minor changes in presentation
References in corpus (9)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological Computation without Braiding
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Qudit surface codes and gauge theory with finite cyclic groups
- Constructions and Noise Threshold of Topological Subsystem Codes
- Improved quantum hypergraph-product LDPC codes
- Topological Subsystem Codes From Graphs and Hypergraphs