On the hardnesses of several quantum decoding problems

DOI10.1007/S11128-020-02622-8OpenAlexW3008561103MaRDI QIDQ2677282FDOQ2677282

Authors: Kao-Yueh Kuo, Chung-Chin Lu 

Publication date: 13 January 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5173

Recommendations

• The hardness of decoding linear codes with preprocessing
• Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
• On the Hardness of Decoding the Gale–Berlekamp Code
• Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
• Hard Problems of Algebraic Geometry Codes

zbMATH Keywords

computational complexityquantum cryptographydegeneracy propertyquantum stabilizer codesquantum error correction codesdecoding hardness

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum Error Correction and Orthogonal Geometry
• Quantum error correction via codes over GF(4)
• Algebraic function fields and codes
• On the inherent intractability of certain coding problems (Corresp.)
• Faster integer multiplication
• Quantum McEliece public-key cryptosystem
• Quantum information theory
• On the iterative deconding of sparse quantum codes
• Wild McEliece
• Introduction to post-quantum cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• On binary constructions of quantum codes

Cited In (8)

• Quasi-cyclic constructions of asymmetric quantum error-correcting codes
• Quantum hardcore functions by complexity-theoretical quantum list decoding
• Syndrome decoding by quantum approximate optimization
• Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
• On the equivalence of two post-quantum cryptographic families
• On the Hardnesses of Several Quantum Decoding Problems
• A family of Hermitian dual-containing constacyclic codes and related quantum codes
• Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding

Uses Software

• McEliece

This page was built for publication: On the hardnesses of several quantum decoding problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677282)