On the public citation graph
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
0 signed · 83 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
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-02873-5openalex-snapshot
Qubits’ mapping and routing for NISQ on variability of quantum gates
inferredcites →https://doi.org/10.1016/j.vlsi.2019.10.004openalex-snapshot
Optimization of quantum circuit mapping using gate transformation and commutation
inferredcites →https://doi.org/10.1017/cbo9780511976667openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1038/s41598-018-23764-xopenalex-snapshot
Efficient decomposition methods for controlled-R n using a single ancillary qubit
inferredcites →https://doi.org/10.1088/2058-9565/aaa331openalex-snapshot
Compiling quantum circuits to realistic hardware architectures using temporal planners
inferredcites →https://doi.org/10.1088/2058-9565/aacf0bopenalex-snapshot
Two-step approach to scheduling quantum circuits
inferredcites →https://doi.org/10.1088/2058-9565/ab8e92openalex-snapshot
t|ket⟩: a retargetable compiler for NISQ devices
inferredcites →https://doi.org/10.1088/2058-9565/abe519openalex-snapshot
Demonstration of quantum volume 64 on a superconducting quantum computing system
inferredcites →https://doi.org/10.1103/physrevapplied.12.054023openalex-snapshot
Suppression of Qubit Crosstalk in a Tunable Coupling Superconducting Circuit
inferredcites →https://doi.org/10.1103/physrevx.10.011022openalex-snapshot
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
inferredcites →https://doi.org/10.1109/aspdac.2014.6742939openalex-snapshot
Optimal SWAP gate insertion for nearest neighbor quantum circuits
inferredcites →https://doi.org/10.1109/aspdac.2014.6742940openalex-snapshot
Qubit placement to minimize communication overhead in 2D quantum architectures
inferredcites →https://doi.org/10.1109/aspdac.2015.7059001openalex-snapshot
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
inferredcites →https://doi.org/10.1109/aspdac.2016.7428026openalex-snapshot
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits
inferredcites →https://doi.org/10.1109/dac18072.2020.9218561openalex-snapshot
Codar: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices
inferredcites →https://doi.org/10.1109/dac56929.2023.10247760openalex-snapshot
Scalable Optimal Layout Synthesis for NISQ Quantum Processors
inferredcites →https://doi.org/10.1109/hpca53966.2022.00058openalex-snapshot
Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing
inferredcites →https://doi.org/10.1109/iccad51958.2021.9643554openalex-snapshot
Optimal qubit mapping with simultaneous gate absorption
inferredcites →https://doi.org/10.1109/iscas.2019.8702439openalex-snapshot
Reducing the Overhead of Mapping Quantum Circuits to IBM Q System
inferredcites →https://doi.org/10.1109/ismvl.2008.43openalex-snapshot
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
inferredcites →https://doi.org/10.1109/ismvl.2019.00010openalex-snapshot
CNOT Gate Mappings to Clifford+T Circuits in IBM Architectures
inferredcites →https://doi.org/10.1109/mcas.2016.2549950openalex-snapshot
Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures
inferredcites →https://doi.org/10.1109/micro50266.2020.00028openalex-snapshot
Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation
inferredcites →https://doi.org/10.1109/micro56248.2022.00077openalex-snapshot
Qubit Mapping and Routing via MaxSAT
inferredcites →https://doi.org/10.1109/mnet.2015.7293307openalex-snapshot
Quantum cryptography and its applications over the internet
inferredcites →https://doi.org/10.1109/qce60285.2024.10392openalex-snapshot
Qsyn: A Developer-Friendly Quantum Circuit Synthesis Framework for NISQ Era and Beyond
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/tcad.2014.2356463openalex-snapshot
Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures
inferredcites →https://doi.org/10.1109/tcad.2018.2846658openalex-snapshot
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
inferredcites →https://doi.org/10.1109/tcad.2020.2970594openalex-snapshot
A Dynamic Look-Ahead Heuristic for the Qubit Mapping Problem of NISQ Computers
inferredcites →https://doi.org/10.1109/tcad.2021.3057583openalex-snapshot
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
inferredcites →https://doi.org/10.1109/tqe.2020.3026544openalex-snapshot
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
inferredcites →https://doi.org/10.1109/tqe.2022.3164716openalex-snapshot
Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/2463209.2488785openalex-snapshot
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
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.3287701openalex-snapshot
Quantum circuit compilers using gate commutation rules
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.3304007openalex-snapshot
Not All Qubits Are Created Equal
inferredcites →https://doi.org/10.1145/3297858.3304023openalex-snapshot
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
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/3316781.3317859openalex-snapshot
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
inferredcites →https://doi.org/10.1145/3352460.3358287openalex-snapshot
A Case for Multi-Programming Quantum Computers
inferredcites →https://doi.org/10.1145/3373376.3378477openalex-snapshot
Software Mitigation of Crosstalk on 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/3400302.3415620openalex-snapshot
Optimal layout synthesis for quantum computing
inferredcites →https://doi.org/10.1145/3466752.3480044openalex-snapshot
JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
inferredcites →https://doi.org/10.1145/3466752.3480059openalex-snapshot
ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
inferredcites →https://doi.org/10.1145/3520434openalex-snapshot
Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
inferredcites →https://doi.org/10.1145/3550488openalex-snapshot
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
inferredcites →https://doi.org/10.1145/3593594openalex-snapshot
On Optimal Subarchitectures for Quantum Circuit Mapping
inferredcites →https://doi.org/10.4204/eptcs.318.14openalex-snapshot
PyZX: Large Scale Automated Diagrammatic Reasoning
inferredcites →https://doi.org/10.4230/lipics.tqc.2019.3openalex-snapshot
Circuit Transformations for Quantum Architectures
inferredcites →https://doi.org/10.48550/arxiv.1112.0564openalex-snapshot
Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning
inferredcites →https://doi.org/10.48550/arxiv.2011.04672openalex-snapshot
Principles of Quantum Communication Theory: A Modern Approach
inferredcites →https://doi.org/10.48550/arxiv.2104.05214openalex-snapshot
Quantum Circuit Transformation Based on Tabu Search
inferredcites →https://doi.org/10.48550/arxiv.2206.10880openalex-snapshot
VeriQBench: A Benchmark for Multiple Types of Quantum Circuits
inferredcites →https://doi.org/10.5555/2011528.2011531openalex-snapshot
Shor's discrete logarithm quantum algorithm for elliptic curves
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-77941-1_24openalex-snapshot
A Parallel Genetic Algorithm for Qubit Mapping on Noisy Intermediate-Scale Quantum Machines
inferred← citeshttps://doi.org/10.1007/978-3-032-14163-7_19openalex-snapshot
Quantum Circuits Compilation for Superconducting Quantum Processing Units: A Systematic Mapping Study
inferred← citeshttps://doi.org/10.1007/978-3-032-27927-9_14openalex-snapshot
Quantum Circuit Compilation for IQM Spark
inferred← citeshttps://doi.org/10.1007/978-3-032-36868-3_12openalex-snapshot
Volumetric Benchmarking of IQM-Spark: Parity-Preserving Quantum Volume and Compilation Overheads in Odra 5
inferred← citeshttps://doi.org/10.1007/978-3-032-37936-8_15openalex-snapshot
Exact Routing Algorithm for Quantum Circuit Compilation for Star Architectures
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.112081openalex-snapshot
A parallel memetic algorithm for qubit mapping on noisy intermediate-scale quantum machines
inferred← citeshttps://doi.org/10.1016/j.future.2026.108485openalex-snapshot
GraMA: A gradient matrix-guided assignment method for solving qubit mapping problems
inferred← citeshttps://doi.org/10.1016/j.swevo.2025.101923openalex-snapshot
Quantum circuit mapping based on discrete particle swarm optimization and deep reinforcement learning
inferred← citeshttps://doi.org/10.1038/s41598-026-51033-9openalex-snapshot
Parameterized quantum random number generators for superconducting quantum hardware: novel architectures and NIST SP 800-22 evaluation under IBM noisy simulators
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/qce60285.2024.10392openalex-snapshot
Qsyn: A Developer-Friendly Quantum Circuit Synthesis Framework for NISQ Era and Beyond
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00059openalex-snapshot
Bifrost: Topology-Aware Approximate Compilation of Variational Quantum Algorithms
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00085openalex-snapshot
Improving Quantum Compilation via Circuit Partitioning and Floorplanning
inferred← citeshttps://doi.org/10.1109/qsw67625.2025.00018openalex-snapshot
Enhancing Quantum Circuit Compilation with Modular Floorplanning
inferred← citeshttps://doi.org/10.1109/qsw72780.2026.00024openalex-snapshot
Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2025.3626447openalex-snapshot
A Framework for Dynamic Quantum Circuit Execution: Balancing Effectiveness and Efficiency
inferred← citeshttps://doi.org/10.1109/tqe.2025.3548423openalex-snapshot
Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture
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.