|Trimming Decoding of Color Codes over the Quantum Erasure Channel
|Sangjun Lee, CEA-Leti, France; Mehdi Mhalla, University of Grenoble Alpes, CNRS, Grenoble INP, LIG, France; Valentin Savin, CEA-Leti, France
|Q.3: Quantum Error Correcting Codes and Decoding
|Quantum Systems, Codes, and Information
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|We propose a decoding algorithm for color codes over the quantum erasure channel, which is linear-time maximum likelihood (ML) when the set of erased qubits satisfies a certain condition called trimmability. Two methods are proposed for general erasure sets, either by extending the erasure set to make it trimmable, or by inactivating some vertices. The former is linear time but not ML, while the latter is ML but not linear time. Numerical results are provided to assess the error correction performance and the complexity of both methods.