Pith. sign in

REVIEW 2 major objections 4 minor 31 references

Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers

T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read State preparation on zoned neutral atom machines can be compiled to minimal schedules with a satisfiability solver, and shielding idle qubits raises fidelity.

desk verdict Useful SMT scheduling encoder for zoned neutral atom state preparation, but the headline fidelity advantage rests on a shuttling-fidelity assumption the paper does not stress-test. read the letter →

arxiv 2411.09738 v2 pith:EH3DCJPZ submitted 2024-11-14 quant-ph cs.ET

Yannick Stade , Ludwig Schmid , Lukas Burgholzer , Robert Wille This is my paper · ORCID
classification quant-phcs.ET
keywords quantumerrorcorrectionstatepreparationneutralatomarchitectureszonedsatisfiabilitymodulotheoriesscheduleoptimizationlogicalarrayscompilation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper addresses how to turn a state-preparation circuit for a quantum error-correcting code into a minimal schedule of Rydberg beams, trap transfers, and shuttles on a zoned neutral atom machine. The authors propose a satisfiability modulo theories formulation whose satisfying assignments are physically valid schedules and whose objective minimizes the number of stages. They report that schedules that move idle qubits into storage zones during entangling pulses achieve higher approximated success probabilities than schedules that leave all qubits in the entangling zone. If correct, this gives quantum error correction a reusable compilation primitive and a way to compare hardware layouts before building them.

What carries the argument

The load-bearing object is a symbolic stage-based schedule model. Time is divided into discrete stages; each stage is either an execution stage (a global Rydberg beam followed by shuttling of movable AOD traps) or a transfer stage (load and store operations between static SLM traps and movable AOD traps followed by shuttling). Boolean and integer variables encode qubit positions, AOD rows and columns, and gate assignment, while constraints enforce physical feasibility: one qubit per trap, ordered AOD lines, shielding of idle qubits outside the entangling zone, and no trap transfers during execution stages. Minimizing the total number of stages under these constraints produces the schedule with the fewest error-prone Rydberg and transfer operations.

What would settle it

Run the same schedules on hardware with measured per-micron shuttling and atom-loss rates and recompute the success probability with those rates included; if the no-shielding baseline wins on any of the six codes, the claim that shielding consistently improves fidelity is refuted.

Watch

Extended reading notes

Core claim

The central claim is that optimal state preparation for logical arrays on zoned neutral atom architectures can be generated with an SMT-based compiler, and that the optimal schedules consistently use storage zones to shield idle qubits. For all six tested QEC codes, every schedule produced for a layout with a storage zone has a higher approximated success probability than the no-shielding baseline, even after counting the added shuttling and transfer stages. The paper therefore positions itself as providing the first optimal state-preparation compiler for this architecture and as demonstrating quantitatively that zoned shielding is not just a hardware feature but a fidelity benefit.

Load-bearing premise

The fidelity comparison treats shuttling as error-free and counts only idle decoherence and gate fidelities, so if real atom shuttling has non-negligible error or loss, the measured advantage of shielding could shrink or disappear.

Editorial extensions

If this is right

  • For the smallest tested codes, the solver terminates in under a second, so optimal schedules can be precomputed once and reused as fixed building blocks.
  • Zone-shielded schedules use more transfer stages, yet their approximated success probability is higher than exposing idle qubits to Rydberg pulses.
  • A double-sided storage layout gives slightly higher approximated success probability than a single bottom storage zone because shuttle distances and transfer counts are smaller.
  • Zone-unaware compilers can at best match, never beat, the no-shielding baseline, because their schedules are a subset of the shielded search space.
  • The method also serves as a hardware-design probe: changing the number and placement of storage zones yields quantitative fidelity comparisons before a device is built.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If real per-micron shuttling error or atom loss is measured, the crossover at which shielding stops improving fidelity can be computed and used as a concrete hardware target.
  • The same encoding applies to any fixed list of CZ gates, so syndrome extraction or logical gate layers are plausible next targets beyond state preparation.
  • Because schedules are generated offline, even multi-day solver runs become acceptable for reusable building blocks, decoupling compilation cost from runtime speed.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper presents an SMT-based compilation method for state preparation circuits of quantum error correction codes on zoned neutral atom architectures. The formulation symbolically represents qubit positions, AOD/SLM trap assignments, gate execution, trap transfers, shuttling, and zone shielding, and uses an objective that minimizes the total number of stages. The evaluation compares three layouts — no shielding, bottom storage, and double-sided storage — across six QEC codes, using an approximated success probability (ASP) as a fidelity proxy. The authors report that zoned layouts consistently yield higher ASP than the no-shielding baseline, and the implementation is released as open source in the Munich Quantum Toolkit.

