REVIEW 9 cited by
Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems
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.
Forward citations
Cited by 9 Pith papers
-
Isolating Recurring Execution-Dependent Abnormal Patterns on NISQ Quantum Devices
QRisk isolates backend-specific abnormal error patterns on NISQ devices via delta debugging and mitigates them with commuting gate swaps, cutting excess noise by 24-45% on IBM backends where noise models predict no di...
-
M\"obius-Guided Diagonal-Gate Compilation with Native Multiqubit Controlled-Phase Gates on Neutral-Atom Processors
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.
-
Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization
Position graph abstraction with memoized SABRE heuristics scales qubit mapping and routing for TI-QCCD architectures by caching repeated evaluations without altering decisions.
-
Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration
WPGS algorithm enforces inter-frame phase continuity in holographic tweezers to suppress refresh-induced atom loss and speed up updates for large neutral-atom arrays.
-
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Canopus unifies qubit mapping and routing across quantum ISAs by modeling synthesis costs via canonical two-qubit gate forms, achieving 15-35% lower routing overhead than prior methods on varied backends and topologies.
-
M\"obius-Guided Diagonal-Gate Compilation with Native Multiqubit Controlled-Phase Gates on Neutral-Atom Processors
A Möbius-inversion compiler that preserves native multiqubit controlled-phase gates improves estimated success rates for diagonal circuits on neutral-atom hardware.
-
Structure-Aware Compilation for Scalable Neutral-Atom Quantum Computing
Algebraic rank-one decompositions and graph-theoretic transport scheduling reduce addressing layers by up to 2x and atom transports by ~50% for neutral-atom quantum circuits.
-
Joint Optimization of Qubit Leasing and Quantum Circuit Distribution
Formulates JQLQCD as ILP, proves NP-completeness, solves special cases in closed form or polynomial time, and evaluates a greedy algorithm with local search on large instances via numerical computations.
-
Swap Network Augmented Ans\"atze on Arbitrary Connectivity
By augmenting quantum circuit ansatze with optimized swap networks, the work achieves better performance in ground-state energy calculations using fewer resources on devices with arbitrary qubit connectivity.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.