Low-Complexity Decoding Algorithm Utilizing Degeneracy for Quantum LDPC Codes
Quantum low-density parity-check (QLDPC) codes have been considered as a promising solution for the fault-tolerant quantum computing. However, the belief propagation (BP) decoding for QLDPC codes does not take into account the degeneracy, resulting in certain performance degradation. Recently, vario...
Saved in:
| Published in: | MILCOM IEEE Military Communications Conference pp. 115 - 120 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
30.10.2023
|
| Subjects: | |
| ISSN: | 2155-7586 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Quantum low-density parity-check (QLDPC) codes have been considered as a promising solution for the fault-tolerant quantum computing. However, the belief propagation (BP) decoding for QLDPC codes does not take into account the degeneracy, resulting in certain performance degradation. Recently, various post-processing algorithms have been proposed to address this issue but they in return require excessive additional complexity and/or long decoding latency. Motivated by this, in this paper, we propose an efficient decoding algorithm that takes reduced decoding complexity for the post-processing. In particular, the proposed algorithm performs the post-processing in such a way that it first selects a variable node based on a proposed metric, and the depolarizing channel model for the selected variable node is reinitialized according to the BP decoding results. Then, the BP decoding is performed for the depolarizing channel model in which the selected node follows the reinitialized channel characteristics. The process of selection, reinitialization and BP decoding, say a trial, is iterated until it reaches a predetermined value or all syndromes are met. The main ideas of this work lie in formulating the metric for selection and reinitialization to minimize the number of trials until the degeneracy is resolved. Finally, simulation results show that the proposed decoding algorithms can significantly reduce the decoding complexity with similar decoding performance to that of an existing algorithm. |
|---|---|
| AbstractList | Quantum low-density parity-check (QLDPC) codes have been considered as a promising solution for the fault-tolerant quantum computing. However, the belief propagation (BP) decoding for QLDPC codes does not take into account the degeneracy, resulting in certain performance degradation. Recently, various post-processing algorithms have been proposed to address this issue but they in return require excessive additional complexity and/or long decoding latency. Motivated by this, in this paper, we propose an efficient decoding algorithm that takes reduced decoding complexity for the post-processing. In particular, the proposed algorithm performs the post-processing in such a way that it first selects a variable node based on a proposed metric, and the depolarizing channel model for the selected variable node is reinitialized according to the BP decoding results. Then, the BP decoding is performed for the depolarizing channel model in which the selected node follows the reinitialized channel characteristics. The process of selection, reinitialization and BP decoding, say a trial, is iterated until it reaches a predetermined value or all syndromes are met. The main ideas of this work lie in formulating the metric for selection and reinitialization to minimize the number of trials until the degeneracy is resolved. Finally, simulation results show that the proposed decoding algorithms can significantly reduce the decoding complexity with similar decoding performance to that of an existing algorithm. |
| Author | Kim, Jaemin Ha, Jeongseok Jung, Hyunwoo |
| Author_xml | – sequence: 1 givenname: Jaemin surname: Kim fullname: Kim, Jaemin email: jmkinn@kaist.ac.kr organization: Korea Advanced Institute of Science and Technology,School of Electrical Engineering,Daejeon,Republic of Korea – sequence: 2 givenname: Hyunwoo surname: Jung fullname: Jung, Hyunwoo email: destinylz@kaist.ac.kr organization: Korea Advanced Institute of Science and Technology,School of Electrical Engineering,Daejeon,Republic of Korea – sequence: 3 givenname: Jeongseok surname: Ha fullname: Ha, Jeongseok email: jsha@kaist.edu organization: Korea Advanced Institute of Science and Technology,School of Electrical Engineering,Daejeon,Republic of Korea |
| BookMark | eNo1kEtOwzAUAA0CiVJ6AxbmACnPdvxbVimFSqkKEl1XJn4uRklcJamgnB4QsBppFrOYS3LWphYJuWEwZQzs7WpZFuuVNELrKQcupgyEVNzkJ2RitTVCguDMsPyUjDiTMtPSqAsy6fs3AGDcKG7ZiKzK9J4VqdnX-BGHI51jlXxsd3RW71IXh9eGboZYx88fN8cdtti56khD6ujTwbXDoaHl_LGgRfLYX5Hz4OoeJ38ck83i7rl4yMr1_bKYlVnkkA9ZFbwEKxwiBsiNAM3QeZsHq51hkuUVeqWC0lqrF1TG8aDAVMz6ShuvvBiT699u_E5s911sXHfc_h8QX2XAUq4 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/MILCOM58377.2023.10356284 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) - NZ url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9798350321814 |
| EISSN | 2155-7586 |
| EndPage | 120 |
| ExternalDocumentID | 10356284 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO RNS |
| ID | FETCH-LOGICAL-i204t-cfd5093aeeef0483071ead94f97a81514ced66f67776be68a2f608c19dc78d6d3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001156887600020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:24:35 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i204t-cfd5093aeeef0483071ead94f97a81514ced66f67776be68a2f608c19dc78d6d3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_10356284 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Oct.-30 |
| PublicationDateYYYYMMDD | 2023-10-30 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-Oct.-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationTitle | MILCOM IEEE Military Communications Conference |
| PublicationTitleAbbrev | MILCOM |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001286291 |
| Score | 2.2362125 |
| Snippet | Quantum low-density parity-check (QLDPC) codes have been considered as a promising solution for the fault-tolerant quantum computing. However, the belief... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 115 |
| SubjectTerms | Decoding decoding algorithm degeneracy Fault tolerance Fault tolerant systems low-density parity-check codes Military communication Performance evaluation Quantum computing Quantum error correction codes Simulation |
| Title | Low-Complexity Decoding Algorithm Utilizing Degeneracy for Quantum LDPC Codes |
| URI | https://ieeexplore.ieee.org/document/10356284 |
| WOSCitedRecordID | wos001156887600020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFG6EGKMv3jDeUxNfhxubbfdohkQTQEwk4Y2U9hSXADOwafDXe1pA8cEH35pmJ2u-s-47vZzvEHLti1hAhIscWZPKi0yALcO5p7nyQfjGCq64YhO83Ra9XtxZJqu7XBgAcJfPoGqb7ixfZ6qwW2U4w0OkaxGVSIlztkjWWttQweA8DrbI1VJH86b12EyeWrf4Nl61VcKrK_tflVQckTR2_zmEPVL5ScmjnW-y2ScbMDkgO2tqgoek1cw-PDu_rcZlPqd1XFnah-ndaJhN0_x1TLt5Oko_bV8dhk5wWs0phq30uUCEizFt1jsJTTINswrpNu5fkgdvWS3BS2t-lHvKaCT_UOKQjdWJx9gBv5I4MjGXAnk9UqAZM4wjdANgQtYM84UKYq240EyHR6Q8ySZwTChoIZkJ0I3oR6XUAKQUHCI0Ukj5cEIqFpn-20IQo78C5fSP_jOybfF3v3z_nJTzaQEXZFO95-lseunc-AWjAp6A |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFG4UjZcXbxjv1sTX4Qaz7R7NkEjcEBNIeCOjPcUlwAxsGvz1ns6h-OCDb81JtzbnrPlO253vI-TaFp4AFzc5UTWSlqsdbGnOLcWlDcLWhnAlF5vgrZbo9bx2Uaye18IAQP7zGVRMM7_LV4nMzFEZrvAawrVwV8makc4qyrWWjlQwPfecDXJVMGnehM3AfwpvcTxeMTrhlcUbfmmp5FDS2PnnJHZJ-acoj7a_4WaPrMBkn2wv8QkekDBI3i2zwg3LZTqnddxbms70bjRMpnH6MqbdNB7FH8ZWh2FOOS3nFBNX-pyhj7MxDeptn_qJglmZdBv3Hf_BKvQSrLhqu6kltUL4r0U4ZW2Y4jF7wO_Ec7XHI4HI7kpQjGnGOWcDYCKqamYL6XhKcqGYqh2S0iSZwBGhoETEtIOBxEhKKQcQRYKDiw9JBH04JmXjmf7rFyVGf-GUkz_sl2TzoRMG_aDZejwlWyYWOQDYZ6SUTjM4J-vyLY1n04s8pJ8U4aHJ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=MILCOM+IEEE+Military+Communications+Conference&rft.atitle=Low-Complexity+Decoding+Algorithm+Utilizing+Degeneracy+for+Quantum+LDPC+Codes&rft.au=Kim%2C+Jaemin&rft.au=Jung%2C+Hyunwoo&rft.au=Ha%2C+Jeongseok&rft.date=2023-10-30&rft.pub=IEEE&rft.eissn=2155-7586&rft.spage=115&rft.epage=120&rft_id=info:doi/10.1109%2FMILCOM58377.2023.10356284&rft.externalDocID=10356284 |