Pith. sign in

REVIEW 2 cited by

PowerMove: Optimizing Compilation for Neutral Atom Quantum Computers with Zoned Architecture

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.12263 v1 pith:57472KJF submitted 2024-11-19 quant-ph

classification quant-ph
keywords qubitmovementpowermovequantumarchitecturecompilationcompilercomputers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neutral atom-based quantum computers (NAQCs) have recently emerged as promising candidates for scalable quantum computing, largely due to their advanced hardware capabilities, particularly qubit movement and the zoned architecture (ZA). However, fully leveraging these features poses significant compiler challenges, as it requires addressing complexities across gate scheduling, qubit allocation, qubit movement, and inter-zone communication. In this paper, we present PowerMove, an efficient compiler for NAQCs that enhances the qubit movement framework while fully integrating the advantages of ZA. By recognizing and leveraging the interdependencies between these key aspects, PowerMove unlocks new optimization opportunities, significantly enhancing both scalability and fidelity. Our evaluation demonstrates an improvement in fidelity by several orders of magnitude compared to the state-of-the-art methods, with execution time improved by up to 3.46x and compilation time reduced by up to 213.5x. We will open-source our code later to foster further research and collaboration within the community.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum circuits as a game: A reinforcement learning agent for quantum compilation and its application to reconfigurable neutral atom arrays

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A transformer-based reinforcement learning agent learns to reconfigure atoms in neutral atom arrays and reduces estimated logarithmic infidelity by up to about 20% on benchmark circuits, including unseen ones.

  2. Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems

    quant-ph 2025-05 conditional novelty 4.0 of 10

    A cross-architectural survey that categorizes qubit mapping and routing compilers for superconducting, trapped-ion, and neutral atom quantum hardware.

Pith tools