arXiv (OAI Expanded)
open access
Quantum Fourier transform toolbox
Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm of the group order, efficient constructions are known for relatively few non-abelian families. We develop two new approac
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
- Quantum Fourier transform toolbox#792566
- A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
- On the Computational Power of Geometrically Local QAC circuits#1143727
- Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform#665456
- Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform#663956
Record · ID 788566
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