Pith. sign in

REVIEW 3 major objections 6 minor 2 cited by

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

T0 review · 3 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read This survey argues that qubit mapping and gate scheduling is not one compiler problem but three, each shaped by the physics of a hardware platform, and it organizes existing solutions into one cross-architectural map.

desk verdict Useful cross-architectural survey, but the tables and the 'systematic' claim need work before it can be trusted as a map. read the letter →

arxiv 2505.16891 v2 pith:RZK6DTYD submitted 2025-05-22 quant-ph

classification quant-ph
keywords quantumcompilationqubitmappinggateschedulingsuperconductingqubitstrapped-ioncomputingneutralatomarrayshardware-awarecompilersNISQ
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 survey maps the qubit mapping and gate scheduling (M&S) problem across the three leading quantum hardware platforms: superconducting, trapped-ion, and neutral atom systems. Its core claim is that M&S is not a single compiler problem; each platform's physics dictates what routing means, from inserting SWAP gates on a fixed coupling graph, to shuttling ions between traps, to physically moving atoms in reconfigurable arrays. The paper categorizes superconducting compilers into solver-based, heuristic, and machine-learning families, traces trapped-ion compilers from linear-tape to QCCD to distributed architectures, and reviews neutral atom compilers for fixed, reconfigurable, and zoned arrays. It then identifies open directions: AI-driven compilation, application-specific compilers, fault-tolerant-era (FASQ) compilation, and standardized benchmarks. A reader would care because compilation overhead currently limits what noisy quantum hardware can execute.

What carries the argument

The organizing machinery is a two-axis hardware model: qubit connectivity, classified as local, reconfigurable, or all-to-all, and qubit parallelism, classified as low, moderate, or high. These two axes, together with the native gate set and noise model of each platform, define the constraint set that any M&S compiler must satisfy, and they are what make the three platforms complementary case studies. The paper also relies on the standard DAG representation of circuits and on per-platform cost models, such as the coupling graph for superconducting devices, the AOM zone and shuttle heating models for trapped ions, and the Rydberg blockade radius and movement-collision rules for neutral atoms. This machinery carries the argument by converting a scattered literature into a structured comparison, showing which methods generalize and which are platform-specific.

What would settle it

Run one standardized circuit suite through a superconducting, a trapped-ion, and a neutral atom compiler stack and compare the relative performance of solver-based, heuristic, and machine-learning methods; if the ranking reverses across platforms, the survey's categorization loses its predictive value. A simpler check: identify a mainstream architecture whose connectivity and parallelism lie outside the survey's three categories, which would refute the claim of full-spectrum coverage.

Watch

Extended reading notes

Core claim

The central discovery, stated on the survey's own terms, is that the hardware constraints of the three mainstream platforms span the full spectrum of compilation challenges, and that understanding them together reveals transferable methods and genuine gaps. Superconducting devices have fixed local connectivity, so the M&S problem is SWAP insertion on a static graph, and the field is mature enough to classify methods by whether they use exact solvers, heuristics, or machine learning. Trapped-ion devices have fully connected traps but dynamic topology through shuttling, so compilers must schedule ion movement, split, and merge operations; the survey traces this line from linear-tape devices to QCCD and distributed systems. Neutral atom devices add reconfigurable connectivity through atom movement and native multi-qubit gates with Rydberg blockade constraints, so routing is an atom-placement and movement problem rather than a SWAP-insertion problem. The survey concludes that compiler research for superconducting devices is relatively well developed, while trapped-ion and neutral atom compilers offer significant room for further exploration.

Load-bearing premise

The map is only as trustworthy as its sample: it assumes that superconducting, trapped-ion, and neutral atom systems cover the full span of compilation challenges, and that the unreviewed preprint compilers it cites correctly represent the state of the art.

Editorial extensions

If this is right

  • Compiler techniques that succeed on superconducting devices, including look-ahead heuristics and solver-based formulations, are already being adapted to trapped-ion and neutral atom platforms, and this cross-fertilization is likely to accelerate.
  • Exact solver-based methods are limited to small circuits, so scaling to large NISQ and fault-tolerant workloads will require heuristic and machine-learning approaches.
  • Neutral atom movement can outperform SWAP-based routing in both fidelity and circuit duration when the scheduler respects movement constraints and native multi-qubit gates.
  • Quantum error correction compilation is currently concentrated on superconducting devices, leaving trapped-ion and neutral atom QEC-aware compilers as an open area.
  • Standardized, platform-aware benchmarks are missing, so meaningful cross-platform comparison of compiler quality is not yet possible.

Reading between the lines

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

  • A fourth platform whose connectivity and parallelism fall outside the survey's three categories would test the completeness of the map; silicon spin qubits or photonic systems are candidates the survey does not analyze.
  • The survey's observation that initial mapping matters less as circuit depth grows could be turned into a quantitative scaling law, connecting circuit size to the value of initial placement versus routing.
  • Machine-learning compilers may eventually serve as a unified layer across platforms, but the open correctness problem means hybrid systems that pair learned policies with formal verification are the more likely near-term outcome.
  • A standardized benchmark suite parameterized by platform constraints would let the community answer the survey's implicit question, which compiler family wins under a given hardware profile.
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

3 major / 6 minor

Summary. This survey reviews qubit mapping and gate scheduling (M&S) research for three quantum hardware platforms: superconducting, trapped-ion, and neutral atom systems. It categorizes superconducting compilers into solver-based, heuristic-based, and machine-learning-based approaches; organizes trapped-ion compilation by architecture evolution from linear-tape devices to QCCD and distributed systems; and surveys neutral-atom compilation for fixed arrays, reconfigurable arrays, and zoned architectures. The paper also discusses application-specific compilers, QEC-oriented compilation, and several future research directions, including AI-driven compilation, standardized benchmarks, and platform-aware fault-tolerant compilers.

Significance. If the survey's categorization is accurate, it would be a useful cross-architectural reference for quantum compiler researchers, particularly for the less mature trapped-ion and neutral-atom areas. The paper's strengths include its broad coverage of recent work, explicit statements of hardware constraints for each platform, and the inclusion of trapped-ion noise models and neutral-atom movement rules. However, because the paper's central contribution is an organized map of the literature, its value depends on the reliability of its tables and the representativeness of the selected corpus; the integrity issues identified below currently undermine that central claim and need to be addressed.

major comments (3)
  1. [§5.1, Table 5] Table 5 lists the same reference [177] twice, once with architecture 'RAA' and once with 'Zoned Architecture,' while compilers discussed in §5.3 and §5.4 (Q-Pilot [191], Enola [178], NALAC [171], and ZAP [72]) have no table rows. Since the survey's contribution is an organized categorization of 'major' algorithms and Table 5 is the reader's index to the neutral-atom literature, these entries must be deduplicated and completed before the coverage claim can be considered reliable.
  2. [Table 4] The row for [148] lists 'Circuit Synthesis' as the problem and 'Reinforcement Learning' as the algorithm in a table of trapped-ion M&S compilers, but the paper's declared scope in §2.2 is qubit mapping and gate scheduling, and [148] is not discussed in the trapped-ion compiler sections. Including a circuit-synthesis paper in an M&S summary table is a misassignment that undermines the table's fidelity as an index.
  3. [§1, Contributions] The abstract and the contribution list describe the review as 'systematic,' but no search protocol, inclusion/exclusion criteria, time window, or quality filter is provided. This omission is not merely procedural: combined with the table-level integrity errors noted above, the reader cannot verify that the surveyed corpus is representative of the 'major' algorithms the paper claims to organize. The authors should either state their selection methodology or qualify the coverage claim.
minor comments (6)
  1. [§4.3, Eq. (4)] The QCCD fidelity model in Eq. (4) is presented without a citation or derivation; the variables A and ¯n are described in prose, but the source of the formula should be given, since the survey later uses such models for qualitative comparisons.
  2. [§5.4] The heading 'Zoned Architecture Neural Atom Devices' and the phrase 'neural atom compiler design' in §5.1 use 'neural' where 'neutral' is intended.
  3. [§2.1] The text contains the typo 'trapped-ion devics' for 'trapped-ion devices.'
  4. [§1] The sentence 'it is necessary to perform and effective conversion process' should read 'an effective conversion process.'
  5. [References] Reference [81] lists the journal as 'A VS Quantum Science'; the correct name is 'AVS Quantum Science.'
  6. [§4.3] The paragraph beginning 'Murali et al. [124] first introduce a compiler' is immediately followed by another sentence beginning 'Murali et al. [124] also examine'; these should be merged to avoid the appearance of two distinct works.

Circularity Check

0 steps flagged · score 2.0 of 10

No load-bearing circularity; the survey's categorization is independent, with only minor non-load-bearing self-citations.

full rationale

