Saved in:
Bibliographic Details
Main Authors: Aumann, Philipp, Fellner, Michael, Alber, David, Cykiert, Max, Fleckenstein, Christoph, ter Hoeven, Roeland, Stenzel, Leo, Valencia-Tortora, Riccardo J., Lechner, Wolfgang
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.12465
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918445887520768
author Aumann, Philipp
Fellner, Michael
Alber, David
Cykiert, Max
Fleckenstein, Christoph
ter Hoeven, Roeland
Stenzel, Leo
Valencia-Tortora, Riccardo J.
Lechner, Wolfgang
author_facet Aumann, Philipp
Fellner, Michael
Alber, David
Cykiert, Max
Fleckenstein, Christoph
ter Hoeven, Roeland
Stenzel, Leo
Valencia-Tortora, Riccardo J.
Lechner, Wolfgang
contents 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))$. Furthermore, we show that the scaling can be improved further by including iSWAP gates in the instruction set.
format Preprint
id arxiv_https___arxiv_org_abs_2604_12465
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Demonstrating Record Fidelity for the Quantum Fourier Transform
Aumann, Philipp
Fellner, Michael
Alber, David
Cykiert, Max
Fleckenstein, Christoph
ter Hoeven, Roeland
Stenzel, Leo
Valencia-Tortora, Riccardo J.
Lechner, Wolfgang
Quantum Physics
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))$. Furthermore, we show that the scaling can be improved further by including iSWAP gates in the instruction set.
title Demonstrating Record Fidelity for the Quantum Fourier Transform
topic Quantum Physics
url https://arxiv.org/abs/2604.12465