Topological subsystem codes from graphs and hypergraphs

Journal Article

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. © 2012 American Physical Society.

Full Text

Duke Authors

Cited Authors

  • Sarvepalli, P; Brown, KR

Published Date

  • October 31, 2012

Published In

Volume / Issue

  • 86 / 4

Electronic International Standard Serial Number (EISSN)

  • 1094-1622

International Standard Serial Number (ISSN)

  • 1050-2947

Digital Object Identifier (DOI)

  • 10.1103/PhysRevA.86.042336

Citation Source

  • Scopus