This is a survey rather than a derivation pipeline, so the main circularity patterns do not apply. The only equations in the paper are noise models quoted from prior work (Eqs. 2-4); none is fitted here and none is used to generate a new prediction. The central organizational claim, that qubit-mapping research is best categorized by the hardware platforms of superconducting, trapped-ion, and neutral atom systems, is supported by the external literature the survey catalogs. The authors do cite several of their own works (e.g., BOSS [201], S-SYNC [218], Phoenix [208], ZAP [72], and benchmark paper [220]), but these appear as surveyed examples and not as authority for the survey's structure, and no self-citation is invoked as a uniqueness theorem or as the sole justification for a classification. The cited formula F_shuttle = 1 - epsilon_shuttle * m is a definitional linear-loss model from [201], not a derived result claimed by this paper. The internal table inconsistencies (e.g., reference [177] appearing twice in Table 5, with NALAC [171] and ZAP [72] discussed in Section 5.4 but absent from the table) and the absence of a formal search protocol are survey-reliability concerns, but they are not circularity. The score of 2 reflects only the presence of minor, non-load-bearing self-citations.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The survey rests on domain assumptions about which hardware platforms are mainstream and which compilation tasks are central. It also imports standard mathematical results and prior noise models without re-deriving them.

assumptions (4)
  • domain assumption Qubit mapping and gate scheduling is the key step in quantum compilation.
    The entire survey is framed around M&S as the focus of quantum compilers, stated in Section 2.2 and the contributions.
  • domain assumption The three platforms (superconducting, trapped-ion, neutral atom) comprehensively cover the key compilation challenges of connectivity, parallelism, and qubit modality.
    Stated in Section 2.3: 'these three hardware platforms not only because they represent the most rapidly advancing and promising candidates... but also because their distinct physical characteristics comprehensively cover the key compilation challenges.'
  • standard math The NP-hardness results for qubit mapping and SWAP minimization are correct.
    The paper cites Siraichi et al. [167] for NP-completeness and Botea et al. [23] for NP-hardness in Section 3.1, and relies on these to justify solver-based approaches.
  • domain assumption The trapped-ion noise models in Eqs. (2)-(4) accurately describe fidelity degradation.
    Section 4.2 and 4.3 use these models from prior work (Wu et al. [202], Murali et al. [124]) to compare compiler performance, without independent validation in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems." pith.science (2026). https://pith.science/paper/RZK6DTYD

@misc{pith2026250516891,
  author       = {Pith},
  title        = {Pith review of: Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RZK6DTYD}},
  note         = {Machine review of arXiv:2505.16891}
}
read the original abstract

Quantum hardware development is progressing rapidly with substantial advancements achieved across leading platforms, including superconducting circuits, trapped-ion systems, and neutral atom arrays. As the pursuit of practical quantum advantage continues, efficient quantum program compilation becomes essential for transforming high-level representations of quantum algorithms into physically executable circuits. A fundamental challenge in this process is qubit mapping and gate scheduling, which play a critical role in adapting compiled circuits to the architectural constraints and physical limitations of specific quantum hardware. In this survey, we systematically review and categorize research on the qubit mapping and routing problems across the three mainstream quantum hardware platforms. We primarily explore the development of hardware-aware compilers for superconducting platforms, classifying existing methods into solver-based, heuristic-based, and machine learning-based approaches, and analyze their optimization targets, including gate count, circuit duration, fidelity, and scalability. Furthermore, we examine the evolution of trapped-ion and neutral atom devices, analyzing the distinct challenges posed by their hardware characteristics and highlighting specialized compilers tailored to these unique physical constraints. Finally, we summarize the key challenges and identify some promising opportunities for future research in quantum compiler design across these hardware platforms.

Figures

Figures reproduced from arXiv: 2505.16891 by the authors.

