Decoding of linear block codes using syndrome decoding and finding whether there exists a codeword of weight$w$in a set of codewords are known to belong to a class of NP-complete problems. For syndrome decoding of linear block codes, we provide an algorithm that gives a probabilistic solution with least Hamming weight. The algorithm can speed up this process significantly with the help of quantum search algorithm. For this, we make use of a search algorithm inspired from Grover's search. We also suggest a general approach for building a quantum circuit for syndrome detection. We test the algorithm in IBM Quantum Experience using qasm simulator and perform the complexity analysis identifying the algorithm's domain of utility.
Decoding of linear block codes using syndrome decoding and finding whether there exists a codeword of weightwin a set of codewords are known to belong to a class of NP-complete problems. For syndrome decoding of linear block codes, we provide an algorithm that gives a probabilistic solution with least Hamming weight. The algorithm can speed up this process significantly with the help of quantum search algorithm. For this, we make use of a search algorithm inspired from Grover's search. We also suggest a general approach for building a quantum circuit for syndrome detection. We test the algorithm in IBM Quantum Experience using qasm simulator and perform the complexity analysis identifying the algorithm's domain of utility.
The security of a broad family of coding-based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim is to find a word with a given syndrome and of Hamming weight smaller than a prefixed bound. If this last condition is replaced by “of minimum weight,” then we have the Coset Leader Problem (CLP), being Finding Low Weight Codewords (FLWC) a particular case (when the zero syndrome is considered). An algorithm that has been proposed in order to obtain approximate solutions of problems of these kind (NP-complete) is the Quantum Approximate Optimization Algorithm (QAOA), a variational hybrid quantum-classical algorithm. In this paper, we apply the QAOA to the CLP for binary linear codes. We model the problem, make the theoretical analysis the case of the first level, and introduce some experiments to test its performance. The experiments have been carried out on quantum computer simulators with codes of different lengths and QAOA of different depth.
Abstract The syndrome decoding problem is known to be NP-complete. The goal of the decoder is to find an error of low weight that corresponds to a given syndrome obtained from a parity-check matrix. We use the quantum approximate optimization algorithm (QAOA) to address the syndrome decoding problem with elegantly-designed reward Hamiltonians based on both generator and check matrices for classical and quantum codes.We evaluate the level-4 check-based QAOA decoding of the [7,4,3] Hamming code, as well as the level-4 generator-based QAOA decoding of the [[5,1,3]] quantum code.Remarkably, the simulation results demonstrate that the decoding performances match those of the maximum likelihood decoding. Moreover, we explore the possibility of enhancing QAOA by introducing additional redundant clauses to a combinatorial optimization problem while keeping the number of qubits unchanged. Finally, we study QAOA decoding of degenerate quantum codes.Typically, conventional decoders aim to find a unique error of minimum weight that matches a given syndrome. However, our observations reveal that QAOA has the intriguing ability to identify degenerate errors of comparable weight, providing multiple potential solutions that match the given syndrome with comparable probabilities.This is illustrated through simulations of the generator-based QAOA decoding of the [[9,1,3]] Shor code on specific error syndromes.
Abstract In the coding theory, it is one of the most important research problems to find an efficient algorithm for the decoding process. A quantum computer is an innovative computing device that performs calculations using the principles of quantum mechanics. In this paper, we find a decoding algorithm for binary linear codes using quantum circuits; this is the first time that quantum circuits are used as a main tool for decoding binary linear codes. Our decoding algorithm is mainly based on Grover’s search algorithm. In detail, we study the process of implementing the exhaustive search using quantum circuits for decoding binary linear codes. For our purpose, we design a modified Grover’s algorithm (algorithm 1) using three tools: the matrix multiplier, the Hamming weight counter, and the state indicator. We present algorithm 2, which is a quantum decoding algorithm for binary linear codes. We illustrate algorithm 1 using the [7, 4, 3] Hamming code, and algorithm 2 is implemented by IBM Quantum Composer.
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.
In this paper, we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the decoding problem consists of determining the most likely recovery given the syndrome. The corresponding classical problem is known to be NP-complete, and are appropriate a similar decoding problem for quantum codes is also known to be NP-complete. However, this decoding strategy is not optimal in the quantum setting as it does not consider error degeneracy, which causes distinct errors to have the same effect on the code. Here, we show that optimal decoding of stabilizer codes (previously known to be NP-hard) is in fact computationally much harder than optimal decoding of classical linear codes, it is #P-complete.
We commence by discussing classical syndrome decoding techniques that form the foundation for quantum error correction. Explicitly, they allow us to ascertain where the depolarization-induced errors occur and then to correct them without observing the quantum bits themselves. We then continue with a review of look-up table-based syndrome decoding designed for linear block codes, followed by the construction of syndrome-based error trellises for both block and convolutional codes. The chapter introduces trellis-based decoding using both the Viterbi and the Maximum A Posteriori algorithms, emphasizing their role in estimating the error patterns encountered from syndrome sequences. A reduced-complexity block syndrome decoding-based technique is presented for improving the decoding efficiency of turbo trellis coded modulation (TTCM) schemes. Simulation results recorded for transmission over AWGN and Rayleigh fading channels demonstrate significant complexity reductions, quantified in terms of the number of non-decoded blocks and the average number of iterations. The chapter concludes by highlighting the block syndrome decoder's potential for future designs.