Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes
arXiv:1805.12542
Abstract
Topological subsystem codes can combine the advantages of both topological codes and subsystem codes. Suchara et al. proposed a framework based on hypergraphs for construction of such codes. They also studied the performance of some subsystem codes. Later Bravyi et al. proposed a subsystem surface code. Building upon these works, we propose efficient decoding algorithms for large classes of subsystem codes on hypergraphs and surfaces. We also propose a construction of the subsystem surface codes that includes the code proposed by Bravyi et al. Our simulations for the subsystem code on the square octagon lattice resulted in a noise threshold of 1.75%. This is comparable to previous result of 2% by Bombin et al. who used a different algorithm.
LaTeX, 23 pages, 19 figures
References in corpus (6)
- Topological Quantum Distillation
- Subsystem fault tolerance with the Bacon-Shor code
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Topological degeneracy and vortex manipulation in Kitaev's honeycomb model
- Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes
- Topological quantum error correction in the Kitaev honeycomb model