Significance. The paper addresses a timely and practical compilation problem: preparing logical arrays on zoned neutral atom hardware, for which existing neutral-atom compilers lack zone support. Its main strengths are the explicit, verifiable SMT constraint system; the public open-source implementation; and the demonstration that small instances can be solved to proven optimality in stage count. If the fidelity conclusions hold, the work provides useful building blocks for future fault-tolerant neutral atom systems and a tool for exploring architectural design choices. However, the central empirical claim — that zone shielding consistently improves fidelity — is currently supported only under a specific, partially unverified error model, so the significance of the result is conditional on that model.

major comments (2)
  1. [Section V-A, ASP formula and Table I] The comparison that underlies the abstract and Section V-C assigns a fidelity of 1.0 to shuttling, while Load/Store is assigned 0.999. Zone-shielded schedules in columns (2) and (3) contain additional shuttling and transfer operations that the no-shielding baseline does not, so the reported ASP gains of roughly 0.01–0.03 in Fig. 4 are computed without any per-move transport error. If a single shuttled atom has an infidelity or loss probability as small as 0.001, a schedule with about ten per-qubit movements contributes a factor near 0.99, which is comparable to the entire reported improvement. The manuscript supplies no sensitivity analysis over the shuttling fidelity and no experimental or cited evidence that unit shuttling fidelity is realistic for the considered AOD transport. Since the conclusion that shielding 'consistently results in higher fidelities' rests on this assumption, the authors should either justify the unit-fidelity assignment with direct evidence or add a sensitivity analysis over p_shuttle and qualify the claim accordingly.
  2. [Section IV-C and Section V-B] The objective function minimizes the total number of stages S, not the ASP or any direct fidelity estimate. For each minimal S, the SMT solver returns an arbitrary satisfying assignment; the ASP values reported in Table I are therefore not guaranteed to be optimal among all schedules with that minimal stage count. Since ASP depends on the specific distribution of transfers, shuttling distances, and idle times, a different minimal-stage schedule could yield a different ASP. This does not invalidate the tool, but it means the title's 'optimal state preparation' and the discussion in Section V-C should be stated as optimal in stage count only, and the comparison in Table I should be described as a comparison of particular schedules, not necessarily ASP-optimal ones. The authors should clarify this limitation and, ideally, add an ASP-aware tie-breaking or post-processing step.
minor comments (4)
  1. [Section V-A, ASP definition] The definition of t_idle as 'the accumulated idle time of all qubits' is ambiguous: it is not clear whether this is a sum over qubits, a maximum, or a wall-clock quantity, nor how shuttling time enters it. Since ASP is the primary comparison metric, the formula should specify the aggregation precisely to make the results reproducible.
  2. [Section V-B, Table I] For the larger codes (Hamming, Tetrahedral, Honeycomb), the Layout 2 and 3 entries are marked as 'may not be optimal due to solver timeout.' Section V-C should explicitly state that the 'consistently higher' claim for these cases is based on suboptimal zoned schedules, which still beat the optimal baseline; this is a meaningful observation but should not be conflated with an optimality statement.
  3. [Section IV-B, constraints C5 and C6] The vertical analog of the AOD ordering constraint and the loading-constraint analog of Eq. (20) are 'omitted for brevity.' Given that the paper's contribution is the verified constraint model, these omissions make it harder for readers to reproduce or audit the full SMT encoding. A short appendix or listing of the complete constraints would improve the paper.
  4. [Throughout] The notation for codes, e.g., 'J7, 1, 3K', is standard in some communities but may confuse readers; a one-line explanation that this denotes an [n, k, d] code would be helpful.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: the SMT schedule generation, the ASP evaluation using external hardware figures of merit, and the benchmark circuits from STABGRAPH are independent inputs; the Shuttling-fidelity assumption is a hardware premise, not an equation-level circularity.

