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

CONVOLUTIONAL DECODERS BASED ON QUANTUM ANNEALING

Ilyas Rysbekov

Published May 1, 2021• 0 citations
OpenAlex

Abstract

This research proposes a new method of decoding convolutional codes using quantum computers. The proposed method obtains maximum likelihood (ML) estimate of the transmitted codeword using quantum annealing (QA). The performance of the proposed method is assessed by its error performance and compared with the conventional Viterbi decoder on classical computers. The results verify the feasibility of QA for decoding convolutional codes. Furthermore, the execution time of both classical and quantum computers for decoding are compared and discussed.

Related papers

Efficient ML Decoding for Quantum Convolutional Codes

Peiyu Tan, Jing Li

A novel decoding algorithm is developed for general quantum convolutional codes. Exploiting useful ideas from classical coding theory, the new decoder introduces two innovations that drastically reduce the decoding complexity compared to the existing quantum Viterbi decoder. First, the new decoder uses an efficient linear-circuits-based mechanism to map a syndrome to a candidate vector, whereas the existing algorithm relies on a non-trivial lookup table. Second, the new algorithm is cleverly engineered such that only one run of the Viterbi algorithm suffices to locate the most-likely error pattern, whereas the existing algorithm must run the Viterbi algorithm many times. The efficiency of the proposed algorithm allows us to simulate and present the first performance curve of a general quantum convolutional code.

arXiv:1004.0174•Apr 1, 2010•1 citation

Quantum Annealing with Post-processing of Maximum Likelihood for LDPC Decoding

Yuhang Guo, Han Zeng, Feng Xiong +3 more

In the forthcoming 6G era, driven by the escalating demands for enhanced performance and reliability in communication systems, Low-Density Parity-Check (LDPC) codes emerge as a robust error correction coding scheme poised to effectively meet these requirements. In recent years, with the advancement of quantum computing, a proposal has emerged to integrate classical and quantum computing for the decoding of LDPC. The LDPC decoding can be treated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, thereby allowing the utilization of the D-Wave 2000Q quantum annealer for solving it. Expanding on this groundwork, the paper proposes an approach to enhance quantum annealing performance using classical algorithms. Specifically, it involves performing quantum annealing on the problem first, followed by post-processed using Maximum Likelihood Estimation (MLE) for the multiple outputs, known as QAML. Furthermore, to fully exploit the advantages of quantum annealing, this paper incorporates the energy and frequency of occurrence of candidate codewords as prior information into the Maximum Likelihood Estimation. These are called QAMLE and QAMLF respectively, further enhancing decoding performance. The proposed method is evaluated and compared with direct Quantum Annealing (QA) and Quantum Annealing with post-processing using Minimum Distance (QAMD). Research findings indicate that QAML exhibits a lower bit error rate compared to QA and QAMD.

Information Communication Technologies Conference (ICTC)•May 10, 2024•3 citations

Quantum convolutional codes: Practical syndrome decoder

Peiyu Tan, Jing Li

Quantum convolutional codes are predicted by many to offer higher error correction performance than quantum block codes of equivalent encoding complexity. However, to decode a quantum convolutional code is challenging, because the decoder does not have a measurement of the received codeword (due to the quantum mechanic rule “measurement destroys quantum states”), but only a measurement of the syndrome. Although quantum Viterbi decoding (QVD) has been proposed, its high complexity makes it rather difficult to implement or simulate. Exploiting useful ideas from classical coding theory, this paper develops a practical quantum syndrome decoder (QSD) by introducing two innovations that drastically reduce the decoding complexity compared to the existing QVD. The new decoder uses an efficient linear-circuits-based mechanism to map a syndrome to a candidate vector, obviating the need of a cumbersome lookup table. It is also cleverly engineered such that only one run of the Viterbi algorithm suffices to locate the most-likely error pattern, rather than have to run many rounds as in the previous QVD algorithm. The efficiency of the new decoder allows us to simulate and present the first performance curve of a general quantum convolutional code.

Conference on Information Sciences and Systems•Mar 1, 2012•0 citations

Maximum-Likelihood Channel Decoding with Quantum Annealing Machine

Naoki Ide, Tetsuya Asayama, Hiroshi Ueno +1 more

We formulate maximum likelihood (ML) channel decoding as a quadratic unconstraint binary optimization (QUBO) and simulate the decoding by the current commercial quantum annealing machine, D-Wave 2000Q. We prepared two implementations with Ising model formulations, generated from the generator matrix and the parity-check matrix respectively. We evaluated these implementations of ML decoding for low-density parity-check (LDPC) codes, analyzing the number of spins and connections and comparing the decoding performance with belief propagation (BP) decoding and brute-force ML decoding with classical computers. The results show that these implementations are superior to BP decoding in relatively short length codes, and while the performance in the long length codes deteriorates, the implementation from the parity-check matrix formulation still works up to 1k length with fewer spins and connections than that of the generator matrix formulation due to the sparseness of parity-check matrices of LDPC.

arXiv:2007.08689•Jul 16, 2020•14 citations

Description of Quantum Convolutional Codes

Lijuan Xing, Zhuo Li, Baoming Bai

Quantum communication system is influenced by environment noise in the whole process. Quantum error-correcting codes can solve this problem efficiently. The polynomial representation of a quantum state is defined. Based on the structure of the classical convolutional codes, the basis state of the quantum convolutional codes is transformed into the multiplication of an information polynomial by the generator polynomial. A new method is proposed to encode and decode these quantum codes and the networks can be realized with the polynomial multiplication circuits. Finally, we provide a maximum likelihood error estimation algorithm with complexity growing linearly.

