Technical Program

Paper Detail

Paper IDQ.3.4
Paper Title Trimming Decoding of Color Codes over the Quantum Erasure Channel
Authors Sangjun Lee, CEA-Leti, France; Mehdi Mhalla, University of Grenoble Alpes, CNRS, Grenoble INP, LIG, France; Valentin Savin, CEA-Leti, France
Session Q.3: Quantum Error Correcting Codes and Decoding
Presentation Lecture
Track Quantum Systems, Codes, and Information
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract 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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!