AI RESEARCH
$\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing
arXiv CS.LG
•
ArXi:2605.16998v1 Announce Type: cross The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives we identify two properties that are exploited by the QFT to enable HSP. Firstly, the shift invariance of the QFT allows for the removal of a random overall shift. Secondly, the QFT retains information about the hidden subgroup generator accessible in the measurement outcomes.