Optimal Compilation Strategies for QFT Circuits in Neutral-Atom Quantum Computing

TL;DR

This paper develops optimal compilation strategies for Quantum Fourier Transform circuits in neutral-atom quantum computers, minimizing atom movements and improving efficiency while maintaining high fidelity.

Contribution

It introduces novel compilation methods tailored for NAQC systems that achieve theoretical lower bounds in atom movements and outperform existing compilers.

Findings

Achieves minimal atom movements in QFT circuit compilation.

Outperforms state-of-the-art compilers in efficiency.

Provides benchmarks for NAQC compiler performance.

Abstract

Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities, making it a promising platform for scalable quantum computing. Despite these strengths, efficiently implementing quantum circuits like the Quantum Fourier Transform (QFT) remains a significant challenge due to atom movement overheads and connectivity constraints. This paper introduces optimal compilation strategies tailored to QFT circuits and NAQC systems, addressing these challenges for both linear and grid-like architectures. By minimizing atom movements, the proposed methods achieve theoretical lower bounds in atom movements while preserving high circuit fidelity. Comparative evaluations against state-of-the-art compilers demonstrate the superior performance of the proposed methods. These methods could serve as benchmarks for evaluating the performance of NAQC compilers.