NAKO: A Benchmarking Framework for Evaluating and Diagnosing Neutral-Atom Quantum Compilers
Abstract
Reconfigurable neutral-atom processors couple gate scheduling, atom placement, and parallel atom transport, so compiler decisions jointly determine physical execution costs. Evaluating these compilers requires attainable resource references and a way to trace excess costs to their causes. We present NAKO, a benchmarking framework that parameterizes circuits by qubit count, logical depth, and requested one- and two-qubit gate densities, and assigns attainable targets for Rydberg stages, routing intervals, and movement layers. Each benchmark is paired with an executable reference schedule; under the stated execution model, construction guarantees minimum Rydberg-stage and routing-interval counts, and minimum movement among schedules with the minimum Rydberg-stage count. Comparing compiler outputs with these references quantifies resource gaps, while reference mappings and intermediate physical states enable controlled interventions that trace excess costs to specific compiler decisions. In a 648-run evaluation of Enola and OLSQ-DPQA, NAKO identifies distinct bottlenecks. For Enola, placement scoring and cross-stage layout management contribute to excess movement; diagnosis-guided interventions reduce mean movement by 78.9% across five matched circuits. For OLSQ-DPQA, premature candidate selection and limited exploration of preparatory states produce avoidable entangling stages and routing intervals; four fixed-checkpoint continuations each eliminate one Rydberg stage and one routing interval without increasing movement. NAKO thus links resource targets backed by constructive optimality guarantees to controlled diagnosis and validation of compiler-specific resource savings.
Related
- Benchmarking dynamical-structure-factor protocols in programmable neutral-atom geometries
- From QCCD Trapped-Ion Hardware to Quantum Compilers: Capabilities, Architectures, and Compilation
- Fast Random Compilers for Time-Dependent and Time-Independent Lindbladian Simulation
- Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures
- QBugLM: An Agentic Benchmarking Framework for LLM-based Quantum Software Debugging
BibTeX
@misc{sun2026nako,
title = {{NAKO: A Benchmarking Framework for Evaluating and Diagnosing Neutral-Atom Quantum Compilers}},
author = {Wenjie Sun and Zhigang Wang and Xiaoyu Li and Desheng Zheng and Lianhui Yu and Geng Chen and Guowu Yang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39296},
eprint = {2610.39296},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39296},
}
RIS
TY - UNPB
TI - NAKO: A Benchmarking Framework for Evaluating and Diagnosing Neutral-Atom Quantum Compilers
AU - Wenjie Sun
AU - Zhigang Wang
AU - Xiaoyu Li
AU - Desheng Zheng
AU - Lianhui Yu
AU - Geng Chen
AU - Guowu Yang
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39296
UR - https://arxiv.org/abs/2610.39296
AB - Reconfigurable neutral-atom processors couple gate scheduling, atom placement, and parallel atom transport, so compiler decisions jointly determine physical execution costs. Evaluating these compilers requires attainable resource references and a way to trace excess costs to their causes. We present NAKO, a benchmarking framework that parameterizes circuits by qubit count, logical depth, and requested one- and two-qubit gate densities, and assigns attainable targets for Rydberg stages, routing intervals, and movement layers. Each benchmark is paired with an executable reference schedule; under the stated execution model, construction guarantees minimum Rydberg-stage and routing-interval counts, and minimum movement among schedules with the minimum Rydberg-stage count. Comparing compiler outputs with these references quantifies resource gaps, while reference mappings and intermediate physical states enable controlled interventions that trace excess costs to specific compiler decisions. In a 648-run evaluation of Enola and OLSQ-DPQA, NAKO identifies distinct bottlenecks. For Enola, placement scoring and cross-stage layout management contribute to excess movement; diagnosis-guided interventions reduce mean movement by 78.9% across five matched circuits. For OLSQ-DPQA, premature candidate selection and limited exploration of preparatory states produce avoidable entangling stages and routing intervals; four fixed-checkpoint continuations each eliminate one Rydberg stage and one routing interval without increasing movement. NAKO thus links resource targets backed by constructive optimality guarantees to controlled diagnosis and validation of compiler-specific resource savings.
ER -