On the public citation graph

On Optimal Subarchitectures for Quantum Circuit Mapping

https://doi.org/10.1145/3593594
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-72904-2openalex-snapshot
Evolutionary Computation in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-35656-8openalex-snapshot
Theory of Quantum Computation, Communication, and Cryptography
inferredcites →https://doi.org/10.1007/s11128-010-0201-2openalex-snapshot
Synthesis of quantum circuits for linear nearest neighbor architectures
inferredcites →https://doi.org/10.1007/s11128-020-02901-4openalex-snapshot
An exact qubit allocation approach for NISQ architectures
inferredcites →https://doi.org/10.1109/tc.2020.3009140openalex-snapshot
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
inferredcites →https://doi.org/10.1109/tcad.2020.3032072openalex-snapshot
Exploring the Potential Benefits of Alternative Quantum Computing Architectures
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1126/science.1231930openalex-snapshot
Superconducting Circuits for Quantum Information: An Outlook
inferredcites →https://doi.org/10.1145/1278480.1278717openalex-snapshot
Quantum circuit placement
inferredcites →https://doi.org/10.1145/3168822openalex-snapshot
Qubit allocation
inferredcites →https://doi.org/10.1145/3179541openalex-snapshot
Proceedings of the 2018 International Symposium on Code Generation and Optimization
inferredcites →https://doi.org/10.1145/3287624.3287704openalex-snapshot
Compiling SU(4) quantum circuits to IBM QX architectures
inferredcites →https://doi.org/10.1145/3297858.3304075openalex-snapshot
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
inferredcites →https://doi.org/10.1145/3394885.3431604openalex-snapshot
Exploiting Quantum Teleportation in Quantum Circuit Mapping
inferredcites →https://doi.org/10.1145/3520434openalex-snapshot
Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
inferredcites →https://doi.org/10.1145/3565271openalex-snapshot
Machine Learning Optimization of Quantum Circuit Layouts
inferredcites →https://doi.org/10.1145/3626184openalex-snapshot
Proceedings of the 2024 International Symposium on Physical Design
inferredcites →https://doi.org/10.1609/aaai.v36i9.21231openalex-snapshot
Qubit Routing Using Graph Neural Network Aided Monte Carlo Tree Search
inferredcites →https://doi.org/10.22331/q-2018-08-06-79openalex-snapshot
Quantum Computing in the NISQ era and beyond
inferredcites →https://doi.org/10.23919/date.2018.8342181openalex-snapshot
Efficient mapping of quantum circuits to the IBM QX architectures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/qute.202300289openalex-snapshot
Deep Reinforcement Learning for Mapping Quantum Circuits to 2D Nearest‐Neighbor Architectures
inferred← citeshttps://doi.org/10.1007/978-3-032-06770-8_10openalex-snapshot
Optimal Quantum Circuit Mapping
inferred← citeshttps://doi.org/10.1007/978-3-032-09303-5_5openalex-snapshot
Hardware-Aware Compilation for Different Quantum Computing Platforms
inferred← citeshttps://doi.org/10.1038/s41534-024-00909-7openalex-snapshot
Lightcone bounds for quantum circuit mapping via uncomplexity
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf098openalex-snapshot
An optimized sparrow search algorithm for quantum circuit mapping
inferred← citeshttps://doi.org/10.1109/access.2026.3716117openalex-snapshot
Noise-Field Sampling and Regime Transitions in Qubit Layout Selection: Hardware Evidence on IBM Superconducting Processors
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11394841openalex-snapshot
Dependence-Driven, Scalable Quantum Circuit Mapping with Affine Abstractions
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323924openalex-snapshot
Optimal Layout Synthesis for Quantum Circuits as Classical Planning
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240721openalex-snapshot
Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00182openalex-snapshot
Quantum Circuit Mapping Using Binary Integer Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00091openalex-snapshot
Reducing the Compilation Time of Quantum Circuits Using Pre-Compilation on the Gate Level
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00110openalex-snapshot
Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00126openalex-snapshot
Shuttling Compiler for a Trapped-Ion Quantum Computer Architecture with Junctions
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00070openalex-snapshot
Quantum Circuit Optimization for the Fault-Tolerance Era: Do We Have to Start from Scratch?
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00085openalex-snapshot
Improving Quantum Compilation via Circuit Partitioning and Floorplanning
inferred← citeshttps://doi.org/10.1109/qsw62656.2024.00013openalex-snapshot
The MQT Handbook : A Summary of Design Automation Tools and Software for Quantum Computing
inferred← citeshttps://doi.org/10.1109/qsw62656.2024.00028openalex-snapshot
Towards Application-Aware Quantum Circuit Compilation
inferred← citeshttps://doi.org/10.1109/tqe.2024.3374879openalex-snapshot
Testing and Debugging Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3569052.3578928openalex-snapshot
MQT QMAP
inferred← citeshttps://doi.org/10.1145/3649329.3655959openalex-snapshot
Hybrid Circuit Mapping: Leveraging the Full Spectrum of Computational Capabilities of Neutral Atom Quantum Computers
inferred← citeshttps://doi.org/10.1145/3673241openalex-snapshot
MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing
inferred← citeshttps://doi.org/10.1145/3680291openalex-snapshot
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0551openalex-snapshot
Optimized Noise Suppression for Quantum Circuits
inferred← citeshttps://doi.org/10.21105/joss.07478openalex-snapshot
MQT Core: The Backbone of the Munich Quantum Toolkit (MQT)
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4862662/v1openalex-snapshot
Genetic Algorithm Based Optimisation Framework for Quantum Circuit Mapping GAQCM
inferred← citeshttps://doi.org/10.23919/date64628.2025.10992761openalex-snapshot
Improving Figures of Merit for Quantum Circuit Compilation
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539523openalex-snapshot
Quantum Circuit Compilation for Superconducting Bus-Resonator Architectures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.