Optimal compilation strategies for QFT circuits in neutral-atom quantum computing.

Gao, D; Li, Y; Ying, S; Li, S

Optimal compilation strategies for QFT circuits in neutral-atom quantum computing.

Gao, D Li, Y Ying, S Li, S

Permalink

Publisher:: Springer Nature
Publication Type:: Journal Article
Citation:: Sci Rep, 2025, 16, (1), pp. 2719
Issue Date:: 2025-12-25

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (3.42 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Gao, D
dc.contributor.author	Li, Y
dc.contributor.author	Ying, S
dc.contributor.author	Li, S https://orcid.org/0000-0002-3332-2546
dc.date.accessioned	2026-01-30T02:33:39Z
dc.date.available	2025-12-10
dc.date.available	2026-01-30T02:33:39Z
dc.date.issued	2025-12-25
dc.identifier.citation	Sci Rep, 2025, 16, (1), pp. 2719
dc.identifier.issn	2045-2322
dc.identifier.issn	2045-2322
dc.identifier.uri	http://hdl.handle.net/10453/192615
dc.description.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. Among existing implementations, the Dynamically Field-Programmable Qubit Array (DPQA) architecture has emerged as the most prominent NAQC platform, enabling large-scale, high-fidelity operations through dynamic atom rearrangement and global Rydberg excitation. 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 on the DPQA architecture, addressing these challenges for both linear and grid-like configurations. By minimizing atom movements, the proposed methods achieve theoretical lower bounds in movement counts while preserving high circuit fidelity. Comparative evaluations against state-of-the-art DPQA compilers demonstrate the superior performance of the proposed methods, which could serve as benchmarks for evaluating the performance of future DPQA compilers.
dc.format	Print-Electronic
dc.language	eng
dc.publisher	Springer Nature
dc.relation.ispartof	Sci Rep
dc.relation.isbasedon	10.1038/s41598-025-32572-z
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Optimal compilation strategies for QFT circuits in neutral-atom quantum computing.
dc.type	Journal Article
utslib.citation.volume	16
utslib.location.activity	England
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/UTS Groups
pubs.organisational-group	University of Technology Sydney/UTS Groups/Centre for Quantum Software and Information (QSI)
utslib.copyright.status	open_access	*
dc.rights.license	This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0). To view a copy of this license, visit https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.date.updated	2026-01-30T02:33:38Z
pubs.issue	1
pubs.publication-status	Published online
pubs.volume	16
utslib.citation.issue	1

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. Among existing implementations, the Dynamically Field-Programmable Qubit Array (DPQA) architecture has emerged as the most prominent NAQC platform, enabling large-scale, high-fidelity operations through dynamic atom rearrangement and global Rydberg excitation. 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 on the DPQA architecture, addressing these challenges for both linear and grid-like configurations. By minimizing atom movements, the proposed methods achieve theoretical lower bounds in movement counts while preserving high circuit fidelity. Comparative evaluations against state-of-the-art DPQA compilers demonstrate the superior performance of the proposed methods, which could serve as benchmarks for evaluating the performance of future DPQA compilers.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/192615