arXiv (OAI Expanded)
open access
$\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing
The Quantum Fourier Transform (QFT) is employed 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 e
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem#1130310
- A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform#1052063
- On the Need for (Quantum) Memory with Short Outputs#1116216
- Transformers with Selective Access to Early Representations#155277
- Propagating sparsely supported states with time-dependent neural quantum states#973664
Record · ID 1122456
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive