pith. sign in

arxiv: 2607.01787 · v1 · pith:CMMO5GAZnew · submitted 2026-07-02 · 🪐 quant-ph

Structure-Aware Compilation for Scalable Neutral-Atom Quantum Computing

Dekuan Dong , Fengyu Zou , Hengzhun Chen , Guorui Zhu , Yingzhou Li This is my paper

Pith reviewed 2026-07-03 12:37 UTC · model grok-4.3

classification 🪐 quant-ph
keywords neutral-atom quantum computingquantum compilationaddressing layersatom transportcontrolled-Z gatesQAOAMaxCut
0
0 comments X

The pith

Neutral-atom quantum compilers can halve addressing layers and cut transport operations in half by exploiting algebraic decompositions and graph models.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that quantum gate compilation on neutral-atom arrays can exploit matrix-level algebraic structures for single-qubit gates to achieve rank-one decompositions that cut addressing layers in half compared to naive row- or column-wise methods. For controlled-Z gates, graph-theoretic models convert transport scheduling into tractable problems that reduce the number of atom transport operations by about 50 percent. These same methods applied to QAOA circuits for MaxCut achieve more than 30 percent average reduction in transport cost. A sympathetic reader would care because neutral-atom platforms face severe overhead from addressing and movement, and converting those limits into standard algebraic and coloring tasks makes larger computations feasible under realistic hardware rules.

Core claim

The central claim is that the physical constraints of neutral-atom hardware, specifically addressing and transport, can be converted into algebraic decompositions and graph coloring problems, allowing provably efficient compilation that reduces addressing layers by up to a factor of two and transport operations by approximately 50 percent for C-Z gates, with over 30 percent savings on QAOA MaxCut circuits.

What carries the argument

Rank-one decompositions over algebraic structures for single-qubit gate families, combined with graph-theoretic models for transport scheduling of C-Z gates.

If this is right

  • Single-qubit gate families require up to half as many addressing layers as naive implementations.
  • C-Z gate scheduling requires approximately 50 percent fewer atom transport operations.
  • QAOA circuits for MaxCut incur more than 30 percent lower transport cost on average.
  • Hardware constraints of neutral-atom arrays become standard decomposition and coloring problems with performance guarantees.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The algebraic and graph approach could extend to other gate families or array geometries beyond those tested.
  • Lower transport overhead might allow neutral-atom devices to run larger problem instances before decoherence sets in.
  • The compilation methods might combine with error-correction protocols to produce further reductions in total overhead.

Load-bearing premise

The dominant hardware constraints of neutral-atom arrays can be faithfully captured by the chosen algebraic structures and graph models without unaccounted physical effects that would erase the reported gains.

What would settle it

A physical experiment on a neutral-atom array that implements the proposed compilation for a small set of single-qubit gates or C-Z gates and directly counts the number of addressing layers and atom transport operations to check whether they match the predicted reductions.

Figures

Figures reproduced from arXiv: 2607.01787 by Dekuan Dong, Fengyu Zou, Guorui Zhu, Hengzhun Chen, Yingzhou Li.

