Pith. sign in

REVIEW 2 major objections 6 minor 36 references

Universal quantum ecosystems' device models, shaped by superconducting hardware, cannot represent neutral atoms' dynamic rearrangement and zoned operations; a generalized device model closes the gap and improves routing fidelity by up to 10

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-01 09:48 UTC pith:NJFZD4MS

load-bearing objection A well-motivated QDMI extension for neutral-atom features that fills a real gap, but the headline fidelity gain is confounded by comparing different compilers, not just different device models. the 2 major comments →

arxiv 2607.20616 v1 pith:NJFZD4MS submitted 2026-07-22 quant-ph cs.ET

Enabling Neutral Atom Integration: Redesigning Device Models for Universal Quantum Ecosystems

Yannick Stade , Lukas Burgholzer , Ludwig Schmid , Robert Wille This is my paper
classification quant-ph cs.ET
keywords neutral atom quantum computingdevice modelqubit routingatom shuttlingzoned operationsquantum compilerhardware abstractionfidelity improvement
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper tries to establish that the device models used by universal quantum ecosystems—the standardized descriptions of a device's qubits, gates, and connectivity that compilers read—are too narrow for neutral-atom hardware. Because those models were shaped by superconducting chips, they assume fixed qubit positions and static coupling maps, and so can neither express dynamic atom shuttling nor represent zoned devices built around storage, entanglement, and measurement regions. As a result, neutral-atom compilers cannot get the hardware information they need from standard ecosystems, a 'technology lock' that the paper argues blocks integration. The paper's proposed remedy is a more generic device model that adds site coordinates, interaction and blocking radii, shuttling properties, zone metadata, and unit conventions, so that specialized neutral-atom compilers can be plugged in unchanged. Evaluations show that routing-overhead fidelity improves by a factor of up to 100,000 on a 16-qubit, 600-gate circuit when the full neutral-atom capability set is exposed rather than flattened to a superconducting-style coupling map.

Core claim