full rationale

The paper's derivation chain is self-contained: state-preparation circuits are generated externally via STABGRAPH from stabilizers of known QEC codes; schedules are produced by an SMT model whose constraints are stated explicitly in Eqs. (1)-(21); optimality is defined as minimizing the number of stages S; and the resulting schedules are evaluated using the ASP formula with hardware figures of merit cited to external experimental work ([9], [18], [20]). No fitted parameter is renamed as a prediction: the solver outputs a schedule, and the ASP is computed afterwards from that schedule and from fixed, external hardware numbers. The only same-group citations are [17] for the ASP proxy and [22] for the abstract zoned-architecture model and AOD constraints; both are published prior work with explicit definitions, and neither is invoked as an unverified premise that forces the paper's conclusion. The concern that 'Shuttling 1.0' is optimistic is a correctness/robustness limitation, not circularity, because that value is an input assumption taken from the experimental literature rather than a consequence of the optimization. Similarly, the flagged non-optimal results due to solver timeouts weaken the optimality claim for larger codes but do not make the derivation circular. Overall, no step in the claimed derivation reduces, by construction or by self-citation, to its own input.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

The work introduces no fitted physical constants; it optimizes an SMT model against externally given hardware parameters. The ledger above lists the manually chosen or literature-sourced values that the evaluation depends on. The most consequential is the unit shuttling fidelity, because zone-based layouts trade Rydberg exposure for extra shuttling and transfers. The canonical circuit structure for stabilizer state preparation and the discretized trap model are inherited from prior work and treated as domain assumptions.

free parameters (3)
  • Shuttling fidelity = 1.0
    Assumed zero-error shuttling in the ASP model (Section V-A); central to whether shielding wins.
  • T_eff (idle decoherence time) = 1 s
    Taken from [9]; scales the idle time penalty in ASP; no sensitivity analysis is provided.
  • Interaction adjacency radius r = 2
    Chosen in Section V-A to allow directly and diagonally adjacent qubits to interact in one Rydberg beam; affects which CZ gates can be executed in parallel.
assumptions (5)
  • domain assumption State preparation circuits for stabilizer codes have the canonical form: all qubits in |+>, then CZ gates forming a graph state, then Hadamards on selected qubits.
    Invoked in Section III to reduce the problem to scheduling a set of CZ gates; relies on [31].
  • domain assumption The zoned neutral atom architecture can be discretized into stages and finite trap sites with the stated AOD and SLM rules.
    Foundation of the symbolic model in Section IV-A, inspired by [24].
  • domain assumption Approximated Success Probability (ASP) with the listed fidelities and durations is a valid proxy for physical fidelity.
    Used in Section V as the primary comparison metric; parameters taken from [9] and [20].
  • ad hoc to paper Shuttling operations have unit fidelity and the only cost is duration entering t_idle.
    The figure-of-merit table in Section V-A sets shuttling fidelity to 1.0; not supported by an error model and load-bearing for the zone-shielding conclusion.
  • ad hoc to paper Minimizing the number of stages S is a valid surrogate for maximizing fidelity and minimizing execution time.
    Objective function in Section IV-C; stage count treats 0.27 us Rydberg beams and 200 us transfer stages equally, which is not obviously fidelity-optimal.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers." pith.science (2026). https://pith.science/paper/EH3DCJPZ

@misc{pith2026241109738,
  author       = {Pith},
  title        = {Pith review of: Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EH3DCJPZ}},
  note         = {Machine review of arXiv:2411.09738}
}
read the original abstract