Figure 1
Figure 1. Figure 1: FIG. 1: Single-qubit gate addressing. Qubits (yellow [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: Transporting selected rows of qubits in two steps. [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: Illustration of qubit transport. In the origi [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: Encoding a set of C-Z gates into a binary matrix [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: Example graph and QAOA-MaxCut circuit for a single layer. [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: Randomly generated matrix patterns. [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7: Comparison between our compilation methods and the naïve methods for several single-qubit gate families. [PITH_FULL_IMAGE:figures/full_fig_p010_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8: Empirical verification of the [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9: Numerical results of C-Z gates compilation. [PITH_FULL_IMAGE:figures/full_fig_p010_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10: QAOA-MaxCut compilation performance [PITH_FULL_IMAGE:figures/full_fig_p011_10.png] view at source ↗
read the original abstract

We study the compilation of structured quantum gate families on two-dimensional neutral-atom arrays, aiming to reduce addressing and transport overhead under realistic hardware constraints. For single-qubit gates, we exploit the algebraic structures of gate families at the matrix level, enabling efficient rank-one decompositions over appropriate algebraic structures and thereby reducing the number of addressing layers. For controlled-Z (C-Z) gates, we formulate the transport scheduling problem using graph-theoretic models, leading to efficient compilation algorithms under realistic transport constraints. We provide provable performance guarantees for the proposed methods and validate them through extensive numerical experiments. Across representative single-qubit gate families, our methods reduce the number of addressing layers by up to a factor of two compared with na\"ive row- or column-wise implementations. For C-Z gates, our scheduling strategy reduces the required number of atom transport operations by approximately 50\%. When applied to QAOA circuits for MaxCut, the proposed framework reduces transport cost by more than 30\% on average. These results show that the physical constraints of neutral-atom hardware can be converted into algebraic and graph-theoretic structure, turning a hardware-level scheduling bottleneck into tractable decomposition and coloring problems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript develops structure-aware compilation methods for neutral-atom quantum processors on 2D arrays. Single-qubit gate families are compiled via algebraic rank-one decompositions that reduce addressing layers; C-Z gates are scheduled via graph-theoretic models that reduce atom transport operations. Provable performance guarantees are stated for both, and numerical experiments on representative gate families and QAOA MaxCut circuits report up to 2× fewer addressing layers, ~50% fewer transports for C-Z, and >30% average transport-cost reduction for QAOA.

Significance. If the algebraic and graph models faithfully capture the dominant hardware limits, the approach converts physical constraints into tractable decomposition and coloring problems, yielding concrete, provably bounded improvements in addressing and transport overhead. The explicit provision of performance guarantees and the conversion of hardware structure into algebraic/graph problems are strengths that could aid scalable neutral-atom compilation.

major comments (2)
  1. [Abstract and §5 (numerical experiments)] The central claims rest on the assumption that the chosen rank-one decompositions and graph models capture all dominant constraints without unaccounted physical effects (position-dependent Rabi inhomogeneity, transport-induced heating, residual Rydberg leakage). No section compares the modeled metrics against hardware data or provides an error analysis showing that these effects remain sub-dominant when the reported reductions are realized.
  2. [Abstract] The abstract asserts 'provable performance guarantees' and 'extensive numerical experiments,' yet the provided text supplies neither the derivations of the guarantees nor dataset descriptions, error bars, or baseline implementations against which the factor-of-two and 50% reductions are measured. This prevents verification that the numerical results support the stated claims.
minor comments (2)
  1. Notation for the algebraic structures used in the rank-one decompositions should be defined explicitly before the first use in the single-qubit section.
  2. Figure captions for the QAOA transport-cost plots should state the number of instances, graph sizes, and exact baseline (naïve row/column) implementation used for the >30% average reduction.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the constructive feedback. We address each major comment below, clarifying the scope of our work and indicating revisions where appropriate.

read point-by-point responses

  1. Referee: [Abstract and §5 (numerical experiments)] The central claims rest on the assumption that the chosen rank-one decompositions and graph models capture all dominant constraints without unaccounted physical effects (position-dependent Rabi inhomogeneity, transport-induced heating, residual Rydberg leakage). No section compares the modeled metrics against hardware data or provides an error analysis showing that these effects remain sub-dominant when the reported reductions are realized.

    Authors: We agree that the manuscript models addressing layers and atom transport as the primary overheads but does not provide hardware data comparisons or a quantitative error analysis for secondary effects such as Rabi inhomogeneity or transport-induced heating. These effects are hardware-specific and lie outside the algorithmic focus of the paper, which converts the dominant constraints into algebraic and graph problems with provable bounds. We will add a limitations paragraph in the discussion section that explicitly states the modeling assumptions and the regimes in which the reported reductions are expected to remain relevant. revision: partial

  2. Referee: [Abstract] The abstract asserts 'provable performance guarantees' and 'extensive numerical experiments,' yet the provided text supplies neither the derivations of the guarantees nor dataset descriptions, error bars, or baseline implementations against which the factor-of-two and 50% reductions are measured. This prevents verification that the numerical results support the stated claims.

    Authors: The performance guarantees are formally derived in Sections 3 (rank-one decompositions) and 4 (graph-theoretic scheduling), with proofs of the approximation ratios and layer bounds. Section 5 details the gate families, QAOA MaxCut instances, naive baselines, and average reductions. To address the concern, we will revise Section 5 to include explicit dataset sizes, error bars on reported averages, and pseudocode or references for the baseline implementations, along with cross-references from the abstract. revision: yes

standing simulated objections not resolved
  • Direct experimental validation against hardware data for secondary physical effects (Rabi inhomogeneity, transport heating, Rydberg leakage), as no such measurements were performed in this work.

Circularity Check

0 steps flagged

No circularity; derivation chain is self-contained

full rationale

The paper derives addressing-layer reductions from rank-one decompositions over algebraic structures for single-qubit gate families and transport reductions from graph-coloring/scheduling models for C-Z gates. These steps are presented as independent algorithmic constructions with provable guarantees measured against naive baselines inside the same models; no equation reduces to a fitted parameter renamed as prediction, no self-citation supplies a load-bearing uniqueness theorem, and no ansatz is smuggled via prior work. Numerical experiments validate the algorithms on the chosen abstractions rather than forcing the metrics by construction. This is the normal case of an independent modeling contribution.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no free parameters, axioms, or invented entities are identifiable from the provided text.

pith-pipeline@v0.9.1-grok · 5743 in / 1124 out tokens · 44623 ms · 2026-07-03T12:37:06.556545+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages · 2 internal anchors

  1. [1]

    Many 3 commonly used single-qubit gates, including the Pauli gates and the Hadamard gates, satisfy this property

    Self-inverse Gates We first consider the case G = {I, X }, where X is a self-inverse single-qubit gate, i.e., X 2 = I. Many 3 commonly used single-qubit gates, including the Pauli gates and the Hadamard gates, satisfy this property. In this setting, the group G is isomorphic to the finite field GF(2), and the optimization problem ( 1) reduces to min k s.t...

    work page

  2. [2]

    , vk} are linearly independent over GF(2)

    Apply a sequence of elementary row operations, represented by an invertible matrix Tr, to trans- form M into reduced row echelon form TrM = e1v⊤ 1 + e2v⊤ 2 + · · · + ekv⊤ k , where ei is the i-th column of the m × m identity matrix, {v1, . . . , vk} are linearly independent over GF(2)

    work page

  3. [3]

    Then M admits the decompo- sition M = u1v⊤ 1 + u2v⊤ 2 + · · · + ukv⊤ k

    Define ut = T −1 r et. Then M admits the decompo- sition M = u1v⊤ 1 + u2v⊤ 2 + · · · + ukv⊤ k . The GF(2)-rank of M thus characterizes the minimum number of addressing layers required to realize the target gate pattern under the row-column addressing constraint of the neutral-atom architecture. In contrast, a naïve implementation that applies gates sequen...

    work page

  4. [4]

    0 1 # + X2 ⊗

    Pauli Gates We now consider the Pauli group {±I, ±X, ±Y, ±Z, ±iI, ±iX, ±iY, ±iZ} . Since global phases are physically irrelevant, we restrict attention to the phase-free Pauli group G = {I, X, Y, Z }. The group operation, denoted by + and defined by Pauli multiplication modulo global phase, is summarized in the following table: + I X Y Z I I X Y Z X X I Z...

    work page

  5. [5]

    The group has order four and is isomorphic to the additive group modulo 4, Z4 = {0, 1, 2, 3}

    Phase Gates We next consider the cyclic group generated by the phase gate S = " 1 0 0 i # , namely G = {I, S, S 2, S3}. The group has order four and is isomorphic to the additive group modulo 4, Z4 = {0, 1, 2, 3}. Under this identification, the optimization problem ( 1) becomes min k s.t. M = kX t=1 utv⊤ t · Gt, Gt ∈ Z4, u t ∈ {0, 1}m, v t ∈ {0, 1}n, (2) ...

    work page

  6. [7]

    Compute the rank of M2/2 over GF(2) and obtain 1 2 M2 = k2X t=1 u(2) t v(2) t ⊤ , where u(2) t ∈ {0, 1}m, v (2) t ∈ {0, 1}n

    Define M2 = M − k1X t=1 u(1) t v(1) t ⊤ (mod4) , so that M2 ∈ { 0, 2}m×n. Compute the rank of M2/2 over GF(2) and obtain 1 2 M2 = k2X t=1 u(2) t v(2) t ⊤ , where u(2) t ∈ {0, 1}m, v (2) t ∈ {0, 1}n. Combining the two stages, we obtain a decomposition M = k1X t=1 u(1) t v(1) t ⊤ + k2X t=1 2u(2) t v(2) t ⊤ (mod4) , (3) which is valid under the constraints o...

    work page

  7. [8]

    Up to an irrelevant global phase, any single-qubit Clifford operator admits a decom- position of the form U = P HaSb where P ∈ {I, X, Y, Z }, a ∈ {0, 1}, and b ∈ {0, 1, 2, 3}

    Clifford Gates We now consider the single-qubit Clifford group gen- erated by {I, X, Y, Z, S, H}. Up to an irrelevant global phase, any single-qubit Clifford operator admits a decom- position of the form U = P HaSb where P ∈ {I, X, Y, Z }, a ∈ {0, 1}, and b ∈ {0, 1, 2, 3}. This factorization suggests a natural compilation strat- egy for Clifford gates on ...

    work page

  8. [9]

    Analogous to the phase-gate group, this group is cyclic of order eight and is isomorphic to the additive group modulo 8, Z8 = {0, 1, 2, 3, 4, 5, 6, 7}

    π/8 Gates In this subsection, we consider the group generated by the π 8 gate T = " 1 0 0 ei π 4 # . Analogous to the phase-gate group, this group is cyclic of order eight and is isomorphic to the additive group modulo 8, Z8 = {0, 1, 2, 3, 4, 5, 6, 7}. Under this identifi- cation, the compilation problem ( 1) reduces to min k s.t. M = kX t=1 utv⊤ t · Gt, ...

    work page

  9. [10]

    Compute its rank over GF(2) and obtain a rank-one decomposition M1 = k1X t=1 u(1) t v(1) t ⊤ , where u(1) t ∈ {0, 1}m, v (1) t ∈ {0, 1}n

    Let M1 = M mod 2 . Compute its rank over GF(2) and obtain a rank-one decomposition M1 = k1X t=1 u(1) t v(1) t ⊤ , where u(1) t ∈ {0, 1}m, v (1) t ∈ {0, 1}n

    work page

  10. [11]

    Apply the algorithm for compiling phase gates and obtain 1 2 M2 = k2X t=1 u(2) t v(2) t ⊤ · Gt, where Gt ∈ Z4, u (2) t ∈ {0, 1}m, v (2) t ∈ {0, 1}n

    Define M2 = M − k1X t=1 u(1) t v(1) t ⊤ (mod8) , so that M2 ∈ { 0, 2, 4, 6}m×n. Apply the algorithm for compiling phase gates and obtain 1 2 M2 = k2X t=1 u(2) t v(2) t ⊤ · Gt, where Gt ∈ Z4, u (2) t ∈ {0, 1}m, v (2) t ∈ {0, 1}n. Combining the two stages, we obtain a valid decomposi- tion M = k1X t=1 u(1) t v(1) t ⊤ + k2X t=1 (2Gt) u(2) t v(2) t ⊤ (mod8) ....

    work page

  11. [12]

    The compilation problem for column-aligned C-Z gates can be treated analogously

    Row/column-aligned C-Z Gates We consider the compilation problem for row-aligned C-Z gates, namely, implementing a set of C-Z gates in which each gate acts on a pair of qubits within the same row of the atom array, while minimizing the number of transport operations. The compilation problem for column-aligned C-Z gates can be treated analogously. We first...

    work page

  12. [13]

    Collect the indexes of all nonzero columns

    work page

  13. [14]

    Interpret these column indexes as open intervals and apply interval-graph coloring to obtain a valid grouping. For example, after removing all-zero columns, the matrix in Figure 4 can be grouped as follows: (0, 1) (1, 2) (0, 2) (0, 3) 0 1 1 0 0 1 1 0 1 0 2 0 1 0 1 Note that within each group, any collection of C-Z gates corresponding to a rank- 1 pattern ...

    work page

  14. [15]

    We first consider the case of two rows of qubits, each containing n qubits labeled 1, 2,

    Non-aligned C-Z Gates We consider the problem of implementing non-aligned C-Z gates, namely, C-Z gates acting on pairs of qubits located in different rows and columns of the atom ar- ray, with the goal of minimizing the number of transport operations. We first consider the case of two rows of qubits, each containing n qubits labeled 1, 2, . . . , n from l...

    work page

  15. [16]

    row by row

    General C-Z Gates Scheduling By combining the two cases discussed above, arbitrary C-Z gates on a neutral-atom array can be scheduled effi- ciently. First, all non-aligned C-Z gates are scheduled row pair by row pair using the method described in Section II B 2. During this process, some row- or column-aligned C-Z gates may also be executed without requiri...

    work page

  16. [17]

    J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Phys. Rev. A 76, 042319 (2007)

    work page 2007

  17. [18]

    Clarke and F

    J. Clarke and F. K. Wilhelm, Nature 453, 1031 (2008)

    work page 2008

  18. [19]

    Arute, K

    F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M. P. Harrigan, M. J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T. S...

    work page 2019

  19. [20]

    C. J. Ballance, T. P. Harty, N. M. Linke, M. A. Sepiol, and D. M. Lucas, Phys. Rev. Lett. 117, 060504 (2016)

    work page 2016

  20. [21]

    Mei, B.-W

    Q.-X. Mei, B.-W. Li, Y.-K. Wu, M.-L. Cai, Y. Wang, L. Yao, Z.-C. Zhou, and L.-M. Duan, Phys. Rev. Lett. 128, 160504 (2022)

    work page 2022

  21. [22]

    Cheng, C.-Y

    C.-Y. Cheng, C.-Y. Yang, Y.-H. Kuo, R.-C. Wang, H.- C. Cheng, and C.-Y. R. Huang, ACM Transactions on Quantum Computing 5, 10.1145/3680291 (2024)

    work page doi:10.1145/3680291 2024

  22. [23]

    H. Fu, M. Zhu, F. Chen, C. Zhang, J. Wu, W. Xie, and X.-Y. Li, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 44, 1774 (2025)

    work page 2025

  23. [24]

    Kusyk, S

    J. Kusyk, S. M. Saeed, and M. U. Uyar, IEEE Transac- tions on Quantum Engineering 2, 1 (2021)

    work page 2021

  24. [25]

    Murali, D

    P. Murali, D. M. Debroy, K. R. Brown, and M. Martonosi, in 2020 ACM/IEEE 47th Annual Inter- national Symposium on Computer Architecture (ISCA) (2020) pp. 529–542

    work page 2020

  25. [26]

    B. Bach, I. Safro, and E. Younis, Efficient compilation for shuttling trapped-ion machines via the position graph ar- chitectural abstraction (2025), arXiv:2501.12470 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  26. [27]

    Beugnon, C

    J. Beugnon, C. Tuchendler, H. Marion, A. Gaëtan, Y. Miroshnychenko, Y. R. P. Sortais, A. M. Lance, M. P. A. Jones, G. Messin, A. Browaeys, and P. Grang- ier, Nature Physics 3, 696 (2007)

    work page 2007

  27. [28]

    Schlosser, S

    M. Schlosser, S. Tichelmann, J. Kruse, and G. Birkl, Quantum Information Processing 10, 907 (2011)

    work page 2011

  28. [29]

    Levine, A

    H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić, H. Pichler, and M. D. Lukin, Phys. Rev. Lett. 123, 170503 (2019)

    work page 2019

  29. [30]

    S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, Nature 622, 268 (2023)

    work page 2023

  30. [31]

    Bluvstein, A

    D. Bluvstein, A. A. Geim, S. H. Li, S. J. Evered, J. P. Bonilla Ataides, G. Baranes, A. Gu, T. Manovitz, M. Xu, M. Kalinowski, S. Majidy, C. Kokail, N. Maskara, E. C. Trapp, L. M. Stewart, S. Hollerith, H. Zhou, M. J. Gul- lans, S. F. Yelin, M. Greiner, V. Vuletić, M. Cain, and M. D. Lukin, Nature 649, 39–46 (2025)

    work page 2025

  31. [32]

    Håstad, in International colloquium on automata, lan- guages, and programming (Springer, 1989) pp

    J. Håstad, in International colloquium on automata, lan- guages, and programming (Springer, 1989) pp. 451–460

    work page 1989

  32. [33]

    Ja’Ja’, in Proceedings of the tenth annual ACM sym- posium on Theory of computing (1978) pp

    J. Ja’Ja’, in Proceedings of the tenth annual ACM sym- posium on Theory of computing (1978) pp. 173–183

    work page 1978

  33. [34]

    X. Song, B. Zheng, and R. Huang, SIAM Journal on Ma- trix Analysis and Applications 43, 867 (2022)

    work page 2022

  34. [35]

    X. Song, B. Zheng, and R. Huang, The Electronic Journal of Linear Algebra 41, 353 (2025)

    work page 2025

  35. [36]

    C. Zhu, X. Wu, Z. Yang, J. Wang, A. Wu, S. Zheng, and X. Wang, Quantum compiler design for qubit mapping and routing: A cross-architectural survey of supercon- ducting, trapped-ion, and neutral atom systems (2025), arXiv:2505.16891 [quant-ph]

    work page arXiv 2025

  36. [37]

    M. C. Golumbic, Algorithmic graph theory and perfect graphs, Vol. 57 (Elsevier, 2004)

    work page 2004

  37. [38]

    Practical Insights into Fair Comparison and Evaluation Frame for Neutral-Atom Compilers

    E. Khusainov, Y. Chen, J. Winklmann, H. Seidl, and C. B. Mendl, Practical insights into fair comparison and evaluation frame for neutral-atom compilers (2026), arXiv:2604.25478 [cs.ET]

    work page internal anchor Pith review Pith/arXiv arXiv 2026