The core claim is that the abstraction gap—not missing compiler algorithms—is what keeps neutral-atom devices and their specialized compilers out of universal quantum ecosystems. The paper demonstrates the failure mode with a Steane-code state-preparation circuit: an interaction graph that requires a connection between non-adjacent atoms forces SWAP insertion (at least 0.15 infidelity for one SWAP) when the device is described only by a static coupling map, whereas a single shuttling move (10.9 µs, infidelity ~6.5×10^-5 under the paper's coherence model) satisfies the same connection. It then proposes concrete device-model extensions—three-dimensional site coordinates, interaction and blocki

What carries the argument

The central object is the device model itself: the machine-readable description of a quantum device's computational capabilities that a compiler consumes. The paper's contribution is a generalized model that adds, per site, spatial coordinates plus interaction and blocking radii (the two radii that determine which atoms can perform a Rydberg gate and which atoms must stay away); per operation, shuttling speed, minimum atom separation, and a zoned flag; zone sites with spatial extents; lattice metadata so clients can reconstruct trap-site layouts; and integer scale factors for lengths and durations. The identity doing the quantitative work is the routing-overhead fidelity estimate exp(-t_idle

Load-bearing premise

The quantitative headline rests on treating both routing strategies as losing fidelity mainly through coherence decay, with idle time equal to the number of atoms times 10.9 microseconds and effective coherence time 1.5 seconds; if SWAP-based routing actually loses fidelity mainly through gate errors, the claimed 100,000x improvement would shrink.

What would settle it

Recompute the fidelity comparison using measured per-operation error rates—CZ gates, single-qubit gates, trap transfers, and shuttling—rather than the single idle-time coherence formula, and check whether the 16-qubit QFT circuit still shows a ~100,000x ratio. A quicker check: run the same circuit on a real neutral-atom device under both compilation regimes and compare measured output fidelities.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Neutral-atom devices with shuttling and zoned operations can be represented in universal quantum ecosystems instead of being approximated by static coupling maps or excluded entirely.
  • Specialized neutral-atom compilers can retrieve the hardware information they need through the standardized model, so the ecosystem no longer forces them to bypass the abstraction.
  • For the benchmarked circuits, routing-overhead fidelity improves by factors from about 1.1x to 100,000x, with the largest gains on wide circuits where SWAP insertion would otherwise be catastrophic.
  • Zoned devices, whose entanglement zones make SWAP-based routing infeasible, become targetable by any compiler that understands the extended model.
  • The device-model concepts generalize to other ecosystems and other reconfigurable hardware, since the extensions are expressed as generic properties rather than neutral-atom-specific code.

Where Pith is reading between the lines

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

  • If this model becomes a common interface, benchmark comparisons between neutral-atom compilers and between hardware vendors could be standardized, making device exchange at computing centers a matter of swapping a driver rather than rewriting compilation passes.
  • The same abstractions—movable qubits, zone-like regions, radius-defined connectivity—could be used to integrate trapped-ion devices, whose shuttling and zoned operations the paper notes are also missing from current models.
  • The lattice-reconstruction protocol means a client can recover a device's logical zones entirely from queried properties, which could enable generic placement and routing algorithms that are unaware of the underlying technology.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. The paper argues that universal quantum ecosystems (Qiskit, Cirq, PennyLane, QDMI) use device models shaped by superconducting hardware—static qubit positions and fixed coupling maps—and that these models cannot abstract the computational capabilities of neutral-atom devices, specifically dynamic rearrangement/shuttling and zoned operations. The authors propose targeted extensions to a device model (site coordinates, interaction/blocking radii, lattice description, shuttling operations, zone sites, unit handling), implement the model in QDMI, and evaluate it by comparing Qiskit's SWAP-based routing on a static model with the QMAP neutral-atom compiler using the extended model. They report routing-overhead fidelity improvements by a factor of up to 1.06e5 on a 16-qubit, 600-gate QFT circuit.

Significance. The qualitative contribution is solid and timely: the paper identifies a real abstraction gap, illustrates it with concrete examples (Steane-code state preparation and zoned devices), and proposes a generic, implementable device-model extension. The open-source QDMI implementation is a strength. However, the quantitative evaluation does not currently isolate the effect of the device model from compiler specialization and hardware assumptions, and the fidelity calculation is not fully specified. If the evaluation is made rigorous, the proposed model could be a useful step toward standardizing neutral-atom information in quantum software ecosystems.

major comments (2)
  1. [Sec. V-C, Table I] The comparison conflates device-model expressiveness with compiler specialization and hardware choice. The SC-model column uses Qiskit's generic SWAP router on a monolithic neutral-atom abstraction, while the NA column uses QMAP, a specialized shuttling-aware compiler, on a zoned device. The reported improvements (up to 1.06e5) therefore include differences in compiler capability and target architecture, not only the effect of the proposed model. To attribute the gain to the device model, the evaluation should control for the compiler (e.g., by ablating the newly added model properties while keeping the rest of the stack fixed) or explicitly identify and discuss these confounds. As written, the central quantitative claim is not supported by this comparison.
  2. [Sec. V-C, Eq. (1)] The routing-overhead fidelity calculation is underspecified in the SC setting. Eq. (1) defines t_idle = n_atoms·10.9 µs for one shuttling move, and the text states that this coherence term is used 'for both settings'. No definition is given for how t_idle is accumulated when routing is performed by SWAP insertion. A SWAP is not an idle shuttling interval; its CZ errors are already included in the operation-fidelity product. Charging the SC scenario a shuttling-derived idle-time penalty has no stated physical basis, and the Table I numbers are not reproducible from the text. The coherence term may not be the dominant contributor to the 100,000x factor, but the calculation must be specified for the quantitative claim to be grounded.
minor comments (6)
  1. [Table I] The table formatting merges the gate count with the SC fidelity value; for example, 'qft 16 6027.39×10−7' appears to combine gates=602 with SC fidelity=7.39×10−7. Please separate the columns clearly.
  2. [Sec. V-C] The text says single-qubit gates have 99.97% fidelity in 52 µs; this is likely a unit typo (52 ns?) and should be corrected.
  3. [Sec. V-C] For reproducibility, specify the exact Qiskit version, routing method, and optimization level used for the SC baseline, and the QMAP version/options used for the NA baseline.
  4. [Sec. V-C] Clarify whether 'routing overhead fidelity' includes only inserted routing overhead or the total compiled-circuit fidelity; the current wording is ambiguous.
  5. [Sec. V-C, Table I] In the ghz 128 row, the NA model is worse by a factor of 3.72. This is an interesting exception but is not explained beyond a brief mention of long shuttling moves; please add a short discussion.
  6. [Sec. IV-E] The 'idling fidelity' property is introduced but its semantics are not formally defined. A precise definition or an example would help.

Circularity Check

0 steps flagged

No significant circularity: the fidelity comparison is an evaluation with fixed hardware constants, not a prediction that reduces to the model's own inputs.

full rationale

The paper's derivation chain is an architectural argument plus an evaluation, not a parameter fit. The device model additions (coordinates, interaction/blocking radii, lattice modules, shuttling/zone properties) are definitions; they do not claim to predict a quantity from themselves. The headline 100,000x routing-overhead fidelity improvement (Sec. V-C, Table I) is computed from Eq. (1), an idle-coherence approximation exp(-t_idle/T_eff) with t_idle = n_atoms * 10.9 us and T_eff = 1.5 s, taken from refs [10]/[25]. These are literature hardware constants, not fitted parameters of this paper; no prediction is statistically forced. The SC-vs-NA comparison invokes the authors' own QDMI, QMAP, and MQT Bench, but those are public implementations and the central claim - that static SC-shaped device models omit NA capabilities - is argued from the physical examples (Figs. 2-3) and external NA hardware references, not from a self-citation chain or uniqueness theorem. The application of the shuttling-derived coherence formula to the SWAP-based SC scenario is physically questionable and would be a correctness/validity risk, not a circularity: Eq. (1) is not defined in terms of the SC result. The disclosed ghz-128 exception (division by 3.72 in Table I) further shows the comparison is not constructed to always favor the proposed model. No circular step can be exhibited, so the score is 0.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

The paper makes no fitted parameters; all hardware constants come from cited experimental papers. The main modeling load rests on the coherence approximation Eq. (1) and on the assumption that the cited zoned-device parameters are representative. No new physical entities are introduced.

axioms (4)
  • domain assumption Routing overhead fidelity for both scenarios is approximated as exp(-t_idle/T_eff) with t_idle = n_atoms·10.9 µs and T_eff = 1.5 s.
    Used in Example 5 and Table I; derived from refs [10]/[25]; applied to SC SWAP-based scenario without explicit justification.
  • domain assumption Hardware parameters: CZ fidelity 99.5%, single-qubit 99.97%, trap transfer 99.9%, shuttling speed 0.55 µm/µs, coherence T_eff = 1.5 s.
    Taken from refs [10]/[38]; not independently verified and no sensitivity analysis is provided.
  • domain assumption Neutral atom devices support dynamic shuttling, multi-qubit Rydberg gates, and zoned operations as described in Sec. II-A.
    Based on cited experimental papers [10],[27],[28]; central to the model design.
  • domain assumption QDMI is a representative universal ecosystem interface whose extension generalizes to other device models.
    Used as the concrete implementation vehicle; the paper states the concepts are general but does not prove portability to Qiskit/Cirq/PennyLane.

pith-pipeline@v1.3.0-alltime-deepseek · 11251 in / 12291 out tokens · 95953 ms · 2026-08-01T09:48:15.420805+00:00 · methodology

0 comments
read the original abstract

Quantum computing is transitioning from an academic idea to a practical technology, driven by recent hardware advancements and clear paths toward real-world applications. Universal quantum ecosystems (e.g., Qiskit, Cirq, PennyLane) facilitate this transition by providing a consistent interface to diverse quantum devices, abstracting hardware-specific details through a device model that captures each device's computational capabilities. However, these device models have historically been shaped by superconducting hardware, assuming static qubit positions and fixed coupling maps. This prevents them from representing the unique computational capabilities of emerging technologies such as neutral atoms, which feature dynamic qubit rearrangement and zoned operations. As a result, although numerous specialized compilers for neutral atom devices already exist, they cannot retrieve the hardware information they need through these ecosystems - creating a technology lock that hinders or even prevents the integration of neutral atom devices. In this work, we demonstrate how this limitation leads to suboptimal compilation results and can exclude certain devices entirely. Motivated by this, we propose rethinking current device models to faithfully represent neutral atom devices, enabling their seamless integration into universal quantum ecosystems. Evaluations conducted within the Quantum Device Management Interface (QDMI) demonstrate that the proposed device model unlocks a routing overhead fidelity improvement by a factor of up to 100,000 on a circuit with 16 qubits and 600 gates.

Figures

Figures reproduced from arXiv: 2607.20616 by Ludwig Schmid, Lukas Burgholzer, Robert Wille, Yannick Stade.

Figure 1
Figure 1. Figure 1: (a) two atoms (blue) in SLM traps; three atoms (green) in AOD traps; two atom pairs perform a CZ gate. (b) two leftmost AOD atoms were shuttled right; a group of three atoms performs a CCZ gate. A. Neutral Atom-based Quantum Computing Neutral atoms (NAs, [10], [11]) have emerged as a promising quantum computing platform. They differ significantly from more established superconducting (SC) qubits [25]. Foll… view at source ↗
Figure 2
Figure 2. Figure 2: (a) the six stabilizers of the Steane code. (b) a circuit preparing its logical |0⟩-state with NA-native gates. (c) the resulting interaction graph (edges are CZ gates). (d) a qubit mapping to an NA device featuring local addressable multi-qubit gates. At least one CZ gate (the orange connection) requires the insertion of SWAP gates to route qubits. (e) the missing connection is enabled by shuttling offere… view at source ↗
Figure 3
Figure 3. Figure 3: a, where the storage zone is optimized for long coherence times and CZ gates can only be executed as zoned operations in the entanglement zone [10]. This setup—featuring better coherence times [28], [35] compared to the monolithic device in Ex. 5—depends on shuttling atoms between zones. The interaction radius depicted in Fig. 3b demonstrates that SWAP￾based routing is infeasible, as atoms can only interac… view at source ↗
Figure 4
Figure 4. Figure 4: (a) a group of sites, the sublattice in green, is duplicated and shifted [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: A JSON specification of the NA device is compiled into a shared [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Schematic of the zoned NA device presented in [10]. [PITH_FULL_IMAGE:figures/full_fig_p005_6.png] view at source ↗

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

36 extracted references · 4 linked inside Pith

  1. [1]

    arXiv: 2405.08810

    Ali Javadi-Abhari et al.,Quantum computing with Qiskit, 2024. arXiv: 2405.08810

    Pith/arXiv arXiv 2024

  2. [2]

    IBM,IBM Makes Quantum Computing Available on IBM Cloud to Accelerate Innovation, 2016

    2016

  3. [3]

    [Online]

    Cirq Developers,Cirq, version 1.6.0, 2025. [Online]. Available: https: //github.com/quantumlib/Cirq

    2025

  4. [4]

    Pennylane: Automatic differentiation of hybrid quantum-classical computations,

    Ville Bergholm et al., “Pennylane: Automatic differentiation of hybrid quantum-classical computations,” 2022. arXiv: 1811.04968

    Pith/arXiv arXiv 2022

  5. [5]

    Munich quantum valley kicks off

    Munich Quantum Valley. “Munich quantum valley kicks off.” Accessed on September 1, 2025, Munich Quantum Valley

    2025

  6. [6]

    Launching quantum delta nl: Dutch players join forces to build the future of quantum technology

    The Quantum Insider. “Launching quantum delta nl: Dutch players join forces to build the future of quantum technology.” Accessed on September 1, 2025

    2025

  7. [7]

    Uchicago, argonne, fermilab prepare for quantum information revolution

    Steve Koppes. “Uchicago, argonne, fermilab prepare for quantum information revolution.” Accessed on September 1, 2025, University of Chicago Newsroom

    2025

  8. [8]

    Riken establishes center for quantum computing

    Science Japan. “Riken establishes center for quantum computing.” Accessed on September 1, 2025, Science Japan

    2025

  9. [9]

    Quantum supremacy using a programmable superconducting processor,

    Frank Arute et al., “Quantum supremacy using a programmable superconducting processor,”Nature, 2019.DOI: 10 . 1038 / s41586 - 019-1666-5

    2019

  10. [10]

    Logical quantum processor based on reconfig- urable atom arrays,

    Dolev Bluvstein et al., “Logical quantum processor based on reconfig- urable atom arrays,”Nature, 2023.DOI: 10.1038/s41586-023-06927-3

    doi:10.1038/s41586-023-06927-3 2023

  11. [12]

    Geyser: A com- pilation framework for quantum computing with neutral atoms,

    Tirthak Patel, Daniel Silver, and Devesh Tiwari, “Geyser: A com- pilation framework for quantum computing with neutral atoms,” in Proceedings of the 49th Annual International Symposium on Computer Architecture, ACM, 2022.DOI: 10.1145/3470496.3527428

    arXiv 2022

  12. [13]

    GRAPHINE: En- hanced Neutral Atom Quantum Computing using Application-Specific Rydberg Atom Arrangement,

    Tirthak Patel, Daniel Silver, and Devesh Tiwari, “GRAPHINE: En- hanced Neutral Atom Quantum Computing using Application-Specific Rydberg Atom Arrangement,” inProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ACM, 2023.DOI: 10.1145/3581784.3607032

    arXiv 2023

  13. [14]

    PARALLAX: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints,

    Jason Ludmir and Tirthak Patel, “PARALLAX: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints,” inSC24: International Conference for High Performance Computing, Networking, Storage and Analysis, IEEE, 2024.DOI: 10.1109/SC41406. 2024.00079

    arXiv 2024

  14. [15]

    Q-Pilot: Field Programmable Qubit Array Compilation with Flying Ancillas,

    Hanrui Wang et al., “Q-Pilot: Field Programmable Qubit Array Compilation with Flying Ancillas,” inDesign Automation Conf., ACM, 2024.DOI: 10.1145/3649329.3658470

    arXiv 2024

  15. [16]

    Qompose: A Technique to Select Optimal Algorithm- Specific Layout for Neutral Atom Quantum Architectures

    Daniel Silver, Tirthak Patel, and Devesh Tiwari. “Qompose: A Technique to Select Optimal Algorithm- Specific Layout for Neutral Atom Quantum Architectures.” arXiv: 2409.19820 [quant-ph], pre-published

    Pith/arXiv arXiv

  16. [17]

    Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling,

    Daniel Bochen Tan, Wan-Hsuan Lin, and Jason Cong, “Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling,” inProceedings of the 30th Asia and South Pacific Design Automation Conference, ACM, 2025.DOI: 10.1145/3658617.3697778

    arXiv 2025

  17. [18]

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

    Daniel Bochen Tan, Dolev Bluvstein, Mikhail D. Lukin, and Ja- son Cong, “Compiling Quantum Circuits for Dynamically Field- Programmable Neutral Atoms Array Processors,”Quantum, 2024. DOI: 10.22331/q-2024-03-14-1281

    doi:10.22331/q-2024-03-14-1281 2024

  18. [19]

    Atomique: A Quantum Compiler for Recon- figurable Neutral Atom Arrays,

    Hanrui Wang et al., “Atomique: A Quantum Compiler for Recon- figurable Neutral Atom Arrays,” inInt’l Symposium on Computer Architecture, IEEE, 2024.DOI: 10.1109/ISCA59077.2024.00030

    arXiv 2024

  19. [21]

    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,” inInt’l Conf. on Quantum Computing and Engineering, IEEE, 2024.DOI: 10.1109/QCE60285. 2024.00098

    arXiv 2024

  20. [22]

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

    Ludwig Schmid, Sunghye Park, and Robert Wille, “Hybrid Circuit Mapping: Leveraging the Full Spectrum of Computational Capabilities of Neutral Atom Quantum Computers,” inDesign Automation Conf., ACM, 2024.DOI: 10.1145/3649329.3655959

    arXiv 2024

  21. [23]

    Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing,

    Yannick Stade, Wan-Hsuan Lin, Jason Cong, and Robert Wille, “Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing,” inInt’l Conf. on CAD, IEEE, 2025.DOI: 10 . 1109 / ICCAD66269.2025.11240721

    arXiv 2025

  22. [24]

    QDMI - Quantum Device Management Interface: Hardware-Software Interface for the Munich Quantum Software Stack,

    Robert Wille et al., “QDMI - Quantum Device Management Interface: Hardware-Software Interface for the Munich Quantum Software Stack,” inInt’l Conf. on Quantum Computing and Engineering, IEEE, 2024. DOI: 10.1109/qce60285.2024.10411

    arXiv 2024

  23. [25]

    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.DOI: 10.1088/2058-9565/ad33ac

    doi:10.1088/2058-9565/ad33ac 2024

  24. [26]

    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. DOI: 10.1126/science.aah3778

    doi:10.1126/science.aah3778 2016

  25. [27]

    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.DOI: 10.1038/ s41586-022-04592-6

    2022

  26. [29]

    Rydberg-Mediated Entanglement in a Two- Dimensional Neutral Atom Qubit Array,

    T. M. Graham et al., “Rydberg-Mediated Entanglement in a Two- Dimensional Neutral Atom Qubit Array,”Physical Review Letters, 2019.DOI: 10.1103/PhysRevLett.123.230501

    doi:10.1103/physrevlett.123.230501 2019

  27. [30]

    Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers,

    Prakash Murali, Dripto M. Debroy, Kenneth R. Brown, and Mar- garet Martonosi, “Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers,” inInt’l Symposium on Computer Architecture, 2020.DOI: 10.1109/ISCA45697.2020.00051

    arXiv 2020

  28. [31]

    [Online]

    The CUDA-Q development team,Cuda-q, version 0.12.0, 2025. [Online]. Available: https://github.com/NVIDIA/cuda-quantum

    2025

  29. [32]

    Steane,Fast fault-tolerant filtering of quantum codewords,

    Andrew M. Steane,Fast fault-tolerant filtering of quantum codewords,

  30. [33]

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

    Yannick Stade, Ludwig Schmid, Lukas Burgholzer, and Robert Wille, “Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers,” inDesign, Automation and Test in Europe, 2024.DOI: 10.23919/DATE64628.2025.10993241

    arXiv 2024

  31. [34]

    An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Archi- tectures,

    Alwin Zulehner, Alexandru Paler, and Robert Wille, “An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Archi- tectures,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019.DOI: 10.1109/TCAD.2018.2846658

    arXiv 2019

  32. [35]

    Multi-qubit entanglement and algorithms on a neutral-atom quantum computer,

    T. M. Graham et al., “Multi-qubit entanglement and algorithms on a neutral-atom quantum computer,”Nature, 2022.DOI: 10.1038/s41586- 022-04603-6

    doi:10.1038/s41586- 2022

  33. [36]

    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,” inInt’l Conf. on Quantum Software, 2024.DOI: 10.1109/QSW62656.2024.00013 A live version of this document is available at https://mqt.readthedocs.io

    arXiv 2024

  34. [37]

    MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing,

    Nils Quetschlich, Lukas Burgholzer, and Robert Wille, “MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing,”Quantum, 2023, MQT Bench is available at https://www. cda.cit.tum.de/mqtbench/.DOI: 10.22331/q-2023-07-20-1062

    doi:10.22331/q-2023-07-20-1062 2023

  35. [38]

    Reuse- Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms,

    Wan-Hsuan Lin, Daniel Bochen Tan, and Jason Cong, “Reuse- Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms,” inIEEE Int’l Symp. on High-Performance Computer Architecture, 2025.DOI: 10.1109/HPCA61900.2025.00021

    arXiv 2025

  36. [2004]

    arXiv: quant-ph/0202036

    Pith/arXiv arXiv