International Conference on Wireless Communications, Networking and Mobile Computing•Oct 1, 2008•2 citations

Quantum Convolutional Codes Based on the Stabilizer of Linear Codes

Ying Guo, Guihua Zeng

A quantum error correction scheme is proposed to protect a flow of transmitted quantum information. It is largely inspired by the theory of classical convolutional codes and the construction of the linear quantum code for error correction using the stabilizer formalism. Also, we provide an explicit encoding circuit to describe the process of the online encoding and the quantum error propagation. To decode the construction of the code, a quantum Viterbi algorithm is put forward for decoding of quantum signals received at the decoder

Asia-Pacific Conference on Communications (APCC)•Dec 13, 2005•2 citations
This research proposes a new method of decoding convolutional codes using quantum computers. The proposed method obtains maximum likelihood (ML) estimate of the transmitted codeword using quantum annealing (QA). The performance of the proposed method is assessed by its error performance and compared with the conventional Viterbi decoder on classical computers. The results verify the feasibility of QA for decoding convolutional codes. Furthermore, the execution time of both classical and quantum computers for decoding are compared and discussed.
A novel decoding algorithm is developed for general quantum convolutional codes. Exploiting useful ideas from classical coding theory, the new decoder introduces two innovations that drastically reduce the decoding complexity compared to the existing quantum Viterbi decoder. First, the new decoder uses an efficient linear-circuits-based mechanism to map a syndrome to a candidate vector, whereas the existing algorithm relies on a non-trivial lookup table. Second, the new algorithm is cleverly engineered such that only one run of the Viterbi algorithm suffices to locate the most-likely error pattern, whereas the existing algorithm must run the Viterbi algorithm many times. The efficiency of the proposed algorithm allows us to simulate and present the first performance curve of a general quantum convolutional code.
In the forthcoming 6G era, driven by the escalating demands for enhanced performance and reliability in communication systems, Low-Density Parity-Check (LDPC) codes emerge as a robust error correction coding scheme poised to effectively meet these requirements. In recent years, with the advancement of quantum computing, a proposal has emerged to integrate classical and quantum computing for the decoding of LDPC. The LDPC decoding can be treated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, thereby allowing the utilization of the D-Wave 2000Q quantum annealer for solving it. Expanding on this groundwork, the paper proposes an approach to enhance quantum annealing performance using classical algorithms. Specifically, it involves performing quantum annealing on the problem first, followed by post-processed using Maximum Likelihood Estimation (MLE) for the multiple outputs, known as QAML. Furthermore, to fully exploit the advantages of quantum annealing, this paper incorporates the energy and frequency of occurrence of candidate codewords as prior information into the Maximum Likelihood Estimation. These are called QAMLE and QAMLF respectively, further enhancing decoding performance. The proposed method is evaluated and compared with direct Quantum Annealing (QA) and Quantum Annealing with post-processing using Minimum Distance (QAMD). Research findings indicate that QAML exhibits a lower bit error rate compared to QA and QAMD.
Quantum convolutional codes are predicted by many to offer higher error correction performance than quantum block codes of equivalent encoding complexity. However, to decode a quantum convolutional code is challenging, because the decoder does not have a measurement of the received codeword (due to the quantum mechanic rule “measurement destroys quantum states”), but only a measurement of the syndrome. Although quantum Viterbi decoding (QVD) has been proposed, its high complexity makes it rather difficult to implement or simulate. Exploiting useful ideas from classical coding theory, this paper develops a practical quantum syndrome decoder (QSD) by introducing two innovations that drastically reduce the decoding complexity compared to the existing QVD. The new decoder uses an efficient linear-circuits-based mechanism to map a syndrome to a candidate vector, obviating the need of a cumbersome lookup table. It is also cleverly engineered such that only one run of the Viterbi algorithm suffices to locate the most-likely error pattern, rather than have to run many rounds as in the previous QVD algorithm. The efficiency of the new decoder allows us to simulate and present the first performance curve of a general quantum convolutional code.
We formulate maximum likelihood (ML) channel decoding as a quadratic unconstraint binary optimization (QUBO) and simulate the decoding by the current commercial quantum annealing machine, D-Wave 2000Q. We prepared two implementations with Ising model formulations, generated from the generator matrix and the parity-check matrix respectively. We evaluated these implementations of ML decoding for low-density parity-check (LDPC) codes, analyzing the number of spins and connections and comparing the decoding performance with belief propagation (BP) decoding and brute-force ML decoding with classical computers. The results show that these implementations are superior to BP decoding in relatively short length codes, and while the performance in the long length codes deteriorates, the implementation from the parity-check matrix formulation still works up to 1k length with fewer spins and connections than that of the generator matrix formulation due to the sparseness of parity-check matrices of LDPC.
Quantum communication system is influenced by environment noise in the whole process. Quantum error-correcting codes can solve this problem efficiently. The polynomial representation of a quantum state is defined. Based on the structure of the classical convolutional codes, the basis state of the quantum convolutional codes is transformed into the multiplication of an information polynomial by the generator polynomial. A new method is proposed to encode and decode these quantum codes and the networks can be realized with the polynomial multiplication circuits. Finally, we provide a maximum likelihood error estimation algorithm with complexity growing linearly.
A quantum error correction scheme is proposed to protect a flow of transmitted quantum information. It is largely inspired by the theory of classical convolutional codes and the construction of the linear quantum code for error correction using the stabilizer formalism. Also, we provide an explicit encoding circuit to describe the process of the online encoding and the quantum error propagation. To decode the construction of the code, a quantum Viterbi algorithm is put forward for decoding of quantum signals received at the decoder