Show simple item record

dc.contributor.authorGu, Shouzhen
dc.contributor.authorTang, Eugene
dc.contributor.authorCaha, Libor
dc.contributor.authorChoe, Shin Ho
dc.contributor.authorHe, Zhiyang
dc.contributor.authorKubica, Aleksander
dc.date.accessioned2024-03-18T15:28:40Z
dc.date.available2024-03-18T15:28:40Z
dc.date.issued2024-03
dc.identifier.issn0010-3616
dc.identifier.issn1432-0916
dc.identifier.urihttps://hdl.handle.net/1721.1/153814
dc.description.abstractQuantum 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.en_US
dc.publisherSpringer Science and Business Media LLCen_US
dc.relation.isversionof10.1007/s00220-024-04951-6en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceSpringer Berlin Heidelbergen_US
dc.subjectMathematical Physicsen_US
dc.subjectStatistical and Nonlinear Physicsen_US
dc.titleSingle-Shot Decoding of Good Quantum LDPC Codesen_US
dc.typeArticleen_US
dc.identifier.citationCommunications in Mathematical Physics. 2024 Mar 14;405(3):85en_US
dc.contributor.departmentMassachusetts Institute of Technology. Center for Theoretical Physics
dc.contributor.departmentMassachusetts Institute of Technology. Department of Physics
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2024-03-17T04:13:10Z
dc.language.rfc3066en
dc.rights.holderThe Author(s)
dspace.embargo.termsN
dspace.date.submission2024-03-17T04:13:09Z
mit.journal.volume405en_US
mit.journal.issue3en_US
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record