Quantum computing promises to solve problems previously deemed infeasible. However, high error rates necessitate quantum error correction for practical applications. Seminal experiments with zoned neutral atom architectures have shown remarkable potential for fault-tolerant quantum computing. To fully harness their potential, efficient software solutions are vital. A key aspect of quantum error correction is the initialization of physical qubits representing a logical qubit in a highly entangled state. This process, known as state preparation, is the foundation of most quantum error correction codes and, hence, a crucial step towards fault-tolerant quantum computing. Generating a schedule of target-specific instructions to perform the state preparation is highly complex. First software tools exist but are not suitable for the zoned neutral atom architectures. This work addresses this gap by leveraging the computational power of SMT solvers and generating minimal schedules for the state preparation of logical arrays. Experimental evaluations demonstrate that actively utilizing zones to shield idling qubits consistently results in higher fidelities than solutions disregarding these zones. The complete code is publicly available in open-source as part of the Munich Quantum Toolkit (MQT) at https://github.com/cda-tum/mqt-qmap/tree/main/src/na/nasp.

Figures

Figures reproduced from arXiv: 2411.09738 by the authors.

Figure 1
Figure 1. The visualization of the stabilizers of the Steane code (Fig. 1a) and a quantum circuit preparing the logical [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. The first three steps of a schedule executing the same circuit as in Fig. 1b on a zoned neutral atom architecture. Throughout the two Rydberg beams [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Schematic zoned neutral atom architecture with one storage zone [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Differences in the ASP for different codes and layouts. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 20 canonical work pages

  1. [1]

    Quantum Computing in the NISQ era and beyond,

    John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum, 2018

    work page 2018

  2. [2]

    Roads towards fault-tolerant universal quantum computation,

    Earl T. Campbell, Barbara M. Terhal, and Christophe Vuillot, “Roads towards fault-tolerant universal quantum computation,” Nature, 2017

    work page 2017

  3. [3]

    Fault-tolerant quantum computation,

    P.W. Shor, “Fault-tolerant quantum computation,” in Conference on Foundations of Computer Science , 1996

    work page 1996

  4. [4]

    arXiv: quant-ph/9705052

    Daniel Gottesman, Stabilizer Codes and Quantum Error Correction, 1997. arXiv: quant-ph/9705052

    arXiv 1997

  5. [5]

    Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes,

    Héctor Bombín, “Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes,” New Journal of Physics , 2015

    work page 2015

  6. [6]

    Steane, Fast fault-tolerant filtering of quantum codewords, 2004

    Andrew M. Steane, Fast fault-tolerant filtering of quantum codewords, 2004. arXiv: quant-ph/0202036

    arXiv 2004

  7. [7]

    arXiv: 2402.17761

    Remmy Zen et al., Quantum Circuit Discovery for Fault- Tolerant Logical State Preparation with Reinforcement Learning, 2024. arXiv: 2402.17761

    arXiv 2024

  8. [8]

    Manetsch et al., A tweezer array with 6100 highly coherent atomic qubits , 2024

    Hannah J. Manetsch et al., A tweezer array with 6100 highly coherent atomic qubits , 2024. arXiv: 2403.12021

    arXiv 2024

Show all 31 references
  1. [9]

    Logical quantum processor based on reconfigurable atom arrays,

    Dolev Bluvstein et al., “Logical quantum processor based on reconfigurable atom arrays,” Nature, 2023

    2023

  2. [10]

    Z3: An Efficient SMT Solver,

    Leonardo De Moura and Nikolaj Bjørner, “Z3: An Efficient SMT Solver,” in Tools and Algorithms for the Construction and Analysis of Systems , Springer Berlin Heidelberg, 2008

    2008

  3. [11]

    The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing,

    Robert Wille et al., “The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing,” in Int’l Conf. on Quantum Software , 2024. arXiv: 2405.17543, A live version of this document is available at https://mqt.readthedocs.io

    2024 arXiv

  4. [12]

    Quantum error correction: An introduc- tory guide,

    Joschka Roffe, “Quantum error correction: An introduc- tory guide,” Contemporary Physics, 2019

    2019

  5. [13]

    arXiv: 2408.11894

    Tom Peham, Ludwig Schmid, Lucas Berent, Markus Müller, and Robert Wille, Automated synthesis of fault- tolerant state preparation circuits for quantum error correction codes, 2024. arXiv: 2408.11894

    2024 arXiv

  6. [14]

    Quantum computing with neutral atoms,

    Mark Saffman, “Quantum computing with neutral atoms,” National Science Review , 2019

    2019

  7. [15]

    Quantum computing with neutral atoms,

    Loïc Henriet et al. , “Quantum computing with neutral atoms,” Quantum, 2020

    2020

  8. [16]

    Neutral atom quantum com- puting hardware: Performance and end-user perspective,

    Karen Wintersperger et al., “Neutral atom quantum com- puting hardware: Performance and end-user perspective,” EPJ Quantum Technology, 2023

    2023

  9. [17]

    Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts,

    Ludwig Schmid et al. , “Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts,” Quantum Science and Technology , 2024

    2024

  10. [18]

    A quantum processor based on coherent transport of entangled atom arrays,

    Dolev Bluvstein et al., “A quantum processor based on coherent transport of entangled atom arrays,” Nature, 2022

    2022

  11. [19]

    An atom-by- atom assembler of defect-free arbitrary two-dimensional atomic arrays,

    Daniel Barredo, Sylvain de Léséleuc, Vincent Lienhard, Thierry Lahaye, and Antoine Browaeys, “An atom-by- atom assembler of defect-free arbitrary two-dimensional atomic arrays,” Science, 2016

    2016

  12. [20]

    High-fidelity parallel entangling gates on a neutral-atom quantum computer,

    Simon J. Evered et al., “High-fidelity parallel entangling gates on a neutral-atom quantum computer,” Nature, 2023

    2023

  13. [21]

    Two-dimensional transport and transfer of a single atomic qubit in optical tweezers,

    Jérôme Beugnon et al., “Two-dimensional transport and transfer of a single atomic qubit in optical tweezers,” Nature Physics, 2007

    2007

  14. [22]

    An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures,

    Yannick Stade, Ludwig Schmid, Lukas Burgholzer, and Robert Wille, “An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures,” in Int’l Conf. on Quantum Computing and Engineering, 2024. arXiv: 2405.08068

    2024 arXiv

  15. [23]

    Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms,

    Sebastian Brandhofer, Ilia Polian, and Hans Peter Büchler, “Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms,” in Int’l Conf. on CAD , 2021

    2021

  16. [24]

    Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors,

    Daniel Bochen Tan, Dolev Bluvstein, Mikhail D. Lukin, and Jason Cong, “Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors,” Quantum, 2024

    2024

  17. [25]

    arXiv: 2405.15095

    Daniel Bochen Tan, Wan-Hsuan Lin, and Jason Cong, Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Schedul- ing, 2024. arXiv: 2405.15095

    2024 arXiv

  18. [26]

    Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures,

    Jonathan M. Baker et al. , “Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures,” in Int’l Symposium on Computer Architecture, 2021

    2021

  19. [27]

    Atomique: A quantum compiler for reconfigurable neutral atom arrays,

    Hanrui Wang et al., “Atomique: A quantum compiler for reconfigurable neutral atom arrays,” in Int’l Symposium on Computer Architecture, 2024. arXiv: 2311.15123

    2024 arXiv

  20. [28]

    Hybrid Circuit Mapping: Leveraging the Full Spectrum of Computational Capabilities of Neutral Atom Quantum Computers,

    Ludwig Schmid, Sunghye Park, Seokhyeong Kang, and Robert Wille, “Hybrid Circuit Mapping: Leveraging the Full Spectrum of Computational Capabilities of Neutral Atom Quantum Computers,” in Design Automation Conf.,

  21. [29]

    , Decomposing and Routing Quantum Circuits Under Constraints for Neutral Atom Architectures, 2023

    Natalia Nottingham et al. , Decomposing and Routing Quantum Circuits Under Constraints for Neutral Atom Architectures, 2023. arXiv: 2307.14996

    2023 arXiv

  22. [30]

    arXiv: 2405.06183

    Ethan Decker, Arctic: A Field Programmable Quantum Array Scheduling Technique, 2024. arXiv: 2405.06183

    2024 arXiv

  23. [31]

    Scalable characterization of localizable entanglement in noisy topological quantum codes,

    David Amaro, Markus Müller, and Amit Kumar Pal, “Scalable characterization of localizable entanglement in noisy topological quantum codes,” New J. Phys. , 2020

    2020

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.