Homological Product Codes


Bravyi, S. (2013). Homological Product Codes. Perimeter Institute. https://pirsa.org/13110091


Bravyi, Sergey. Homological Product Codes. Perimeter Institute, Nov. 27, 2013, https://pirsa.org/13110091


          @misc{ pirsa_PIRSA:13110091,
            doi = {10.48660/13110091},
            url = {https://pirsa.org/13110091},
            author = {Bravyi, Sergey},
            keywords = {Quantum Information},
            language = {en},
            title = {Homological Product Codes},
            publisher = {Perimeter Institute},
            year = {2013},
            month = {nov},
            note = {PIRSA:13110091 see, \url{https://pirsa.org}}

Sergey Bravyi IBM (United States)


Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their potential applications in fault-tolerant quantum computing. However, all families of quantum LDPC codes known to this date suffer from a poor distance scaling limited by the square-root of the code length. This is in a sharp contrast with the classical case where good families of LDPC codes are known that combine constant encoding rate and linear distance. Here we propose the first family of good quantum codes with low-weight stabilizers. The new codes have a constant encoding rate, linear distance, and stabilizers acting on at most square root of n qubits, where n is the code length. For comparison, all previously known families of good quantum codes have stabilizers of linear weight. Our proof combines two techniques: randomized constructions of good quantum codes and the homological product operation from algebraic topology. We conjecture that similar methods can produce good stabilizer codes with stabilizer weight n^a for any a>0. Finally, we apply the homological product to construct new small codes with low-weight stabilizers. This is a joint work with Matthew Hastings.