Abstract
Kitaev’s toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between accuracy and efficiency, with a time complexity in O ( n log 2 n ). One question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an uncorrectable error pattern whose weight scales like d 1/2 and prove that the decoder corrects all error patterns of weight less than 5/6 d log2(6/5) , where d is the minimum distance of the toric code.
Funding Information
  • Plan France 2030 (NISQ2LSQ, ANR-22-PETQ-0006)
  • Agence Nationale de la Recherche (ANR) through QUDATA (ANR-18-CE47-0010)

This publication has 15 references indexed in Scilit: