Syndrome-Generalized Belief Propagation Decoding for Quantum Memories

Nithin Raveendran; Mohsen Bahrami; Bane Vasic

doi:10.1109/ICC.2019.8761366

Syndrome-Generalized Belief Propagation Decoding for Quantum Memories

Nithin Raveendran, Mohsen Bahrami, Bane Vasic

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

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 language	English (US)
Title of host publication	2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781538680889
DOIs	https://doi.org/10.1109/ICC.2019.8761366
State	Published - May 2019
Event	2019 IEEE International Conference on Communications, ICC 2019 - Shanghai, China Duration: May 20 2019 → May 24 2019

Publication series

Name	IEEE International Conference on Communications
Volume	2019-May
ISSN (Print)	1550-3607

Conference

Conference	2019 IEEE International Conference on Communications, ICC 2019
Country/Territory	China
City	Shanghai
Period	5/20/19 → 5/24/19

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.2019.8761366

Cite this

Raveendran, N., Bahrami, M., & Vasic, B. (2019). Syndrome-Generalized Belief Propagation Decoding for Quantum Memories. In 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings Article 8761366 (IEEE International Conference on Communications; Vol. 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2019.8761366

Syndrome-Generalized Belief Propagation Decoding for Quantum Memories. / Raveendran, Nithin; Bahrami, Mohsen; Vasic, Bane.
2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8761366 (IEEE International Conference on Communications; Vol. 2019-May).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Raveendran, N, Bahrami, M & Vasic, B 2019, Syndrome-Generalized Belief Propagation Decoding for Quantum Memories. in 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings., 8761366, IEEE International Conference on Communications, vol. 2019-May, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, China, 5/20/19. https://doi.org/10.1109/ICC.2019.8761366

@inproceedings{b8a7fe229eed4331b5d673a03bda9cbf,

title = "Syndrome-Generalized Belief Propagation Decoding for Quantum Memories",

abstract = "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.",

author = "Nithin Raveendran and Mohsen Bahrami and Bane Vasic",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Conference on Communications, ICC 2019 ; Conference date: 20-05-2019 Through 24-05-2019",

year = "2019",

month = may,

doi = "10.1109/ICC.2019.8761366",

language = "English (US)",

series = "IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2019 IEEE International Conference on Communications, ICC 2019 - Proceedings",

}

TY - GEN

T1 - Syndrome-Generalized Belief Propagation Decoding for Quantum Memories

AU - Raveendran, Nithin

AU - Bahrami, Mohsen

AU - Vasic, Bane

PY - 2019/5

Y1 - 2019/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85070187220&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070187220&partnerID=8YFLogxK

U2 - 10.1109/ICC.2019.8761366

DO - 10.1109/ICC.2019.8761366

M3 - Conference contribution

AN - SCOPUS:85070187220

T3 - IEEE International Conference on Communications

BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Conference on Communications, ICC 2019

Y2 - 20 May 2019 through 24 May 2019

ER -

Syndrome-Generalized Belief Propagation Decoding for Quantum Memories

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this