Quantum LDPC codes from SAT instances

Quantum computing is promising a big leap in computing power. However, building a scalable quantum computer is not an easy task. One major limitation is the imperfect nature of qubits and the presence of noise in the system. To circumvent this problem, we need to design fault tolerant architectures for quantum computers. However, as of today, the most studied fault tolerant protocols are based upon surface codes and topological codes which do not scale well.

Quantum low-density parity check (LDPC) codes are an alternative to topological codes allowing scalable architectures. In this talk, I will introduce a new approach to design such codes based on solution of some satisfiability problems. I will also compare this approach to other constructions such as hypergraph product codes and hyperbolic codes.