Syndrome-Generalized Belief Propagation Decoding for Quantum Memories

Nithin Raveendran, Mohsen Bahrami, Bane Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Quantum low-density parity check (QLDPC) codes are promising in realization of scalable, fault tolerant quantum memory for computation. Many of the QLDPC codes constructions suffer from unavoidable short cycles in their Tanner graph which degrade the decoding performance of the belief propagation (BP) algorithm. In this paper, we propose a syndrome based generalized belief propagation (GBP) algorithm for decoding of quantum LDPC codes and analyze how the proposed algorithm escapes from short cycle trapping sets effectively compared to the BP algorithm. Simulation results show improved decoding performance of the GBP algorithm over BP for the dual containing Calderbank, Shor and Steane (CSS) codes when cycles of length 4 are considered in the region based approach.

Original languageEnglish (US)
Title of host publication2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538680889
StatePublished - May 2019
Event2019 IEEE International Conference on Communications, ICC 2019 - Shanghai, China
Duration: May 20 2019May 24 2019

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607


Conference2019 IEEE International Conference on Communications, ICC 2019

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Syndrome-Generalized Belief Propagation Decoding for Quantum Memories'. Together they form a unique fingerprint.

Cite this