We’ve reached record fidelity for the Quantum Fourier Transform on 50 qubits, achieving a super-exponential speedup over previous methods.
April 17, 2026
Original Paper
Demonstrating Record Fidelity for the Quantum Fourier Transform
arXiv · 2604.12465
The Takeaway
The Quantum Fourier Transform (QFT) is the engine behind almost every meaningful quantum algorithm, but noise usually kills its performance at scale. This team achieved record process fidelity on 50 qubits by bypassing traditional swap-based scaling. At this scale, classical simulation starts to struggle, meaning we are entering the zone of true quantum advantage. This brings us significantly closer to practical cryptographic and scientific applications on real quantum hardware. It’s the first time QFT has looked viable for large-scale digital quantum computing.
From the abstract
We demonstrate the Parity Architecture on quantum hardware, using the quantum Fourier transform (QFT) as a benchmark. As a result, a record performance in both fidelity and qubit count is achieved using quantum processors with a native CZ-based instruction set. On the IBM Heron r3 chip, a process fidelity of the QFT algorithm of ${F \approx 10^{-2}}$ for ${N=50}$ qubits is achieved. The scaling of the speedup compared to previous swap-based methods is super-exponential $\mathcal{O}(\exp(N^2))$.