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.

Run Cite

Framework: Qiskit
Qubits: 3
Depth: 7
Gate set: H, CP, SWAP
Licence: Apache-2.0
Version: v1
Updated: 2 days ago
Runs: 1 completed

Circuit

circuit.py · Qiskit · depth 7

1 completed run

1 completed run.

Runs are private to the person who ran them.

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.