On the public citation graph

Qubit allocation as a combination of subgraph isomorphism and token swapping

0 signed · 107 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.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/11575467_21openalex-snapshot
Register Allocation Via Coloring of Chordal Graphs
inferredcites →https://doi.org/10.1007/978-3-319-07890-8_31openalex-snapshot
Swapping Labeled Tokens on Graphs
inferredcites →https://doi.org/10.1007/978-3-319-53925-6_35openalex-snapshot
The Time Complexity of the Token Swapping Problem and Its Parallel Variants
inferredcites →https://doi.org/10.1038/299802a0openalex-snapshot
A single quantum cannot be cloned
inferredcites →https://doi.org/10.1038/nature14270openalex-snapshot
State preservation by repetitive error detection in a superconducting quantum circuit
inferredcites →https://doi.org/10.1088/2058-9565/aaa5ccopenalex-snapshot
A software methodology for compiling quantum programs
inferredcites →https://doi.org/10.1088/2058-9565/aadd1aopenalex-snapshot
Mapping of lattice surgery-based quantum circuits on surface code architectures
inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot
On a routing problem
inferredcites →https://doi.org/10.1103/physreva.52.3457openalex-snapshot
Elementary gates for quantum computation
inferredcites →https://doi.org/10.1103/physreva.64.022312openalex-snapshot
Quantum network optimization
inferredcites →https://doi.org/10.1103/physreva.94.032329openalex-snapshot
Performing quantum computing experiments in the cloud
inferredcites →https://doi.org/10.1103/physrevlett.112.190504openalex-snapshot
Fast Accurate State Measurement with Superconducting Qubits
inferredcites →https://doi.org/10.1103/physrevlett.121.060502openalex-snapshot
Fast and Unconditional All-Microwave Reset of a Superconducting Qubit
inferredcites →https://doi.org/10.1109/2.976922openalex-snapshot
A practical architecture for reliable quantum computers
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/ictai.2018.00096openalex-snapshot
Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT
inferredcites →https://doi.org/10.1109/inis.2015.59openalex-snapshot
Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization
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/mc.2006.4openalex-snapshot
A layered software architecture for quantum computing design tools
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/tcad.2008.917562openalex-snapshot
Quantum Circuit Placement
inferredcites →https://doi.org/10.1109/tcad.2013.2244643openalex-snapshot
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
inferredcites →https://doi.org/10.1109/tcad.2017.2760511openalex-snapshot
Layout Synthesis for Topological Quantum Circuits With 1-D and 2-D 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.1109/tvlsi.2014.2337302openalex-snapshot
PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis
inferredcites →https://doi.org/10.1145/1278480.1278717openalex-snapshot
Quantum circuit placement
inferredcites →https://doi.org/10.1145/2463676.2465300openalex-snapshot
Turbo iso
inferredcites →https://doi.org/10.1145/2491956.2462177openalex-snapshot
Quipper
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.3304023openalex-snapshot
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.14778/1920841.1920887openalex-snapshot
On graph query optimization in large networks
inferredcites →https://doi.org/10.22331/q-2019-01-25-116openalex-snapshot
Optimising Matrix Product State Simulations of Shor's Algorithm
inferredcites →https://doi.org/10.23919/date.2018.8342181openalex-snapshot
Efficient mapping of quantum circuits to the IBM QX architectures
inferredcites →https://doi.org/10.4230/lipics.fscd.2026.12openalex-snapshot
Open Quantum Assembly Language
inferredcites →https://doi.org/10.48550/arxiv.1805.10224openalex-snapshot
A Case for Variability-Aware Policies for NISQ-Era Quantum Computers
inferredcites →https://doi.org/10.48550/arxiv.1807.10749openalex-snapshot
Quantum Supremacy Is Both Closer and Farther than It Appears
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0001113openalex-snapshot
Actual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins
inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot
On random graphs. I.

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-030-60239-0_28openalex-snapshot
A Quantum Computer Operating System
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_35openalex-snapshot
Algorithmic Theory of Qubit Routing
inferred← citeshttps://doi.org/10.1007/978-981-16-7487-7_12openalex-snapshot
Error-Tolerant Mapping for Quantum Computing
inferred← citeshttps://doi.org/10.1007/s10957-023-02229-wopenalex-snapshot
Improving Quantum Computation by Optimized Qubit Routing
inferred← citeshttps://doi.org/10.1007/s11128-025-04815-5openalex-snapshot
Qubit mapping: the adaptive divide-and-conquer approach
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.2025.107906openalex-snapshot
MLQM: Machine learning approach for accelerating optimal qubit mapping
inferred← citeshttps://doi.org/10.1038/s41534-024-00909-7openalex-snapshot
Lightcone bounds for quantum circuit mapping via uncomplexity
inferred← citeshttps://doi.org/10.1038/s41598-022-14767-wopenalex-snapshot
Scaling quantum approximate optimization on near-term hardware
inferred← citeshttps://doi.org/10.1051/ro/2023134openalex-snapshot
Polynomial time algorithms for the token swapping problem on cographs
inferred← citeshttps://doi.org/10.1088/2058-9565/abe665openalex-snapshot
NISQ circuit compilation is the travelling salesman problem on a torus
inferred← citeshttps://doi.org/10.1088/2058-9565/abf718openalex-snapshot
Optimal calibration of gates in trapped-ion quantum computers
inferred← citeshttps://doi.org/10.1103/3xc7-j3mnopenalex-snapshot
Efficient quantum circuit execution with continuous distribution of entanglement
inferred← citeshttps://doi.org/10.1103/physreva.108.022610openalex-snapshot
Optimizing quantum algorithms on bipotent architectures
inferred← citeshttps://doi.org/10.1103/physreva.109.012420openalex-snapshot
Mitigating fabrication errors by recovering defective syndrome qubits in surface code
inferred← citeshttps://doi.org/10.1103/physreva.110.032421openalex-snapshot
Improving the performance of digitized counterdiabatic quantum optimization via algorithm-oriented qubit mapping
inferred← citeshttps://doi.org/10.1103/physrevapplied.22.024029openalex-snapshot
Symmetry-based quantum circuit mapping
inferred← citeshttps://doi.org/10.1103/physrevapplied.23.034022openalex-snapshot
Algorithm-oriented qubit mapping for variational quantum algorithms
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00112openalex-snapshot
Minimizing Qubit Overhead in Error-Aware Distributed Quantum Computing
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133143openalex-snapshot
Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks
inferred← citeshttps://doi.org/10.1109/ets50041.2021.9465397openalex-snapshot
A Survey and Tutorial on Security and Resilience of Quantum Computing
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643478openalex-snapshot
Split Compilation for Security of Quantum Circuits
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323857openalex-snapshot
Effective and Efficient Qubit Mapper
inferred← citeshttps://doi.org/10.1109/micro56248.2022.00077openalex-snapshot
Qubit Mapping and Routing via MaxSAT
inferred← citeshttps://doi.org/10.1109/qce53715.2022.00040openalex-snapshot
Calibration-Aware Transpilation for Variational Quantum Optimization
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00094openalex-snapshot
Mapping Quantum Circuits to Modular Architectures with QUBO
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00224openalex-snapshot
Distributing Quantum Circuits with Minimum Circuit Execution Time over Quantum Networks
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00085openalex-snapshot
Improving Quantum Compilation via Circuit Partitioning and Floorplanning
inferred← citeshttps://doi.org/10.1109/qcnc69040.2026.00045openalex-snapshot
Online Scheduling and Distribution of Quantum Circuits Over Quantum Networks
inferred← citeshttps://doi.org/10.1109/qcs54837.2021.00009openalex-snapshot
Exploring Affine Abstractions for Qubit Mapping
inferred← citeshttps://doi.org/10.1109/qsw67625.2025.00018openalex-snapshot
Enhancing Quantum Circuit Compilation with Modular Floorplanning
inferred← citeshttps://doi.org/10.1109/tc.2020.3009140openalex-snapshot
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
inferred← citeshttps://doi.org/10.1109/tc.2020.3023247openalex-snapshot
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
inferred← citeshttps://doi.org/10.1109/tcad.2024.3500784openalex-snapshot
Effective and Efficient Parallel Qubit Mapper
inferred← citeshttps://doi.org/10.1109/tcad.2024.3507580openalex-snapshot
CAMEL: Physically Inspired Crosstalk-Aware Mapping and Gate Scheduling for Frequency-Tunable Quantum Chips
inferred← citeshttps://doi.org/10.1109/tcad.2025.3532818openalex-snapshot
DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation
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.3527399openalex-snapshot
Benchmarking Quantum Circuit Transformation With QKNOB Circuits
inferred← citeshttps://doi.org/10.1142/s0218126625502883openalex-snapshot
Optimizing Layout Synthesis for Quantum Computing Performance
inferred← citeshttps://doi.org/10.1145/3394885.3431605openalex-snapshot
Dynamical Decomposition and Mapping of MPMCT Gates to Nearest Neighbor Architectures
inferred← citeshttps://doi.org/10.1145/3400302.3415621openalex-snapshot
A monte carlo tree search framework for quantum circuit transformation
inferred← citeshttps://doi.org/10.1145/3445814.3446706openalex-snapshot
Time-optimal Qubit mapping
inferred← citeshttps://doi.org/10.1145/3465409openalex-snapshot
On the Impact of Affine Loop Transformations in Qubit Allocation
inferred← citeshttps://doi.org/10.1145/3497776.3517775openalex-snapshot
QRANE: lifting QASM programs to an affine IR
inferred← citeshttps://doi.org/10.1145/3514239openalex-snapshot
Quantum Circuit Transformation: A Monte Carlo Tree Search Framework
inferred← citeshttps://doi.org/10.1145/3565271openalex-snapshot
Machine Learning Optimization of Quantum Circuit Layouts
inferred← citeshttps://doi.org/10.1145/3582016.3582030openalex-snapshot
CaQR: A Compiler-Assisted Approach for Qubit Reuse through Dynamic Circuit
inferred← citeshttps://doi.org/10.1145/3623278.3624751openalex-snapshot
Exploiting the Regular Structure of Modern Quantum Architectures for Compiling and Optimizing Programs with Permutable Operators
inferred← citeshttps://doi.org/10.1145/3626184.3633316openalex-snapshot
SMT-Based Layout Synthesis Approaches for Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3695053.3731084openalex-snapshot
S-SYNC: Shuttle and Swap Co-Optimization in Quantum Charge-Coupled Devices
inferred← citeshttps://doi.org/10.1145/3720416openalex-snapshot
Dependency-Aware Compilation for Surface Code Quantum Architectures
inferred← citeshttps://doi.org/10.1145/3722119openalex-snapshot
Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures
inferred← citeshttps://doi.org/10.1145/3733842openalex-snapshot
Line-Graph Qubit Routing
inferred← citeshttps://doi.org/10.1145/3748261openalex-snapshot
Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation
inferred← citeshttps://doi.org/10.1145/3757069openalex-snapshot
DQC-QR: Distributing and Routing Quantum Circuits with Minimum Execution Time
inferred← citeshttps://doi.org/10.14778/3819518.3819552openalex-snapshot
Subgraph Enumeration: Beyond Tree Decomposition
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1050openalex-snapshot
An Efficient Method to Decompose and Map MPMCT Gates That Accounts for Qubit Placement
inferred← citeshttps://doi.org/10.3390/computation14090197openalex-snapshot
Scheduler-Boundary Observability in Shared Quantum Clouds: Compilation- and Backend-Conditioned Diagnostics
inferred← citeshttps://doi.org/10.3390/e27030232openalex-snapshot
A Beam Search Framework for Quantum Circuit Mapping
inferred← citeshttps://doi.org/10.36227/techrxiv.21786146openalex-snapshot
Algorithm-Aware Qubit Mapping
inferred← citeshttps://doi.org/10.36227/techrxiv.21786146.v1openalex-snapshot
Algorithm-Aware Qubit Mapping
inferred← citeshttps://doi.org/10.36227/techrxiv.21786146.v2openalex-snapshot
Algorithm-Aware Qubit Mapping
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03716openalex-snapshot
String Abstractions for Qubit Mapping
inferred← citeshttps://doi.org/10.5753/ctd.2020.11368openalex-snapshot
Qubit Allocation
inferred← citeshttps://doi.org/10.59254/sbpo-2020-122743openalex-snapshot
Integer Linear Programming Models for Sequential and Parallel Token Swaps in Graphs
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.