O(n) alternative to Quantum Fourier Transform with efficient neural net classical post-processing
quant-ph, cs.LG
Submitted: 2026-05-16
Updated: 2026-09-15
Comments: Added evidence for efficient scaling of neural-network decoding; strengthened the numerical support through full Shor factoring simulations at larger system sizes; and improved the presentation for clarity and accessibility
Code: https://github.com/Fragecity/altqft
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Quantum measurements and the Abelian Stabilizer Problem
- The Hidden Subgroup Problem - Review and Open Problems
- Demonstrating Record Fidelity for the Quantum Fourier Transform
- An approximate Fourier transform useful in quantum factoring
- Quantum Fourier Transform using Dynamic Circuits
- Towards a Neural Statistician
- Learning Hamiltonians for $O(1)$ Oracle-Query Quantum State Preparation
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity