QubitHub

qubithubquantum-fourier-transform

Quantum analog of the classical Discrete Fourier Transform. Transforms computational basis states into their frequency representation using O(n^2) gates — an exponential speedup over the classical FFT. The QFT is the core subroutine in Shor's factoring algorithm, quantum phase estimation, and many quantum simulation techniques.

RunCite

No licence specified, so all rights are reserved by default — forking copies this circuit but grants you no rights to reuse it.

Framework
Qiskit
Qubits
4
Depth
8
Gate set
H, CP, SWAP
Licence
Not specified
Version
v1
Updated
3 days ago
Last run
3 months ago

Circuit

circuit.py · Qiskit · depth 8
Loading circuit diagram…

qubithub.toml · 355 B

Code

Loading qubithub.toml…

Lineage

Not a fork.

No forks yet.

Suggested citation

@software{qubithub_quantumfouriertransform_2026,
  author = {QubitHub Circuits},
  title = {Quantum Fourier Transform},
  year = {2026},
  version = {v1},
  url = {https://qubithub.co/qubithub/quantum-fourier-transform},
}

Generated from this circuit's metadata. QubitHub does not mint DOIs, so this is not a registered identifier — check it against your venue's requirements before publishing.