Percolation transition vs. erasure thresholds for surface codes on graphs

For a family of finite rate stabilizer codes, one can define two distinct error correction thresholds: the usual "block" threshold for the entire code, and the single-qubit threshold, where we only care about the stability of a single encoded qubit corresponding to a randomly chosen conjugate pair of logical X and Z operators.  Our main result is that in the case of erasures, for hyperbolic surface codes related to a {p,q} tiling of the hyperbolic plane, it is the latter threshold that coincides exactly with the infinite-graph edge percolation transition.  I will also discuss likely generalizations to more general codes and other error models. This is joint work with Nicolas Delfosse.

Event Type: 
Scientific Area(s): 
Event Date: 
Mercredi, Avril 26, 2017 - 16:00 to 17:30
Time Room
Room #: