Topological Subsystem Codes From Graphs and Hypergraphs
arXiv:1207.0479 · doi:10.1103/PhysRevA.86.042336
Abstract
Topological subsystem codes were proposed by Bombin based on 3-face-colorable cubic graphs. Suchara, Bravyi and Terhal generalized this construction and proposed a method to construct topological subsystem codes using 3-valent hypergraphs that satisfy certain constraints. Finding such hypergraphs and computing their parameters however is a nontrivial task. We propose families of topological subsystem codes that were previously not known. In particular, our constructions give codes which cannot be derived from Bombin's construction. We also study the error recovery schemes for the proposed subsystem codes and give detailed schedules for the syndrome measurement that take advantage of the 2-locality of the gauge group. The study also leads to a new and general construction for color codes.
LaTeX, 14 pages
References in corpus (8)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Subsystem fault tolerance with the Bacon-Shor code
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Fault-tolerant quantum computing with color codes
- Constructions and Noise Threshold of Topological Subsystem Codes
- Optimal error correction in topological subsystem codes
Cited by in corpus (9)
- Quantum memories at finite temperature
- Handling Leakage with Subsystem Codes
- Engineering 3D Floquet codes by rewinding
- Sparse Quantum Codes from Quantum Circuits
- Optimal quantum subsystem codes in 2-dimensions
- Homological Product Codes
- Relation Between Surface Codes and Hypermap-Homology Quantum Codes
- Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes
- Hypermap-Homology Quantum Codes (Ph.D. thesis)