Single-shot decoding of good quantum LDPC codes

June 21, 2023 Β· Declared Dead Β· πŸ› Communications in Mathematical Physics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shouzhen Gu, Eugene Tang, Libor Caha, Shin Ho Choe, Zhiyang He, Aleksander Kubica arXiv ID 2306.12470 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 50 Venue Communications in Mathematical Physics Last Checked 2 months ago
Abstract
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

R.I.P. πŸ‘» Ghosted

Variational Quantum Algorithms

M. Cerezo, Andrew Arrasmith, ... (+9 more)

quant-ph πŸ› Nature Reviews Physics πŸ“š 3.3K cites 5 years ago

Died the same way β€” πŸ‘» Ghosted