Leveraging the hardness of dihedral coset problem for quantum cryptography
X Yan, L Gu, J Suo, L Wang - Quantum Information Processing, 2022 - Springer
The dihedral coset problem (DCP) that comes from the hidden subgroup problem over
dihedral group is one of the fundamental problems in quantum computation, and its …
dihedral group is one of the fundamental problems in quantum computation, and its …
[PDF][PDF] A heuristic approach to the dihedral hidden subgroup problem
H Fujita - EasyChair-Preprint-3475, version, 2022 - easychair.org
The dihedral hidden subgroup problem (DHSP) is a long-standing open problem in
quantum computation. The best known quantum algorithm for the DHSP is Kupperberg's …
quantum computation. The best known quantum algorithm for the DHSP is Kupperberg's …
[图书][B] Quantum Reductions from Hard Problems
NH Chia - 2018 - search.proquest.com
Finding reductions between problems is a fundamental way to evaluate hardness of
computational tasks. With hypothesis in complexity theory such as NP≠ P, finding …
computational tasks. With hypothesis in complexity theory such as NP≠ P, finding …