Équipe de Recherche en Physique de l'Information Quantique


Abstract = {In this article we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem is known to be {NP-complete}, and a similar decoding problem for quantum codes is also known to be {NP-complete.} However, this decoding strategy is not optimal in the quantum setting as it does not take into account error degeneracy, which causes distinct errors to have the same effect on the code. Here, we show that optimal decoding of stabilizer codes is computationally much harder than optimal decoding of classical linear codes, it is {\#P.}},
Author = {Iyer, Pavithran and Poulin, David},
Date-Added = {2013-10-31 21:20:38 +0000},
Date-Modified = {2015-12-14 16:29:46 +0000},
Eprint = {arXiv:1310.3235},
Journal = {IEEE Trans. Info. Theor.},
Keywords = {Quantum Physics},
Pages = {5209},
Title = {Hardness of decoding quantum stabilizer codes},
Volume = {61},
Year = {2015},
local-url = {IP15a.pdf}}