Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes

Abstract

We discuss error-correction properties for families of quantum low-density parity check (LDPC) codes with relative distance that tends to zero in the limit of large blocklength. In particular, we show that any family of LDPC codes, quantum or classical, where distance scales as a positive power of the block length, $d\propto n^{\alpha }$, $\alpha >0$, can correct all errors with certainty if the error rate per (qu)bit is sufficiently small. We specifically analyze the case of LDPC version of the quantum hypergraph-product codes recently suggested by Tillich and Zémor. These codes are a finite-rate generalization of the toric codes, and, for sufficiently large quantum computers, offer an advantage over the toric codes.

4.5 pages, 1 figure

References in corpus (5)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Towards fault-tolerant quantum computing with trapped ions
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study

Cited by in corpus (2)

• Fault-tolerant logical gates in quantum error-correcting codes
• Tight lower bound for percolation threshold on a quasi-regular graph