On the hardnesses of several quantum decoding problems.
Saved in:
| Title: | On the hardnesses of several quantum decoding problems. |
|---|---|
| Authors: | Kuo, Kao-Yueh, Lu, Chung-Chin |
| Source: | Quantum Information Processing; Apr2020, Vol. 19 Issue 4, p1-17, 17p |
| Subject Terms: | QUANTUM cryptography, ERROR probability, DECODING algorithms, HARDNESS, DEFINITIONS |
| Abstract: | We classify the time complexities of three decoding problems for quantum stabilizer codes: quantum bounded distance decoding (QBDD), quantum maximum likelihood decoding (QMLD), and quantum minimum error probability decoding (QMEPD). For QBDD, we show that it is NP-hard based on Fujita's result, and cover the gap of full row rank of check matrices, like what Berlekamp, McEliece, and Tilborg suggested in 1978. Then, we give some insight into the quantum decoding problems to clarify that the degeneracy property is implicitly embedded in any decoding algorithm, independent of the typical definition of degenerate codes. Then, over the depolarizing channel model, we show that QMLD and QMEPD are NP-hard. The NP-hardnesses of these decoding problems indicate that decoding general stabilizer codes is extremely difficult, strengthening the foundation of quantum code-based cryptography. [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!