Constructions and noise threshold of topological subsystem codes

From MaRDI portal
Publication:2999482

DOI10.1088/1751-8113/44/15/155301zbMATH Open1213.81111arXiv1012.0425OpenAlexW2054426168WikidataQ62168075 ScholiaQ62168075MaRDI QIDQ2999482FDOQ2999482


Authors: Martin Suchara, Sergey Bravyi, Barbara M. Terhal Edit this on Wikidata


Publication date: 13 May 2011

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: Topological subsystem codes proposed recently by Bombin are quantum error correcting codes defined on a two-dimensional grid of qubits that permit reliable quantum information storage with a constant error threshold. These codes require only the measurement of two-qubit nearest-neighbor operators for error correction. In this paper we demonstrate that topological subsystem codes (TSCs) can be viewed as generalizations of Kitaev's honeycomb model to trivalent hypergraphs. This new connection provides a systematic way of constructing TSCs and analyzing their properties. We also derive a necessary and sufficient condition under which a syndrome measurement in a subsystem code can be reduced to measurements of the gauge group generators. Furthermore, we propose and implement some candidate decoding algorithms for one particular TSC assuming perfect error correction. Our Monte Carlo simulations indicate that this code, which we call the five-squares code, has a threshold against depolarizing noise of at least 2%.


Full work available at URL: https://arxiv.org/abs/1012.0425




Recommendations




Cited In (11)





This page was built for publication: Constructions and noise threshold of topological subsystem codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999482)