Figure 1
Figure 1. Overview of the three mainstream quantum hardware architectures and their graph illustrations: (a) [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. An illustration of a circuit’s DAG representation. The front layer of the graph is made up of the nodes [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. The workflow of quantum program compilation. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Common structures of superconductivity devices and their corresponding connectivity graphs. [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: An illustration of linear-tape trapped-ion chips demonstrates that qubits within the Acousto-Optic [PITH_FULL_IMAGE:figures/full_fig_p018_5.png]
Figure 6
Figure 6. Figure 6: A modular Quantum Charge Coupled Device (QCCD) consists of several traps, each of which is initial [PITH_FULL_IMAGE:figures/full_fig_p021_6.png]
Figure 7
Figure 7. Figure 7: Shuttling in a QCCD system which has linear device topology. Extra split and merge operations are [PITH_FULL_IMAGE:figures/full_fig_p021_7.png]
Figure 8
Figure 8. Figure 8: RAA with fixed and movable atoms. It is important to note that while the AOD atom array is movable, [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]
Figure 9
Figure 9. Figure 9: The typical zoned architecture, proposed by Decker [PITH_FULL_IMAGE:figures/full_fig_p030_9.png]

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. Protected quantum gates using qubit doublons in dynamical optical lattices

    quant-ph 2025-07 conditional novelty 7.0 of 10

    Qubit doublons in a dynamical optical lattice enable a purely geometric SWAP gate for fermionic atoms, demonstrated at 99.91(7)% loss-corrected fidelity.

  2. M\"obius-Guided Diagonal-Gate Compilation with Native Multiqubit Controlled-Phase Gates on Neutral-Atom Processors

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Möbius inversion turns diagonal phase layers into phase hypergraphs that a neutral-atom scheduler can execute as native multiqubit controlled-phase gates when routing and error costs favor them.

Reference graph

Works this paper leans on

232 extracted references · 39 canonical work pages · cited by 2 Pith papers

  1. [177]

    Daniel Bochen Tan, Dolev Bluvstein, Mikhail D Lukin, and Jason Cong. 2023. Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors.arXiv preprint arXiv:2306.03487(2023)

  2. [171]

    Yannick Stade, Ludwig Schmid, Lukas Burgholzer, and Robert Wille. 2024. An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures.arXiv preprint arXiv:2405.08068(2024). Quantum Compiler Design for Qubit Mapping and Routing 41

  3. [72]

    Chen Huang, Xi Zhao, Hongze Xu, Weifeng Zhuang, Meng-Jun Hu, Dong E Liu, and Jingbo Wang. 2024. ZAP: Zoned Architecture and Parallelizable Compiler for Field Programmable Atom Array.arXiv preprint arXiv:2411.14037(2024)

  4. [148]

    Francesco Preti, Michael Schilling, Sofiene Jerbi, Lea M Trenkwalder, Hendrik Poulsen Nautrup, Felix Motzoi, and Hans J Briegel. 2024. Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning.Quantum8 (2024), 1343

  5. [191]

    Hanrui Wang, Bochen Tan, Pengyu Liu, Yilian Liu, Jiaqi Gu, Jason Cong, and Song Han. 2023. Q-Pilot: field programmable quantum array compilation with flying ancillas.arXiv preprint arXiv:2311.16190(2023)

  6. [178]

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

  7. [1]

    Suppressing quantum errors by scaling a surface code logical qubit.Nature614, 7949 (2023), 676–681

    2023. Suppressing quantum errors by scaling a surface code logical qubit.Nature614, 7949 (2023), 676–681

  8. [2]

    Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2020. Circuit compilation methodologies for quantum approximate optimization algorithm. In2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 215–228

Show all 232 references
  1. [3]

    Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2020. An efficient circuit compilation flow for quantum approximate optimization algorithm. In2020 57th ACM/IEEE Design Automation Conference (DAC). IEEE, 1–6

  2. [4]

    Mahabubul Alam, Abdullah Ash-Saki, Junde Li, Anupam Chattopadhyay, and Swaroop Ghosh. 2020. Noise resilient compilation policies for quantum approximate optimization algorithm. InProceedings of the 39th International Conference on Computer-Aided Design. 1–7

  3. [5]

    Gadi Aleksandrowicz, Thomas Alexander, Panagiotis Barkoutsos, Luciano Bello, Yael Ben-Haim, David Bucher, F Jose Cabrera-Hernández, Jorge Carballo-Franquis, Adrian Chen, Chun-Fu Chen, et al . 2019. Qiskit: An open-source framework for quantum computing.Accessed on: Mar16 (2019)

  4. [6]

    Sashwat Anagolum, Narges Alavisamani, Poulami Das, Moinuddin Qureshi, and Yunong Shi. 2024. Élivágar: Efficient quantum circuit search for classification. InProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Sy...

  5. [7]

    Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G

    Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks F...

  6. [8]

    Bao Bach, Ilya Safro, and Ed Younis. 2025. Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction.arXiv preprint arXiv:2501.12470(2025)

  7. [9]

    Jonathan M Baker, Andrew Litteken, Casey Duckering, Henry Hoffmann, Hannes Bernien, and Frederic T Chong

  8. [10]

    CJ Ballance, TP Harty, NM Linke, MA Sepiol, and DM Lucas. 2016. High-fidelity quantum logic gates using trapped-ion hyperfine qubits.Physical review letters117, 6 (2016), 060504

  9. [11]

    Bennett, Richard Cleve, David P

    Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. 1995. Elementary gates for quantum computation.Physical Review A 52, 5 (Nov. 1995), 3457–3467. https://doi.org/10.1103/ph...

  10. [12]

    Katrina Barnes, Peter Battaglino, Benjamin J Bloom, Kayleigh Cassella, Robin Coxe, Nicole Crisosto, Jonathan P King, Stanimir S Kondov, Krish Kotru, Stuart C Larsen, et al. 2022. Assembly and coherent control of a register of nuclear 34 Chenghong Zhu, Xian Wu, Zhaohui Yang, Ji...

  11. [13]

    Daniel Barredo, Sylvain De Léséleuc, Vincent Lienhard, Thierry Lahaye, and Antoine Browaeys. 2016. An atom-by- atom assembler of defect-free arbitrary two-dimensional atomic arrays.Science354, 6315 (2016), 1021–1023

  12. [14]

    Daniel Barredo, Vincent Lienhard, Sylvain De Leseleuc, Thierry Lahaye, and Antoine Browaeys. 2018. Synthetic three-dimensional atomic structures assembled atom by atom.Nature561, 7721 (2018), 79–82

  13. [15]

    Johannes Bausch, Andrew W Senior, Francisco JH Heras, Thomas Edlich, Alex Davies, Michael Newman, Cody Jones, Kevin Satzinger, Murphy Yuezhen Niu, Sam Blackwell, et al. 2024. Learning high-accuracy error decoding for quantum processors.Nature(2024), 1–7

  14. [16]

    Michael Beverland, Vadym Kliuchnikov, and Eddie Schoute. 2022. Surface code compilation via edge-disjoint paths. PRX Quantum3, 2 (2022), 020342

  15. [17]

    Michael E Beverland, Prakash Murali, Matthias Troyer, Krysta M Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, and Alexander Vaschillo. 2022. Assessing requirements to scale to practical quantum advantage.arXiv preprint arXiv:2211.07629(2022)

  16. [18]

    Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2017. Depth-optimal quantum circuit placement for arbitrary topologies.arXiv preprint arXiv:1703.08540(2017)

  17. [19]

    Debjyoti Bhattacharjee, Abdullah Ash Saki, Mahabubul Alam, Anupam Chattopadhyay, and Swaroop Ghosh. 2019. MUQUT: Multi-constraint quantum circuit mapping on NISQ computers. In2019 IEEE/ACM international conference on computer-aided design (ICCAD). IEEE, 1–7

  18. [20]

    Dolev Bluvstein, Simon J Evered, Alexandra A Geim, Sophie H Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, et al. 2024. Logical quantum processor based on reconfigurable atom arrays.Nature626, 7997 (2024), 58–65

  19. [22]

    Dolev Bluvstein, Harry Levine, Giulia Semeghini, Tout T Wang, Sepehr Ebadi, Marcin Kalinowski, Alexander Keesling, Nishad Maskara, Hannes Pichler, Markus Greiner, et al. 2022. A quantum processor based on coherent transport of entangled atom arrays.Nature604, 7906 (2022), 451–456

  20. [23]

    Adi Botea, Akihiro Kishimoto, and Radu Marinescu. 2018. On the complexity of quantum circuit compilation. In Proceedings of the International Symposium on Combinatorial Search, Vol. 9. 138–142

  21. [24]

    Sebastian Brandhofer, Ilia Polian, and Kevin Krsulich. 2023. Optimal qubit reuse for near-term quantum computers. In2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. IEEE, 859–869

  22. [25]

    Sergey Bravyi, Andrew W Cross, Jay M Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J Yoder. 2024. High- threshold and low-overhead fault-tolerant quantum memory.Nature627, 8005 (2024), 778–782

  23. [26]

    Colin D Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M Sage. 2019. Trapped-ion quantum computing: Progress and challenges.Applied Physics Reviews6, 2 (2019)

  24. [27]

    Daniel Bultrini, Samson Wang, Piotr Czarnik, Max Hunter Gordon, Marco Cerezo, Patrick J Coles, and Lukasz Cincio

  25. [28]

    Yudong Cao, Jhonathan Romero, and Alán Aspuru-Guzik. 2018. Potential of quantum computing for drug discovery. IBM Journal of Research and Development62, 6 (2018), 6–1

  26. [29]

    Christopher Chamberland and Michael E Beverland. 2018. Flag fault-tolerant error correction with arbitrary distance codes.Quantum2 (2018), 53

  27. [30]

    Christopher Chamberland, Aleksander Kubica, Theodore J Yoder, and Guanyu Zhu. 2020. Triangular color codes on trivalent graphs with flag qubits.New Journal of Physics22, 2 (2020), 023019

  28. [31]

    Rui Chao and Ben W Reichardt. 2018. Fault-tolerant quantum computation with few qubits.npj Quantum Information 4, 1 (2018), 42

  29. [32]

    Avimita Chatterjee, Archisman Ghosh, and Swaroop Ghosh. 2025. The Q-Spellbook: Crafting Surface Code Layouts and Magic State Protocols for Large-Scale Quantum Computing. arXiv:2502.11253 [quant-ph] https://arxiv.org/abs/ 2502.11253

  30. [33]

    J-S Chen, K Wright, NC Pisenti, D Murphy, KM Beck, K Landsman, JM Amini, and Y Nam. 2020. Efficient-sideband- cooling protocol for long trapped-ion chains.Physical Review A102, 4 (2020), 043110

  31. [34]

    Chin-Yi Cheng, Chien-Yi Yang, Yi-Hsiang Kuo, Ren-Chu Wang, Hao-Chung Cheng, and Chung-Yang Huang. 2024. Robust qubit mapping algorithm via double-source optimal routing on large quantum circuits.ACM Transactions on Quantum Computing5, 3 (2024), 1–26

  32. [35]

    Cheng Chu and Zhenxiao Fu. 2024. TITAN: A Distributed Large-Scale Trapped-Ion NISQ Computer. https://synthical. com/article/bd37f703-1e4f-41e1-ab57-51a5000d6d81. arXiv:2402.11021 [cs.ET]

  33. [36]

    Juan I Cirac and Peter Zoller. 1995. Quantum computations with cold trapped ions.Physical review letters74, 20 (1995), 4091. Quantum Compiler Design for Qubit Mapping and Routing 35

  34. [37]

    Antonio D Córcoles, Maika Takita, Ken Inoue, Scott Lekuch, Zlatko K Minev, Jerry M Chow, and Jay M Gambetta

  35. [38]

    Alexander Cowtan, Silas Dilkes, Ross Duncan, Will Simmons, and Seyon Sivarajah. 2019. Phase gadget synthesis for shallow circuits.arXiv preprint arXiv:1906.01734(2019)

  36. [39]

    Stephen Crain, Clinton Cahall, Geert Vrijsen, Emma E Wollman, Matthew D Shaw, Varun B Verma, Sae Woo Nam, and Jungsang Kim. 2019. High-speed low-crosstalk detection of a 171Yb+ qubit using superconducting nanowire single photon detectors.Communications Physics2, 1 (2019), 97

  37. [40]

    Exploiting dynamic quantum circuits in a quantum algorithm with superconducting qubits.Physical Review Letters127, 10 (2021), 100501

  38. [41]

    Timothée Goubault de Brugière and Simon Martiel. 2024. Faster and shorter synthesis of Hamiltonian simulation circuits.arXiv preprint arXiv:2404.03280(2024)

  39. [42]

    Ethan Decker. 2024. Arctic: A Field Programmable Quantum Array Scheduling Technique.arXiv preprint arXiv:2405.06183(2024)

  40. [43]

    Weining Dai, Kevin A Brown, and Thomas G Robertazzi. 2024. Advanced Shuttle Strategies for Parallel QCCD Architectures.IEEE Transactions on Quantum Engineering(2024)

  41. [44]

    Jack J Dongarra, Piotr Luszczek, and Antoine Petitet. 2003. The LINPACK benchmark: past, present and future. Concurrency and Computation: practice and experience15, 9 (2003), 803–820

  42. [45]

    1979.LINPACK users’ guide

    Jack J Dongarra, Cleve Barry Moler, James R Bunch, and Gilbert W Stewart. 1979.LINPACK users’ guide. SIAM

  43. [46]

    2022.Quantum computer systems: Research for noisy intermediate-scale quantum computers

    Yongshan Ding and Frederic T Chong. 2022.Quantum computer systems: Research for noisy intermediate-scale quantum computers. Springer Nature

  44. [47]

    Vedran Dunjko and Hans J Briegel. 2018. Machine learning & artificial intelligence in the quantum domain: a review of recent progress.Reports on Progress in Physics81, 7 (2018), 074001

  45. [48]

    Jonathan Durandau, Janis Wagner, Frédéric Mailhot, Charles-Antoine Brunet, Ferdinand Schmidt-Kaler, Ulrich Poschinger, and Yves Bérubé-Lauzière. 2022. Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer.arXiv preprint arXiv:2208.04881(2022)

  46. [49]

    Yuxuan Du, Tao Huang, Shan You, Min-Hsiu Hsieh, and Dacheng Tao. 2022. Quantum circuit architecture search for variational quantum algorithms.npj Quantum Information8, 1 (2022), 62

  47. [50]

    Manuel Endres, Hannes Bernien, Alexander Keesling, Harry Levine, Eric R Anschuetz, Alexandre Krajenbrink, Crystal Senko, Vladan Vuletic, Markus Greiner, and Mikhail D Lukin. 2016. Atom-by-atom assembly of defect-free one-dimensional cold atom arrays.Science354, 6315 (2016), 1024–1027

  48. [51]

    Pau Escofet, Alejandro Gonzalvo, Eduard Alarcón, Carmen G Almudéver, and Sergi Abadal. 2024. Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures. In2024 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. I...

  49. [52]

    Sepehr Ebadi, Alexander Keesling, Madelyn Cain, Tout T Wang, Harry Levine, Dolev Bluvstein, Giulia Semeghini, Ahmed Omran, J-G Liu, Rhine Samajdar, et al. 2022. Quantum optimization of maximum independent set using Rydberg atom arrays.Science376, 6598 (2022), 1209–1215

  50. [53]

    Kun Fang, Munan Zhang, Ruqi Shi, and Yinan Li. 2023. Dynamic quantum circuit compilation.arXiv preprint arXiv:2310.11021(2023)

  51. [54]

    Xiang Fang, Keyi Yin, Yuchen Zhu, Jixuan Ruan, Dean Tullsen, Zhiding Liang, Andrew Sornborger, Ang Li, Travis Humble, Yufei Ding, et al. 2024. CaliScalpel: In-Situ and Fine-Grained Qubit Calibration Integrated with Surface Code Quantum Error Correction.arXiv preprint arXiv:241...

  52. [55]

    Simon J Evered, Dolev Bluvstein, Marcin Kalinowski, Sepehr Ebadi, Tom Manovitz, Hengyun Zhou, Sophie H Li, Alexandra A Geim, Tout T Wang, Nishad Maskara, et al. 2023. High-fidelity parallel entangling gates on a neutral atom quantum computer.arXiv preprint arXiv:2304.05420(2023)

  53. [56]

    Kenneth Fazel, Mitchell A Thornton, and Jacqueline E Rice. 2007. ESOP-based Toffoli gate cascade generation. In 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. IEEE, 206–209

  54. [57]

    Richard P Feynman. 2018. Simulating physics with computers. InFeynman and computation. cRc Press, 133–153

  55. [58]

    Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 [quant-ph] https://arxiv.org/abs/1411.4028

  56. [59]

    John P Gaebler, Ting Rei Tan, Yiheng Lin, Y Wan, Ryan Bowler, Adam C Keith, Scott Glancy, Kevin Coakley, Emanuel Knill, Dietrich Leibfried, et al. 2016. High-fidelity universal gate set for be 9+ ion qubits.Physical review letters117, 6 (2016), 060505

  57. [60]

    Yan Ge, Wu Wenjie, Chen Yuheng, Pan Kaisen, Lu Xudong, Zhou Zixiang, Wang Yuhan, Wang Ruocheng, and Yan Junchi. 2024. Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects. arXiv:2407.00736 [quant-ph] https://arxiv.org/abs/2407.00736 36 Chenghong Zhu, ...

  58. [61]

    Hao Fu, Mingzheng Zhu, Fangzheng Chen, Chi Zhang, Jun Wu, Wei Xie, and Xiang-Yang Li. 2024. Effective and Efficient Parallel Qubit Mapper.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2024)

  59. [62]

    Kou Hamada, Yasunari Suzuki, and Yuuki Tokunaga. 2024. Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice. arXiv:2401.15829 [quant-ph] https://arxiv.org/abs/2401.15829

  60. [63]

    TP Harty, DTC Allcock, C J Ballance, L Guidoni, HA Janacek, NM Linke, DN Stacey, and DM Lucas. 2014. High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit.Physical review letters113, 22 (2014), 220501

  61. [64]

    TM Graham, Y Song, J Scott, C Poole, L Phuttitarn, K Jooya, P Eichler, X Jiang, A Marra, B Grinkemeyer, et al. 2022. Multi-qubit entanglement and algorithms on a neutral-atom quantum computer.Nature604, 7906 (2022), 457–462

  62. [65]

    Zhimin He, Maijie Deng, Shenggen Zheng, Lvzhou Li, and Haozhen Situ. 2024. Training-free quantum architecture search. InProceedings of the AAAI conference on artificial intelligence, Vol. 38. 12430–12438

  63. [67]

    Wakaki Hattori and Shigeru Yamashita. 2018. Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures. InReversible Computation: 10th International Conference, RC 2018, Leicester, UK, September 12-14, 2018, Proceedings 10. Springer, 228–243

  64. [68]

    Daniel Herr, Franco Nori, and Simon J Devitt. 2017. Optimization of lattice surgery is NP-hard.Npj quantum information3, 1 (2017), 35

  65. [69]

    Laura S Herzog, Lucas Berent, Aleksander Kubica, and Robert Wille. 2025. Lattice Surgery Compilation Beyond the Surface Code.arXiv preprint arXiv:2504.10591(2025)

  66. [70]

    Loïc Henriet, Lucas Beguin, Adrien Signoles, Thierry Lahaye, Antoine Browaeys, Georges-Olivier Reymond, and Christophe Jurczak. 2020. Quantum computing with neutral atoms.Quantum4 (2020), 327

  67. [71]

    Fei Hua, Yuwei Jin, Yanhao Chen, Suhas Vittal, Kevin Krsulich, Lev S Bishop, John Lapeyre, Ali Javadi-Abhari, and Eddy Z Zhang. 2023. Caqr: A compiler-assisted approach for qubit reuse through dynamic circuit. InProceedings of the 28th ACM International Conference on Architect...

  68. [73]

    Yutaka Hirano and Keisuke Fujii. 2025. Locality-aware Pauli-based computation for local magic state preparation. arXiv:2504.12091 [quant-ph] https://arxiv.org/abs/2504.12091

  69. [74]

    He-Liang Huang, Xiao-Yue Xu, Chu Guo, Guojing Tian, Shi-Jie Wei, Xiaoming Sun, Wan-Su Bao, and Gui-Lu Long. 2023. Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation.Science China ...

  70. [75]

    Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R. McClean. 2022. Quantum advantage in learning from experiments.Science376, 6598 (June 2022), 1182–1186. https://doi....

  71. [76]

    Ching-Yao Huang, Chi-Hsiang Lien, and Wai-Kei Mak. 2022. Reinforcement Learning and DEAR Framework for Solving the Qubit Mapping Problem. InProceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design. 1–9

  72. [77]

    Yuwei Jin, Zirui Li, Fei Hua, Tianyi Hao, Huiyang Zhou, Yipeng Huang, and Eddy Z Zhang. 2024. Tetris: A compilation framework for vqa applications in quantum computing. In2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA). IEEE, 277–292

  73. [78]

    John Jumper, Richard Evans, Alexander Pritzel, Tim Green, Michael Figurnov, Olaf Ronneberger, Kathryn Tunyasu- vunakool, Russ Bates, Augustin Žídek, Anna Potapenko, et al. 2021. Highly accurate protein structure prediction with AlphaFold.nature596, 7873 (2021), 583–589

  74. [79]

    Dieter Jaksch, Juan Ignacio Cirac, Peter Zoller, Steve L Rolston, Robin Côté, and Mikhail D Lukin. 2000. Fast quantum gates for neutral atoms.Physical Review Letters85, 10 (2000), 2208

  75. [80]

    Adam M Kaufman and Kang-Kuen Ni. 2021. Quantum science with optical tweezer arrays of ultracold atoms and molecules.Nature Physics17, 12 (2021), 1324–1333

  76. [81]

    Vidyut Kaushal, Bjoern Lekitsch, A Stahl, J Hilder, Daniel Pijn, C Schmiegelow, Alejandro Bermudez, M Müller, Ferdinand Schmidt-Kaler, and U Poschinger. 2020. Shuttling-based trapped-ion quantum information processing. A VS Quantum Science2, 1 (2020)

  77. [82]

    Shuwen Kan, Zefan Du, Chenxu Liu, Meng Wang, Yufei Ding, Ang Li, Ying Mao, and Samuel Stein. 2025. SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing.arXiv preprint arXiv:2504.21854(2025)

  78. [83]

    Morten Kjaergaard, Mollie E Schwartz, Jochen Braumüller, Philip Krantz, Joel I-J Wang, Simon Gustavsson, and William D Oliver. 2020. Superconducting qubits: Current state of play.Annual Review of Condensed Matter Physics11, Quantum Compiler Design for Qubit Mapping and Routing...

  79. [84]

    Emanuel Knill, Raymond Laflamme, and Gerald J Milburn. 2001. A scheme for efficient quantum computation with linear optics.nature409, 6816 (2001), 46–52

  80. [85]

    David Kielpinski, Chris Monroe, and David J Wineland. 2002. Architecture for a large-scale ion-trap quantum computer.Nature417, 6890 (2002), 709–711

  81. [86]

    Philip Krantz, Morten Kjaergaard, Fei Yan, Terry P Orlando, Simon Gustavsson, and William D Oliver. 2019. A quantum engineer’s guide to superconducting qubits.Applied physics reviews6, 2 (2019)

  82. [87]

    Fabian Kreppel, Christian Melzer, Diego Olvera Millán, Janis Wagner, Janine Hilder, Ulrich Poschinger, Ferdinand Schmidt-Kaler, and André Brinkmann. 2023. Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer. arXiv:2207.01964 [quant-ph]

  83. [88]

    Nikolaos Koukoulekidis, Samson Wang, Tom O’Leary, Daniel Bultrini, Lukasz Cincio, and Piotr Czarnik. 2023. A framework of partial error correction for intermediate-scale quantum computers. arXiv:2306.15531 [quant-ph] https://arxiv.org/abs/2306.15531

  84. [89]

    Anna M Krol, Aritra Sarkar, Imran Ashraf, Zaid Al-Ars, and Koen Bertels. 2022. Efficient decomposition of unitary matrices in quantum circuit compilers.Applied Sciences12, 2 (2022), 759

  85. [90]

    Janusz Kusyk, Samah M Saeed, and Muharrem Umit Uyar. 2021. Survey on quantum circuit compilation for noisy intermediate-scale quantum computers: Artificial intelligence to heuristics.IEEE Transactions on Quantum Engineering 2 (2021), 1–16

  86. [91]

    Anna M Krol and Zaid Al-Ars. 2024. Beyond quantum Shannon decomposition: Circuit construction for n-qubit gates based on block-ZXZ decomposition.Physical Review Applied22, 3 (2024), 034019

  87. [92]

    Lingling Lao and Dan E Browne. 2022. 2qan: A quantum compiler for 2-local qubit hamiltonian simulation algorithms. InProceedings of the 49th Annual International Symposium on Computer Architecture. 351–365

  88. [93]

    Lingling Lao, Bas van Wee, Imran Ashraf, J Van Someren, Nader Khammassi, Koen Bertels, and Carmen G Almudever

  89. [94]

    Lingling Lao and Carmen G Almudever. 2020. Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits.Physical Review A101, 3 (2020), 032333

  90. [95]

    Tyler LeBlond, Christopher Dean, George Watkins, and Ryan Bennink. 2023. Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+ T Lattice Surgery Compilation.ACM Transactions on Quantum Computing (2023)

  91. [96]

    Dietrich Leibfried, Rainer Blatt, Christopher Monroe, and David Wineland. 2003. Quantum dynamics of single trapped ions.Reviews of Modern Physics75, 1 (2003), 281

  92. [97]

    Pak Hong Leung and Kenneth R Brown. 2018. Entangling an arbitrary pair of qubits in a long ion crystal.Physical Review A98, 3 (2018), 032318

  93. [98]

    Tyler LeBlond, Ryan S Bennink, Justin G Lietz, and Christopher M Seck. 2023. Tiscc: A surface code compiler and resource estimator for trapped-ion processors. InProceedings of the SC’23 Workshops of The International Conference on High Performance Computing, Network, Storage, ...

  94. [99]

    Gushu Li, Yufei Ding, and Yuan Xie. 2019. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 1001–1014

  95. [100]

    Gushu Li, Yunong Shi, and Ali Javadi-Abhari. 2021. Software-hardware co-optimization for computational chemistry on superconducting quantum processors. In2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA). IEEE, 832–845

  96. [101]

    Gushu Li, Anbang Wu, Yunong Shi, Ali Javadi-Abhari, Yufei Ding, and Yuan Xie. 2022. Paulihedral: a generalized block- wise compiler optimization framework for quantum simulation kernels. InProceedings of the 27th ACM International Conference on Architectural Support for Progra...

  97. [102]

    Harry Levine, Alexander Keesling, Ahmed Omran, Hannes Bernien, Sylvain Schwartz, Alexander S Zibrov, Manuel Endres, Markus Greiner, Vladan Vuletić, and Mikhail D Lukin. 2018. High-fidelity control and entanglement of Rydberg-atom qubits.Physical review letters121, 12 (2018), 123603

  98. [103]

    Wan-Hsuan Lin, Daniel Bochen Tan, and Jason Cong. 2024. Reuse-aware compilation for zoned quantum architectures based on neutral atoms.arXiv preprint arXiv:2411.11784(2024)

  99. [104]

    Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A

    Norbert M. Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A. Landsman, Kenneth Wright, and Christopher Monroe. 2017. Experimental comparison of two quantum computing architectures.Proceed- ings of the National Academy of Sciences114, 13 (Marc...

  100. [105]

    Daniel Litinski. 2019. A game of surface codes: Large-scale quantum computing with lattice surgery.Quantum3 (2019), 128. 38 Chenghong Zhu, Xian Wu, Zhaohui Yang, Jingbo Wang, Anbang Wu, Shenggen Zheng, and Xin Wang

  101. [106]

    Yongshang Li, Yu Zhang, Mingyu Chen, Xiangyang Li, and Peng Xu. 2023. Timing-Aware Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2023)

  102. [107]

    Sitong Liu, Naphan Benchasattabuse, Darcy QC Morgan, Michal Hajdušek, Simon J Devitt, and Rodney Van Meter

  103. [108]

    Mikhail D Lukin, Michael Fleischhauer, Robin Cote, LuMing Duan, Dieter Jaksch, J Ignacio Cirac, and Peter Zoller

  104. [109]

    Aaron Lye, Robert Wille, and Rolf Drechsler. 2015. Determining the minimal number of swap gates for multi- dimensional nearest neighbor quantum circuits. InThe 20th Asia and South Pacific Design Automation Conference. IEEE, 178–183

  105. [110]

    Ji Liu, Peiyi Li, and Huiyang Zhou. 2022. Not all swaps have the same cost: A case for optimization-aware qubit routing. In2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 709–725

  106. [111]

    Dmitri Maslov. 2017. Basic circuit compilation techniques for an ion-trap quantum machine.New Journal of Physics 19, 2 (2017), 023035

  107. [112]

    In2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol

    A substrate scheduler for compiling arbitrary fault-tolerant graph states. In2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. IEEE, 870–880

  108. [113]

    Peter Mattson, Vijay Janapa Reddi, Christine Cheng, Cody Coleman, Greg Diamos, David Kanter, Paulius Micikevicius, David Patterson, Guenther Schmuelling, Hanlin Tang, et al. 2020. MLPerf: An industry standard benchmark suite for machine learning performance.IEEE Micro40, 2 (20...

  109. [114]

    Q-X Mei, B-W Li, Y-K Wu, M-L Cai, Ye Wang, Lin Yao, Z-C Zhou, and L-M Duan. 2022. Experimental realization of the Rabi-Hubbard model with trapped ions.Physical Review Letters128, 16 (2022), 160504

  110. [115]

    Giulia Meuli, Mathias Soeken, Earl Campbell, Martin Roetteler, and Giovanni De Micheli. 2019. The role of multiplica- tive complexity in compiling low𝑡-count oracle circuits. In2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 1–8

  111. [116]

    Manetsch, Gyohei Nomura, Elie Bataille, Kon H

    Hannah J. Manetsch, Gyohei Nomura, Elie Bataille, Kon H. Leung, Xudong Lv, and Manuel Endres. 2024. A tweezer array with 6100 highly coherent atomic qubits. arXiv:2403.12021 [quant-ph] https://arxiv.org/abs/2403.12021

  112. [117]

    Giulia Meuli, Mathias Soeken, and Giovanni De Micheli. 2022. Xor-and-inverter graphs for quantum compilation. npj Quantum Information8, 1 (2022), 7

  113. [118]

    John, Tsuguchika Tabaru, Carole-Jean Wu, Lingjie Xu, Masafumi Yamazaki, Cliff Young, and Matei Zaharia

    Peter Mattson, Christine Cheng, Cody Coleman, Greg Diamos, Paulius Micikevicius, David Patterson, Hanlin Tang, Gu-Yeon Wei, Peter Bailis, Victor Bittorf, David Brooks, Dehao Chen, Debojyoti Dutta, Udit Gupta, Kim Hazelwood, Andrew Hock, Xinyuan Huang, Atsushi Ike, Bill Jia, Da...

  114. [119]

    Abtin Molavi, Amanda Xu, Swamit Tannu, and Aws Albarghouthi. 2025. Dependency-aware compilation for surface code quantum architectures.Proceedings of the ACM on Programming Languages9, OOPSLA1 (2025), 57–84

  115. [120]

    M Morgado and S Whitlock. 2021. Quantum simulation and computing with Rydberg-interacting qubits.A VS Quantum Science3, 2 (2021)

  116. [121]

    Mikko Möttönen, Juha J Vartiainen, Ville Bergholm, and Martti M Salomaa. 2004. Quantum circuits for general multiqubit gates.Physical review letters93, 13 (2004), 130502

  117. [122]

    Pranav Mundada, Gengyan Zhang, Thomas Hazard, and Andrew Houck. 2019. Suppression of qubit crosstalk in a tunable coupling superconducting circuit.Physical Review Applied12, 5 (2019), 054023

  118. [123]

    Giulia Meuli, Mathias Soeken, and Giovanni De Micheli. 2018. SAT-based{CNOT, T} quantum circuit synthesis. In Reversible Computation: 10th International Conference, RC 2018, Leicester, UK, September 12-14, 2018, Proceedings 10. Springer, 175–188

  119. [124]

    Prakash Murali, Dripto M Debroy, Kenneth R Brown, and Margaret Martonosi. 2020. Architecting noisy intermediate- scale trapped ion quantum computers. In2020 ACM/IEEE 47th Annual International Symposium on Computer Architec- ture (ISCA). IEEE, 529–542

  120. [125]

    Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj Bjorner, and Giovanni De Micheli. 2019. Reversible pebbling game for quantum memory management. In2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 288–291

  121. [126]

    Paul D Nation, Abdullah Ash Saki, Sebastian Brandhofer, Luciano Bello, Shelly Garion, Matthew Treinish, and Ali Javadi-Abhari. 2025. Benchmarking the performance of quantum computing software for quantum circuit creation, manipulation and compilation.Nature Computational Scien...

  122. [127]

    Siyuan Niu, Adrien Suau, Gabriel Staffelbach, and Aida Todri-Sanial. 2020. A hardware-aware heuristic for the qubit mapping problem in the nisq era.IEEE Transactions on Quantum Engineering1 (2020), 1–14

  123. [128]

    Siyuan Niu and Aida Todri-Sanial. 2023. Enabling multi-programming mechanism for quantum computing in the NISQ era.Quantum7 (2023), 925

  124. [129]

    Florence Nogrette, Henning Labuhn, Sylvain Ravets, Daniel Barredo, Lucas Béguin, Aline Vernier, Thierry Lahaye, and Antoine Browaeys. 2014. Single-atom trapping in holographic 2D arrays of microtraps with arbitrary geometries. Physical Review X4, 2 (2014), 021034

  125. [130]

    Prakash Murali, Jonathan M Baker, Ali Javadi-Abhari, Frederic T Chong, and Margaret Martonosi. 2019. Noise- adaptive compiler mappings for noisy intermediate-scale quantum computers. InProceedings of the twenty-fourth international conference on architectural support for progr...

  126. [131]

    Angelo Oddi and Riccardo Rasconi. 2018. Greedy randomized search for scalable compilation of quantum circuits. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 2...

  127. [132]

    Yasunobu Nakamura, Yu A Pashkin, and JS Tsai. 1999. Coherent control of macroscopic quantum states in a single-Cooper-pair box.nature398, 6730 (1999), 786–788

  128. [133]

    Anabel Ovide, Daniele Cuomo, and Carmen G Almudever. 2024. Scaling and assigning resources on ion trap QCCD architectures. In2024 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. IEEE, 959–970

  129. [134]

    Alexandru Paler, Lucian Sasu, Adrian-Cătălin Florea, and Răzvan Andonie. 2023. Machine learning optimization of quantum circuit layouts.ACM Transactions on Quantum Computing4, 2 (2023), 1–25

  130. [135]

    Alexandru Paler, Robert Wille, and Simon J Devitt. 2016. Wire recycling for quantum circuit optimization.Physical Review A94, 4 (2016), 042337

  131. [136]

    Sunghye Park, Daeyeon Kim, Minhyuk Kweon, Jae-Yoon Sim, and Seokhyeong Kang. 2022. A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computers. InProceedings of the 59th ACM/IEEE Design Automation Conference. 13–18

  132. [137]

    Natalia Nottingham, Michael A Perlin, Ryan White, Hannes Bernien, Frederic T Chong, and Jonathan M Baker. 2023. Decomposing and Routing Quantum Circuits Under Constraints for Neutral Atom Architectures.arXiv preprint arXiv:2307.14996(2023)

  133. [138]

    Tirthak Patel, Daniel Silver, and Devesh Tiwari. 2022. Geyser: a compilation framework for quantum computing with neutral atoms. InProceedings of the 49th Annual International Symposium on Computer Architecture. 383–395

  134. [139]

    Román Orús, Samuel Mugel, and Enrique Lizaso. 2019. Quantum computing for finance: Overview and prospects. Reviews in Physics4 (2019), 100028

  135. [140]

    Jennifer Paykin, Albert T Schmitz, Mohannad Ibrahim, Xin-Chuan Wu, and Anne Y Matsuura. 2023. Pcoast: A pauli-based quantum circuit optimization framework. In2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. IEEE, 715–726

  136. [141]

    Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien. 2014. A variational eigenvalue solver on a photonic quantum processor.Nature communications 5, 1 (2014), 4213

  137. [142]

    Hieu Pham, Melody Guan, Barret Zoph, Quoc Le, and Jeff Dean. 2018. Efficient neural architecture search via parameters sharing. InInternational conference on machine learning. PMLR, 4095–4104

  138. [143]

    Juan M Pino, Jennifer M Dreiling, Caroline Figgatt, John P Gaebler, Steven A Moses, MS Allman, CH Baldwin, Michael Foss-Feig, David Hayes, Karl Mayer, et al. 2021. Demonstration of the trapped-ion quantum CCD computer architecture.Nature592, 7853 (2021), 209–213

  139. [144]

    Gonçalo Pascoal, Joao Paulo Fernandes, and Rui Abreu. 2024. Deep Reinforcement Learning Strategies for Noise- Adaptive Qubit Routing. In2024 IEEE International Conference on Quantum Software (QSW). IEEE, 146–156

  140. [145]

    Alexander PM Place, Lila VH Rodgers, Pranav Mundada, Basil M Smitham, Mattias Fitzpatrick, Zhaoqi Leng, Anjali Premkumar, Jacob Bryon, Andrei Vrajitoarea, Sara Sussman, et al. 2021. New material platform for superconducting transmon qubits with coherence times exceeding 0.3 mi...

  141. [146]

    Tirthak Patel, Ed Younis, Costin Iancu, Wibe de Jong, and Devesh Tiwari. 2022. Quest: systematically approximating quantum circuits for higher output fidelity. InProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operati...

  142. [147]

    John Preskill. 2025. Beyond nisq: The megaquop machine. , 7 pages

  143. [149]

    Nils Quetschlich, Florian J Kiwit, Maximilian A Wolf, Carlos A Riofrio, Lukas Burgholzer, Andre Luckow, and Robert Wille. 2024. Towards application-aware quantum circuit compilation.arXiv preprint arXiv:2404.12433(2024). 40 Chenghong Zhu, Xian Wu, Zhaohui Yang, Jingbo Wang, An...

  144. [150]

    Scott Gardner, Itay Hubara, Sachin Idgunji, Thomas B

    Vijay Janapa Reddi, Christine Cheng, David Kanter, Peter Mattson, Guenther Schmuelling, Carole-Jean Wu, Brian Anderson, Maximilien Breughe, Mark Charlebois, William Chou, Ramesh Chukka, Cody Coleman, Sam Davis, Pan Deng, Greg Diamos, Jared Duke, Dave Fick, J. Scott Gardner, It...

  145. [151]

    Jarryd J Pla, Kuan Y Tan, Juan P Dehollain, Wee H Lim, John JL Morton, David N Jamieson, Andrew S Dzurak, and Andrea Morello. 2012. A single-atom electron spin qubit in silicon.Nature489, 7417 (2012), 541–545

  146. [152]

    Xiangyu Ren, Tianyu Zhang, Xiong Xu, Yi-Cong Zheng, and Shengyu Zhang. 2024. Leveraging Machine Learning for Quantum Compilation Optimization. InProceedings of the 61st ACM/IEEE Design Automation Conference. 1–4

  147. [153]

    John Preskill. 2018. Quantum Computing in the NISQ era and beyond.Quantum2 (aug 2018), 79. https://doi.org/10. 22331/q-2018-08-06-79

  148. [154]

    Campbell, Eric Hudson, David Haye, Hartmut Haeffner, Travis Humble, Jens Palsberg, and Yufei Ding

    Jixuan Ruan, Hezi Zhang, Xiang Fang, Ang Li, Wesley C. Campbell, Eric Hudson, David Haye, Hartmut Haeffner, Travis Humble, Jens Palsberg, and Yufei Ding. 2025. TrapSIMD: SIMD-Aware Compiler Optimization for 2D Trapped-Ion Quantum Machines. arXiv:2504.17886 [quant-ph] https://a...

  149. [155]

    Mark Saffman. 2019. Quantum computing with neutral atoms.National Science Review6, 1 (2019), 24–25

  150. [156]

    Mark Saffman, Thad G Walker, and Klaus Mølmer. 2010. Quantum information with Rydberg atoms.Reviews of modern physics82, 3 (2010), 2313–2363

  151. [158]

    Ben W Reichardt. 2020. Fault-tolerant quantum error correction for Steane’s seven-qubit color code with few or no extra qubits.Quantum Science and Technology6, 1 (2020), 015007

  152. [159]

    Nicolas Schlosser, Georges Reymond, Igor Protsenko, and Philippe Grangier. 2001. Sub-poissonian loading of single atoms in a microscopic dipole trap.Nature411, 6841 (2001), 1024–1027

  153. [160]

    Jixuan Ruan, Xiang Fang, Hezi Zhang, Ang Li, Travis Humble, and Yufei Ding. 2024. PowerMove: Optimizing Compilation for Neutral Atom Quantum Computers with Zoned Architecture.arXiv preprint arXiv:2411.12263(2024)

  154. [161]

    Sarah Schneider, Lukas Burgholzer, and Robert Wille. 2023. A SAT encoding for optimal Clifford circuit synthesis. In Proceedings of the 28th Asia and South Pacific Design Automation Conference. 190–195

  155. [162]

    Daniel Schoenberger, Stefan Hillmich, Matthias Brandl, and Robert Wille. 2024. Shuttling for Scalable Trapped-Ion Quantum Computers.arXiv preprint arXiv:2402.14065(2024)

  156. [163]

    Daniel Schoenberger, Stefan Hillmich, Matthias Brandl, and Robert Wille. 2024. Using Boolean satisfiability for exact shuttling in trapped-ion quantum computers. In2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, 127–133

  157. [164]

    Vivek V Shende, Stephen S Bullock, and Igor L Markov. 2005. Synthesis of quantum logic circuits. InProceedings of the 2005 Asia and South Pacific Design Automation Conference. 272–275

  158. [165]

    Abdullah Ash Saki, Rasit Onur Topaloglu, and Swaroop Ghosh. 2022. Muzzle the shuttle: efficient compilation for multi-trap trapped-ion quantum computers. In2022 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 322–327

  159. [166]

    Animesh Sinha, Utkarsh Azad, and Harjinder Singh. 2022. Qubit routing using graph neural network aided Monte Carlo tree search. InProceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 9935–9943

  160. [167]

    Tobias Schmale, Bence Temesi, Alakesh Baishya, Nicolas Pulido-Mateo, Ludwig Krinner, Timko Dubielzig, Christian Ospelkaus, Hendrik Weimer, and Daniel Borcherding. 2022. Backend compiler phases for trapped-ion quantum computers. In2022 IEEE International Conference on Quantum S...

  161. [168]

    Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan. 2020. t|ket〉: a retargetable compiler for NISQ devices.Quantum Science and Technology6, 1 (Nov. 2020), 014003. https://doi.org/10. 1088/2058-9565/ab8e92

  162. [169]

    MC Smith, AD Leu, K Miyanishi, MF Gely, and DM Lucas. 2024. Single-qubit gates with errors at the10 −7 level. arXiv preprint arXiv:2412.04421(2024)

  163. [170]

    Anders Sørensen and Klaus Mølmer. 1999. Quantum computation with ions in thermal motion.Physical review letters 82, 9 (1999), 1971

  164. [172]

    Cheng Sheng, Jiayi Hou, Xiaodong He, Peng Xu, Kunpeng Wang, Jun Zhuang, Xiao Li, Min Liu, Jin Wang, and Mingsheng Zhan. 2021. Efficient preparation of two-dimensional defect-free atom arrays with near-fewest sorting- atom moves.Physical Review Research3, 2 (2021), 023008

  165. [173]

    Samuel Stein, Shifan Xu, Andrew W Cross, Theodore J Yoder, Ali Javadi-Abhari, Chenxu Liu, Kun Liu, Zeyuan Zhou, Charlie Guinn, Yufei Ding, et al. 2025. HetEC: Architectures for Heterogeneous Quantum Error Correction Codes. InProceedings of the 30th ACM International Conference...

  166. [174]

    Marcos Yukio Siraichi, Vinícius Fernandes dos Santos, Caroline Collange, and Fernando Magno Quintão Pereira. 2018. Qubit allocation. InProceedings of the 2018 International Symposium on Code Generation and Optimization. 113–125

  167. [175]

    Bochen Tan, Dolev Bluvstein, Mikhail D Lukin, and Jason Cong. 2022. Qubit Mapping for Reconfigurable Atom Arrays. InProceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design. 1–9

  168. [176]

    Bochen Tan and Jason Cong. 2020. Optimal layout synthesis for quantum computing. InProceedings of the 39th International Conference on Computer-Aided Design. 1–9

  169. [179]

    Samuel Stein, Sara Sussman, Teague Tomesh, Charles Guinn, Esin Tureci, Sophia Fuhui Lin, Wei Tang, James Ang, Srivatsan Chakram, Ang Li, et al. 2023. Hetarch: Heterogeneous microarchitectures for superconducting quantum systems. InProceedings of the 56th Annual IEEE/ACM Intern...

  170. [180]

    Swamit S Tannu and Moinuddin K Qureshi. 2019. Not all qubits are created equal: A case for variability-aware policies for NISQ-era quantum computers. InProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Sy...

  171. [181]

    Matthew Steinberg, Medina Bandić, Sacha Szkudlarek, Carmen G Almudever, Aritra Sarkar, and Sebastian Feld. 2024. Lightcone bounds for quantum circuit mapping via uncomplexity.npj Quantum Information10, 1 (2024), 113

  172. [182]

    Gideon Uchehara, Tor M Aamodt, and Olivia Di Matteo. 2024. Graph-based identification of qubit network (GidNET) for qubit reuse. In2024 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 1. IEEE, 1120–1131

  173. [183]

    Yosuke Ueno, Taku Saito, Teruo Tanimoto, Yasunari Suzuki, Yutaka Tabuchi, Shuhei Tamate, and Hiroshi Nakamura

  174. [184]

    Suryansh Upadhyay, Abdullah Ash Saki, Rasit Onur Topaloglu, and Swaroop Ghosh. 2022. A Shuttle-Efficient Qubit Mapper for Trapped-Ion Quantum Computers. InProceedings of the Great Lakes Symposium on VLSI 2022. 305–308

  175. [185]

    E Urban, Todd A Johnson, T Henage, L Isenhower, DD Yavuz, TG Walker, and M Saffman. 2009. Observation of Rydberg blockade between two atoms.Nature Physics5, 2 (2009), 110–114

  176. [186]

    Daniel Bochen Tan, Murphy Yuezhen Niu, and Craig Gidney. 2024. A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing. In2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)....

  177. [187]

    Alex Wang, Amanpreet Singh, Julian Michael, Felix Hill, Omer Levy, and Samuel R. Bowman. 2019. GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding. arXiv:1804.07461 [cs.CL] https://arxiv.org/abs/1804.07461

  178. [188]

    Vinay Tripathi, Huo Chen, Mostafa Khezri, Ka-Wa Yip, EM Levenson-Falk, and Daniel A Lidar. 2022. Suppression of crosstalk in superconducting qubits using dynamical decoupling.Physical review applied18, 2 (2022), 024068

  179. [189]

    Hanrui Wang, Jiaqi Gu, Yongshan Ding, Zirui Li, Frederic T Chong, David Z Pan, and Song Han. 2022. Quantumnat: quantum noise-aware training with noise injection, quantization and normalization. InProceedings of the 59th ACM/IEEE design automation conference. 1–6

  180. [190]

    Hanrui Wang, Pengyu Liu, Daniel Bochen Tan, Yilian Liu, Jiaqi Gu, David Z Pan, Jason Cong, Umut A Acar, and Song Han. 2024. Atomique: A quantum compiler for reconfigurable neutral atom arrays. In2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)....

  181. [192]

    Meng Wang, Chenxu Liu, Samuel Stein, Yufei Ding, Poulami Das, Prashant J Nair, and Ang Li. 2024. Optimizing FTQC Programs through QEC Transpiler and Architecture Codesign.arXiv preprint arXiv:2412.15434(2024)

  182. [193]

    Pengfei Wang, Chun-Yang Luan, Mu Qiao, Mark Um, Junhua Zhang, Ye Wang, Xiao Yuan, Mile Gu, Jingning Zhang, and Kihwan Kim. 2021. Single ion qubit with estimated coherence time exceeding one hour.Nature communications 12, 1 (2021), 233. 42 Chenghong Zhu, Xian Wu, Zhaohui Yang, ...

  183. [194]

    Arianne Meijer van de Griend. 2023. Towards a generic compilation approach for quantum circuits through resynthesis. arXiv preprint arXiv:2304.08814(2023)

  184. [195]

    George Watkins, Hoang Minh Nguyen, Keelan Watkins, Steven Pearce, Hoi-Kwan Lau, and Alexandru Paler. 2024. A high performance compiler for very large scale surface code computations.Quantum8 (2024), 1354

  185. [196]

    Hanrui Wang, Yongshan Ding, Jiaqi Gu, Yujun Lin, David Z Pan, Frederic T Chong, and Song Han. 2022. Quantumnas: Noise-adaptive search for robust quantum circuits. In2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 692–708

  186. [197]

    Robert Wille, Oliver Keszocze, Marcel Walter, Patrick Rohrs, Anupam Chattopadhyay, and Rolf Drechsler. 2016. Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In2016 21st Asia and South Pacific design automation conference (ASP-DAC). IEEE, 292–297

  187. [198]

    Anbang Wu, Gushu Li, Hezi Zhang, Gian Giacomo Guerreschi, Yufei Ding, and Yuan Xie. 2022. A synthesis framework for stitching surface code with superconducting quantum devices. InProceedings of the 49th Annual International Symposium on Computer Architecture. 337–350

  188. [199]

    Xian Wu and Lvzhou Li. 2024. Asymptotically optimal synthesis of reversible circuits.Information and Computation 301 (2024), 105235

  189. [200]

    Xiaoling Wu, Xinhui Liang, Yaoqi Tian, Fan Yang, Cheng Chen, Yong-Chun Liu, Meng Khoon Tey, and Li You. 2021. A concise review of Rydberg atom based quantum computation and quantum simulation.Chinese Physics B30, 2 (2021), 020305

  190. [201]

    Xian Wu, Chenghong Zhu, Jingbo Wang, and Xin Wang. 2025. BOSS: Blocking algorithm for optimizing shuttling scheduling in Ion Trap. In2025 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 290–303

  191. [202]

    Yue Wang, Yongbin Sun, Ziwei Liu, Sanjay E Sarma, Michael M Bronstein, and Justin M Solomon. 2019. Dynamic graph cnn for learning on point clouds.ACM Transactions on Graphics (tog)38, 5 (2019), 1–12

  192. [203]

    Xin-Chuan Wu, Yongshan Ding, Yunong Shi, Yuri Alexeev, Hal Finkel, Kibaek Kim, and Frederic T Chong. 2019. ILP-based scheduling for linear-tape model trapped-ion quantum computers. Inthe Proceedings of The International Conference for High Performance Computing, Networking, St...

  193. [204]

    Robert Wille, Lukas Burgholzer, and Alwin Zulehner. 2019. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. InProceedings of the 56th Annual Design Automation Conference

  194. [205]

    Qian Xu, J Pablo Bonilla Ataides, Christopher A Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasić, Mikhail D Lukin, Liang Jiang, and Hengyun Zhou. 2024. Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays.Nature Physics20...

  195. [206]

    Yuan Xu, Ji Chu, Jiahao Yuan, Jiawei Qiu, Yuxuan Zhou, Libo Zhang, Xinsheng Tan, Yang Yu, Song Liu, Jian Li, et al

  196. [207]

    Shuai Yang, Wei Zi, Bujiao Wu, Cheng Guo, Jialin Zhang, and Xiaoming Sun. 2023. Efficient quantum circuit synthesis for SAT-oracle with limited ancillary qubit.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2023)

  197. [208]

    2025.Phoenix: Pauli-based High-level Optimization Engine for Instruction Execution on NISQ Devices

    Zhaohui Yang, Dawei Ding, Chenghong Zhu, Jianxin Chen, and Yuan Xie. 2025.Phoenix: Pauli-based High-level Optimization Engine for Instruction Execution on NISQ Devices. InProceedings of the 62nd ACM/IEEE Design Automation Conference

  198. [209]

    Keyi Yin, Xiang Fang, Zhuo Chen, Ang Li, David Hayes, Eneet Kaur, Reza Nejabati, Hartmut Haeffner, Wes Campbell, Eric Hudson, et al. 2025. Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems.arXiv preprint arXiv:2504.16303(2025)

  199. [210]

    Xin-Chuan Wu, Dripto M Debroy, Yongshan Ding, Jonathan M Baker, Yuri Alexeev, Kenneth R Brown, and Frederic T Chong. 2021. Tilt: Achieving higher fidelity on a trapped-ion linear-tape quantum computing architecture. In2021 IEEE International Symposium on High-Performance Compu...

  200. [211]

    Keyi Yin, Hezi Zhang, Xiang Fang, Yunong Shi, Travis S Humble, Ang Li, and Yufei Ding. 2025. QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures. InProceedings of the 30th ACM International Conference on Architectural Support for Program...

  201. [212]

    Yulin Wu, Wan-Su Bao, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, et al . 2021. Strong quantum computational advantage using a superconducting quantum processor.Physical review letters127, 18 (2021), 180501

  202. [213]

    Di Yu and Kun Fang. 2024. Symmetry-based quantum circuit mapping.Physical Review Applied22, 2 (2024), 024029

  203. [214]

    Chi Zhang, Ari B Hayes, Longfei Qiu, Yuwei Jin, Yanhao Chen, and Eddy Z Zhang. 2021. Time-optimal qubit mapping. InProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Quantum Compiler Design for Qubit Mapping and Routing ...

  204. [215]

    High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits.Physical Review Letters125, 24 (2020), 240503

  205. [216]

    Peng Zhao, Kehuan Linghu, Zhiyuan Li, Peng Xu, Ruixia Wang, Guangming Xue, Yirong Jin, and Haifeng Yu. 2022. Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits.PRX quantum3, 2 (2022), 020301

  206. [217]

    Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-han Luo, Jian Qin, Dian Wu, Xing Ding, Yi Hu, Peng Hu, Xiao-yan Yang, Wei-jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-le Liu, Chao-yang Lu, and Jian-...

  207. [218]

    Chenghong Zhu, Xian Wu, Jingbo Wang, and Xin Wang. 2025. S-SYNC: Shuttle and Swap Co-Optimization in Quantum Charge-Coupled Devices.arXiv preprint arXiv:2505.01316(2025)

  208. [219]

    Keyi Yin, Xiang Fang, Travis S Humble, Ang Li, Yunong Shi, and Yufei Ding. 2024. Surf-deformer: Mitigating dynamic defects on surface code via adaptive deformation. In2024 57th IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 750–764

  209. [220]

    Chenghong Zhu, Lei Zhang, and Xin Wang. 2025. A quest toward comprehensive benchmarking of quantum computing software.Nature Computational Science(2025), 1–2

  210. [221]

    L You and MS Chapman. 2000. Quantum entanglement using trapped atomic spins.Physical Review A62, 5 (2000), 052302

  211. [222]

    Pengcheng Zhu, Shiguang Feng, and Zhijin Guan. 2021. An iterated local search methodology for the qubit mapping problem.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems41, 8 (2021), 2587–2597

  212. [223]

    Pengcheng Zhu, Zhijin Guan, and Xueyun Cheng. 2020. A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems39, 12 (2020), 4721–4735

  213. [224]

    Jiehang Zhang, Guido Pagano, Paul W Hess, Antonis Kyprianidis, Patrick Becker, Harvey Kaplan, Alexey V Gorshkov, Z-X Gong, and Christopher Monroe. 2017. Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator.Nature551, 7682 (2017), 601–604

  214. [225]

    Alwin Zulehner, Alexandru Paler, and Robert Wille. 2018. An efficient methodology for mapping quantum circuits to the IBM QX architectures.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems38, 7 (2018), 1226–1236

  215. [226]

    2020.Introducing design automation for quantum computing

    Alwin Zulehner and Robert Wille. 2020.Introducing design automation for quantum computing. Vol. 11. Springer

  216. [228]

    Chenghong Zhu, Xian Wu, Hao-Kai Zhang, Sixuan Wu, Guangxi Li, and Xin Wang. 2025. Scalable Quantum Architecture Search via Landscape Analysis.arXiv preprint arXiv:2505.05380(2025)

  217. [230]

    Pengcheng Zhu, Weiping Ding, Lihua Wei, Xueyun Cheng, Zhijin Guan, and Shiguang Feng. 2023. A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-agent Cooperation.IEEE Trans. Comput.(2023)

  218. [233]

    Wei Zi, Junhong Nie, and Xiaoming Sun. 2025. Shallow quantum circuit implementation of symmetric functions with limited ancillary qubits.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2025)

  219. [2001]

    Dipole blockade and quantum information processing in mesoscopic atomic ensembles.Physical review letters 87, 3 (2001), 037901

  220. [2018]

    Mapping of lattice surgery-based quantum circuits on surface code architectures.Quantum Science and Technology4, 1 (2018), 015005

  221. [2020]

    arXiv:1910.01500 [cs.LG] https://arxiv.org/abs/1910.01500

    MLPerf Training Benchmark. arXiv:1910.01500 [cs.LG] https://arxiv.org/abs/1910.01500

  222. [2021]

    In2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA)

    Exploiting long-distance interactions and tolerating atom loss in neutral atom quantum architectures. In2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA). IEEE, 818–831

  223. [2023]

    The battle of clean and dirty qubits in the era of partial error correction.Quantum7 (2023), 1060

  224. [2024]

    High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5 D Architecture.arXiv preprint arXiv:2411.17519(2024)

Pith tools

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