arXiv (All)
open access
A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform
We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact $N$-point Quantum Fourier Transform (QFT) for arbitrary $N$. Our construction factors the $N$-dimensional QFT unitary into three diagonal quadratic-phase gates and two standard radix-2 QFT subcircuits of size $M =
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
- Efficient Quantum Fourier Transforms For Semisimple Algebras#1129238
- Fast Quantum Amplitude Encoding of Typical Classical Data#635579
- Fast Quantum Amplitude Encoding of Typical Classical Data#633230
- $\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing#1122456
- The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem#1130310
Record · ID 1052063
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