Numerical study of hypergraph product codes

Abstract

Hypergraph product codes introduced by Tillich and Zémor are a class of quantum LDPC codes with constant rate and distance scaling with the square-root of the block size. Quantum expander codes, a subclass of these codes, can be decoded using the linear time small-set-flip algorithm of Leverrier, Tillich and Zémor. In this paper, we numerically estimate the performance for the hypergraph product codes under independent bit and phase flip noise. We focus on two families of hypergraph product codes. The first family has rate $1/61\sim 1.6\%$, has qubits of weight $10$ or $12$ and stabilizers of weight $11$. We report a threshold near $4.6\%$ for the small-set-flip decoder. We also show that for similar rate, the performance of the hypergraph product is better than the performance of the toric code as soon as we deal with more than $500$ logical qubits and that for $3600$ logical qubits, the logical error rate for the hypergraph product code is several orders of magnitude smaller. The second family has rate $0.2$, qubits of weight $10$ and $20$ and stabilizers of weight $15$. We report a threshold near $2\%$ for the small-set-flip decoder.

arXiv comment11 pages, 3 figures; Updated to include improved plots and new code family

References in corpus (4)

• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Constant overhead quantum fault-tolerance with quantum expander codes
• Quantum Expander Codes
• Numerical and analytical bounds on threshold error rates for hypergraph-product codes

Cited by in corpus (10)

• Quantum Low-Density Parity-Check Codes
• Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
• Fault-tolerant gates on hypergraph product codes
• Distance-preserving stabilizer measurements in hypergraph product codes
• Optimal quantum subsystem codes in 2-dimensions
• On maximum-likelihood decoding with circuit-level errors
• Partial Syndrome Measurement for Hypergraph Product Codes
• Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
• Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance
• Local Probabilistic Decoding of a Quantum Code