Single-Shot Decoding of Good Quantum LDPC Codes

Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications in mathematical physics Jg. 405; H. 3; S. 85
Hauptverfasser: Gu, Shouzhen, Tang, Eugene, Caha, Libor, Choe, Shin Ho, He, Zhiyang, Kubica, Aleksander
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024
Springer Nature B.V
Springer Science + Business Media
Schlagworte:
Algorithms
Classical and Quantum Gravitation
Codes
Complex Systems
Decoding
Error correcting codes
Error correction
Fault tolerance
Mathematical and Computational Physics
Mathematical Physics
Noise measurement
Parameters
Parity
Physics
Physics and Astronomy
Quantum Physics
Relativity Theory
Theoretical
ISSN:0010-3616, 1432-0916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
USDOE
AC02-07CH11359
ISSN:0010-3616
1432-0916
DOI:10.1007/s00220-024-04951-6