On the hardnesses of several quantum decoding problems
From MaRDI portal
Publication:2677282
DOI10.1007/s11128-020-02622-8OpenAlexW3008561103MaRDI QIDQ2677282
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
computational complexityquantum cryptographydegeneracy propertyquantum stabilizer codesquantum error correction codesdecoding hardness
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items (2)
Quasi-cyclic constructions of asymmetric quantum error-correcting codes ⋮ A family of Hermitian dual-containing constacyclic codes and related quantum codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic function fields and codes
- Wild McEliece
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- Introduction to post-quantum cryptography
- On the inherent intractability of certain coding problems (Corresp.)
- Quantum Error Correction and Orthogonal Geometry
- On binary constructions of quantum codes
- Quantum error correction via codes over GF(4)
- Quantum information theory
This page was built for publication: On the hardnesses of several quantum decoding problems