arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.12465quant-ph
收藏

展示量子傅里叶变换的记录保真度

Demonstrating Record Fidelity for the Quantum Fourier Transform

Parity Quantum Computing GmbH(Parity量子计算有限公司);Parity Quantum Computing Germany GmbH(Parity量子计算德国有限公司);Institute for Theoretical Physics, University of Innsbruck(因斯布鲁克大学理论物理研究所)

Philipp Aumann, Michael Fellner, David Alber, Max Cykiert, Christoph Fleckenstein, Roeland ter Hoeven, Leo Stenzel, Riccardo J. Valencia-Tortora, Wolfgang Lechner

AI总结:

本文通过量子硬件实现Parity架构,以量子傅里叶变换为基准,展示了在保真度和量子比特数量上的新纪录,速度提升超越指数级。

摘要:

我们展示了在量子硬件上实现Parity架构,使用量子傅里叶变换(QFT)作为基准。结果表明,使用具有原生CZ指令集的量子处理器,在N=50个量子比特时,QFT算法的进程保真度达到F≈10^{-2}。与之前基于交换的 方法相比,加速的缩放是超指数级的O(exp(N^2))。此外,我们还展示通过在指令集中加入iSWAP门可以进一步改进缩放。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