Le contenu de cette page n’est pas disponible en français. Veuillez nous en excuser.
 

Percolation transition vs. erasure thresholds for surface codes on graphs



Playing this video requires the latest flash player from Adobe.

Download link (right click and 'save-as') for playing in VLC or other compatible player.


Recording Details

Speaker(s): 
PIRSA Number: 
17040076

Abstract

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.