Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0912.4546 · IEEE Transactions on Information Theory

Enhanced Feedback Iterative Decoding of Sparse Quantum Codes

Yun-Jiang Wang, Barry C. Sanders, Bao-Ming Bai, Xin-Mei Wang

Published Feb 1, 2012• 49 citations
arXivHTMLPDF

Abstract

Decoding sparse quantum codes can be accomplished by syndrome-based decoding using a belief propagation (BP) algorithm. We significantly improve this decoding scheme by developing a new feedback adjustment strategy for the standard BP algorithm. In our feedback procedure, we exploit much of the information from stabilizers, not just the syndrome but also the values of the frustrated checks on individual qubits of the code and the channel model. Furthermore we show that our decoding algorithm is superior to belief propagation algorithms using only the syndrome in the feedback procedure for all cases of the depolarizing channel. Our algorithm does not increase the measurement overhead compared to the previous method, as the extra information comes for free from the requisite stabilizer measurements.

DOI
10.1109/tit.2011.2169534

Related papers

Feedback iterative decoding of sparse quantum codes

Yun-Jiang Wang, Bai Bao-Ming, Xinmei Wang

Decoding sparse quantum codes can be accomplished by syndrome-based decoding through using the sum-product algorithm (SPA). We significantly improve this decoding scheme by developing a new feedback adjustment strategy for the standard SPA. In our feedback strategy, we exploit not only the syndrome but also the values of the frustrated checks on individual qubits of the code and the channel model. Consequently, our decoding algorithm, on the one hand, can break the symmetric degeneracy, and on the other hand, can feed back more useful information to the SPA decoder to help the decoder determine a valid output, thereby significantly improving the decoding ability of the decoder. Moreover, our algorithm does not increase the measurement complexity compared with the previous method, but takes full advantage of the measured information.

Acta Physica Sinica•Jan 1, 2010•2 citations

Feedback sum-product decoding of sparse quantum codes for X-Z Pauli channels

Jinye Peng, Yun-Jiang Wang, Xinmei Wang +1 more

In this paper, a feedback sum-product decoding algorithm of sparse quantum codes for X-Z Pauli channels is developed. Compared with the previous decoding algorithm, our feedback strategy exploits not just the syndrome but also the values of the frustrated checks on individual qubits of the code and the character of the channel model with the portion of each error to adjust the probability distribution of information nodes. Due to the smart adjustment, our decoding algorithm, on one hand, can break the symmetric degeneracy, and on the other hand, can feed back more useful information to the SPA decoder to help the decoder determine a valid output, thereby significantly improving the decoding ability of the decoder. Moreover, our algorithm, which is based on GF(4), overcomes the limitation caused by decoding in GF(2). Finally, we want to point out that, our method does not increase the measurement overhead in comparison wioth the previous methods, as the extra information comes for free from the requisite stabilizer measurement.

Acta Physica Sinica•Jan 1, 2011•1 citation

On the iterative decoding of sparse quantum codes

David Poulin, Yeojin Chung

We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.

arXiv:0801.1241•Jan 8, 2008•68 citations

On the iterative decoding of sparse quantum codes

David Poulin, Yeojin Chung

We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.

Quantum Information and Computation•Nov 1, 2008•164 citations

Jointly-check iterative decoding algorithm for quantum sparse graph codes

邵军虎 SHAO Jun-hu, Bai Bao-Ming, Lin Wei +1 more

For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with a standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms the standard BP algorithm with an obvious performance improvement.

Chinese Physics B•Aug 1, 2010•1 citation

Decoding of Quantum Data-Syndrome Codes via Belief Propagation

Kao-Yueh Kuo, I-Chun Chern, Ching–Yi Lai

Quantum error correction is necessary to protect logical quantum states and operations. However, no meaningful data protection can be made when the syndrome extraction is erroneous due to faulty measurement gates. Quantum data-syndrome (DS) codes are designed to protect the data qubits and syndrome bits concurrently. In this paper, we propose an efficient decoding algorithm for quantum DS codes with sparse check matrices. Based on a refined belief propagation (BP) decoding for stabilizer codes, we propose a DS-BP algorithm to handle the quaternary quantum data errors and binary syndrome bit errors. Moreover, a sparse quantum code may inherently be able to handle minor syndrome errors so that fewer redundant syndrome measurements are necessary. We demonstrate this with simulations on a quantum hypergraph-product code.

arXiv:2102.01984•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•16 citations
Decoding sparse quantum codes can be accomplished by syndrome-based decoding using a belief propagation (BP) algorithm. We significantly improve this decoding scheme by developing a new feedback adjustment strategy for the standard BP algorithm. In our feedback procedure, we exploit much of the information from stabilizers, not just the syndrome but also the values of the frustrated checks on individual qubits of the code and the channel model. Furthermore we show that our decoding algorithm is superior to belief propagation algorithms using only the syndrome in the feedback procedure for all cases of the depolarizing channel. Our algorithm does not increase the measurement overhead compared to the previous method, as the extra information comes for free from the requisite stabilizer measurements.
Decoding sparse quantum codes can be accomplished by syndrome-based decoding through using the sum-product algorithm (SPA). We significantly improve this decoding scheme by developing a new feedback adjustment strategy for the standard SPA. In our feedback strategy, we exploit not only the syndrome but also the values of the frustrated checks on individual qubits of the code and the channel model. Consequently, our decoding algorithm, on the one hand, can break the symmetric degeneracy, and on the other hand, can feed back more useful information to the SPA decoder to help the decoder determine a valid output, thereby significantly improving the decoding ability of the decoder. Moreover, our algorithm does not increase the measurement complexity compared with the previous method, but takes full advantage of the measured information.
In this paper, a feedback sum-product decoding algorithm of sparse quantum codes for X-Z Pauli channels is developed. Compared with the previous decoding algorithm, our feedback strategy exploits not just the syndrome but also the values of the frustrated checks on individual qubits of the code and the character of the channel model with the portion of each error to adjust the probability distribution of information nodes. Due to the smart adjustment, our decoding algorithm, on one hand, can break the symmetric degeneracy, and on the other hand, can feed back more useful information to the SPA decoder to help the decoder determine a valid output, thereby significantly improving the decoding ability of the decoder. Moreover, our algorithm, which is based on GF(4), overcomes the limitation caused by decoding in GF(2). Finally, we want to point out that, our method does not increase the measurement overhead in comparison wioth the previous methods, as the extra information comes for free from the requisite stabilizer measurement.
We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.
We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.
Quantum error correction is necessary to protect logical quantum states and operations. However, no meaningful data protection can be made when the syndrome extraction is erroneous due to faulty measurement gates. Quantum data-syndrome (DS) codes are designed to protect the data qubits and syndrome bits concurrently. In this paper, we propose an efficient decoding algorithm for quantum DS codes with sparse check matrices. Based on a refined belief propagation (BP) decoding for stabilizer codes, we propose a DS-BP algorithm to handle the quaternary quantum data errors and binary syndrome bit errors. Moreover, a sparse quantum code may inherently be able to handle minor syndrome errors so that fewer redundant syndrome measurements are necessary. We demonstrate this with simulations on a quantum hypergraph-product code.