.png){kind=icon}
.png){kind=icon}
Return
Improvements to the DHSP quantum solving algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s11128-026-05145-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the field of quantum computing, the hidden subgroup problem (HSP) for finitely generated Abelian groups has been effectively solved, while research on non-Abelian groups continues to explore quantum computational capabilities. The dihedral hidden subgroup problem (DHSP), critical for cryptographic security, has attracted significant attention. This paper presents a quantum-classical hybrid scheme that replaces the iterative step in DHSP algorithms. The method generalizes the semiclassical quantum Fourier transform (QFT) to the DHSP context, which avoids serial processing limitations and reduces the complexity of modifying sampling circuits. By decoupling sampling from iteration, the proposed scheme enhances overall algorithmic efficiency.
Keywords:
Quantum computing
DHSP
Kuperberg algorithm
Hybrid algorithm
Journal
Q
IF:
2.2
Papers:
241
Citations:
0