Comparison of 2D topological codes and their decoding performances

Kao Yueh Kuo, Ching Yi Lai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Topological quantum codes are favored because they allow suitable qubit layouts for practical implementation. An N-qubit topological code can be decoded by minimum-weight perfect matching (MWPM) with complexity O(poly(N)). Recently it is shown that various quantum codes, including topological codes, can be decoded by an adapted belief propagation with memory effects (denoted MBP) with complexity almost linear in N. In this paper, we show that various two-dimensional topological codes, CSS or non-CSS, regardless of the layout, can be decoded by MBP, including color codes and a family of twisted XZZX codes. We will comprehensively compare these codes in terms of code efficiency and decoding performance, assuming perfect error syndromes.

Original languageEnglish
Title of host publication2022 IEEE International Symposium on Information Theory, ISIT 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages186-191
Number of pages6
ISBN (Electronic)9781665421591
DOIs
StatePublished - 2022
Event2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland
Duration: 26 Jun 20221 Jul 2022

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2022-June
ISSN (Print)2157-8095

Conference

Conference2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/TerritoryFinland
CityEspoo
Period26/06/221/07/22

Fingerprint

Dive into the research topics of 'Comparison of 2D topological codes and their decoding performances'. Together they form a unique fingerprint.

Cite this