Numerical and analytical bounds on threshold error rates for hypergraph-product codes
Skip to main content
eScholarship
Open Access Publications from the University of California

Numerical and analytical bounds on threshold error rates for hypergraph-product codes

  • Author(s): Kovalev, Alexey A
  • Prabhakar, Sanjay
  • Dumer, Ilya
  • Pryadko, Leonid P
  • et al.
Abstract

We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower and upper bounds for the decodable region are constructed analytically by analyzing the properties of the homological difference, equal minus the logarithm of the maximum-likelihood decoding probability for a given syndrome. Numerical results include an upper bound for the decodable region from specific heat calculations in associated Ising models, and a minimum weight decoding threshold of approximately 7%.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
Current View