Efficient decoding of random errors for quantum expander codes

DOI10.1145/3188745.3188886zbMath1428.81065arXiv1711.08351OpenAlexW2964050833WikidataQ62556707 ScholiaQ62556707MaRDI QIDQ5230316

Antoine Grospellier, Omar Fawzi, Anthony Leverrier

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

percolationquantum error correctiondecoding algorithmexpander codes

Mathematics Subject Classification ID

Decoding (94B35) Quantum coding (general) (81P70)

Related Items (2)

Single-shot decoding of good quantum LDPC codes ⋮ Approximate Bacon-Shor code and holography

This page was built for publication: Efficient decoding of random errors for quantum expander codes