Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy
Abstract
We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor (LNN) qubit topology. We first introduce a novel strategy that compiles the n-qubit QFT onto an LNN topology using only n2 − n CX gates, matching requirements of a direct compilation on an all-to-all architecture. We then derive the convolutional variant used in our experiments, which requires an additional two CX gates in total, and is realized via a compact, translation-invariant kernel circuit gadget that traverses a quantum register. We demonstrate the power of the convolutional compilation strategy on the IBM Quantum Platform by executing QFT benchmarking circuits. We measure a process fidelity of 11.4% at 50 qubits, and 1.8% at 80 qubits. The correct output state remains clearly distinguishable above background noise up to 100 qubits. These results constitute the largest experimental QFT demonstrated on any quantum computing hardware to date.
Related
- Image Compression Using Quantum Wavelet Transform and Quantum Convolutional Networks
- Hybrid pattern recognition for charged particle tracking: Hough transform and convolutional neural efficiency networks
- Experimental Demonstration of Autonomous Class Aware Optimization via Digital Twin Aided Optical Network Agent
- Experimental demonstration of finite-size general security via discrete-modulated CVQKD with real time postprocessing
- Experimental Demonstration of 7-Dimensional N-Vector Model with Dimensional Inflation and Annealing
BibTeX
@misc{coote2026experimental,
title = {{Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy}},
author = {Paul Coote and Michael J. Biercuk and Yuval Baum},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.05435},
eprint = {2608.05435},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.05435},
}
RIS
TY - UNPB
TI - Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy
AU - Paul Coote
AU - Michael J. Biercuk
AU - Yuval Baum
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2608.05435
UR - https://arxiv.org/abs/2608.05435
AB - We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor (LNN) qubit topology. We first introduce a novel strategy that compiles the n-qubit QFT onto an LNN topology using only n^2 − n CX gates, matching requirements of a direct compilation on an all-to-all architecture. We then derive the convolutional variant used in our experiments, which requires an additional two CX gates in total, and is realized via a compact, translation-invariant kernel circuit gadget that traverses a quantum register. We demonstrate the power of the convolutional compilation strategy on the IBM Quantum Platform by executing QFT benchmarking circuits. We measure a process fidelity of 11.4% at 50 qubits, and 1.8% at 80 qubits. The correct output state remains clearly distinguishable above background noise up to 100 qubits. These results constitute the largest experimental QFT demonstrated on any quantum computing hardware to date.
ER -