Demonstrating Record Fidelity for the Quantum Fourier Transform

2026/04/14 by Philipp Aumann, Michael Fellner, David Alber +6 · 1 voice
#quant-ph

paper · pdf

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 ≈ 10^-2 for N=50 qubits is achieved. The scaling of the speedup compared to previous swap-based methods is super-exponential O(exp(N²)). Furthermore, we show that the scaling can be improved further by including iSWAP gates in the instruction set.

Citations

• The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
• Continuous operation of a coherent 3,000-qubit system
• How to factor 2048 bit RSA integers with less than a million noisy qubits
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Expanding the Neutral Atom Gate Set: Native iSWAP and Exchange Gates from Dipolar Rydberg Interactions

Discussions

• Demonstrating Record Fidelity for the Quantum Fourier Transform This research represents a major leap forward in quantum algorithm implementation, achieving unprecedented fidelity for the quantum Four [bsky, 0 points, 0 comments]

Related

• Measured Quantum Fourier Transform of 1024 Qubits on Fiber Optics
• Quantum Fourier Transform using Dynamic Circuits
• Performance Evaluations of Signed and Unsigned Noisy Approximate Quantum Fourier Arithmetic
• Compilation, Optimization, Error Mitigation, and Machine Learning in Quantum Algorithms
• Quantum frequency resampling