PIRSA:14070007

Video URL

https://pirsa.org/14070007

Injectivity radius bounds on the minimum distance of quantum LDPC codes

(2014). Injectivity radius bounds on the minimum distance of quantum LDPC codes. Perimeter Institute for Theoretical Physics. https://pirsa.org/14070007

Injectivity radius bounds on the minimum distance of quantum LDPC codes. Perimeter Institute for Theoretical Physics, Jul. 15, 2014, https://pirsa.org/14070007 

          @misc{ scivideos_PIRSA:14070007,
            doi = {10.48660/14070007},
            url = {https://pirsa.org/14070007},
            author = {},
            keywords = {},
            language = {en},
            title = {Injectivity radius bounds on the minimum distance of quantum LDPC codes},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2014},
            month = {jul},
            note = {PIRSA:14070007 see, \url{https://scivideos.org/pirsa/14070007}}
          }
Talk numberPIRSA:14070007
DOI10.48660/14070007
Source RepositoryPIRSA
Collection
Talk Type Conference

Abstract

Only a rare number of constructions of quantum LDPC codes are equipped with an unbounded minimum distance. Most of them are inspired by Kitaev toric codes constructed from the a tiling of the torus such as, color codes which are based on 3-colored tilings of surfaces, hyperbolic codes which are defined from hyperbolic tilings, or codes based on higher dimensional manifolds. These constructions are based on tilings of surfaces or manifolds and their parameters depend on the homology of the tiling.

In the first part of this talk, we recall homological bounds on the parameters of these quantum LDPC codes. In particular, the injectivity radius of the tiling provides a general lower bound on the minimum distance of these quantum LDPC codes.

Then, we extend the injectivity radius method to bound the minimum distance of a family of quantum LDPC codes based on Cayley graphs.
Finally, we improve these results by studying a notion of expansion of these Cayley graphs.

This talk is based on a joint work with Alain Couvreur and Gilles Zémor, and a joint work with Zhentao Li and Stephan Tommassé.