Syndrome decoding by quantum approximate optimization.
Saved in:
| Title: | Syndrome decoding by quantum approximate optimization. |
|---|---|
| Authors: | Lai, Ching-Yi, Kuo, Kao-Yueh, Liao, Bo-Jyun |
| Source: | Quantum Information Processing; Nov2024, Vol. 23 Issue 11, p1-33, 33p |
| Subject Terms: | OPTIMIZATION algorithms, PARITY-check matrix, HAMMING codes, COMBINATORIAL optimization, QUBITS |
| 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 FROM AUTHOR] |
| Copyright of Quantum Information Processing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!