On the public citation graph
Quantum Circuit Transformation: A Monte Carlo Tree Search Framework
0 signed · 60 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/11871842_29openalex-snapshot
Bandit Based Monte-Carlo Planning
inferredcites →https://doi.org/10.1007/978-3-030-14082-3_18openalex-snapshot
On the Influence of Initial Qubit Placement During NISQ Circuit Compilation
inferredcites →https://doi.org/10.1007/978-3-319-93031-2_32openalex-snapshot
Greedy Randomized Search for Scalable Compilation of Quantum Circuits
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.1038/nature16961openalex-snapshot
Mastering the game of Go with deep neural networks and tree search
inferredcites →https://doi.org/10.1038/nature24270openalex-snapshot
Mastering the game of Go without human knowledge
inferredcites →https://doi.org/10.1038/s41586-019-1666-5openalex-snapshot
Quantum supremacy using a programmable superconducting processor
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/aaa5ccopenalex-snapshot
A software methodology for compiling quantum programs
inferredcites →https://doi.org/10.1088/2058-9565/ab79b1openalex-snapshot
Quantum circuit optimizations for NISQ architectures
inferredcites →https://doi.org/10.1088/2058-9565/ab8e92openalex-snapshot
t|ket⟩: a retargetable compiler for NISQ devices
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/tc.2020.3009140openalex-snapshot
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
inferredcites →https://doi.org/10.1109/tc.2020.3023247openalex-snapshot
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
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.2969647openalex-snapshot
Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
inferredcites →https://doi.org/10.1109/tcad.2022.3179223openalex-snapshot
Supervised Learning Enhanced Quantum Circuit Transformation
inferredcites →https://doi.org/10.1109/tcad.2022.3213210openalex-snapshot
Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures
inferredcites →https://doi.org/10.1109/tciaig.2012.2186810openalex-snapshot
A Survey of Monte Carlo Tree Search Methods
inferredcites →https://doi.org/10.1109/tqe.2021.3068355openalex-snapshot
Survey on Quantum Circuit Compilation for Noisy Intermediate-Scale Quantum Computers: Artificial Intelligence to Heuristics
inferredcites →https://doi.org/10.1142/s1793005708001094openalex-snapshot
PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
inferredcites →https://doi.org/10.1145/3287624.3287701openalex-snapshot
Quantum circuit compilers using gate commutation rules
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/3338852.3339829openalex-snapshot
Finding optimal qubit permutations for IBM's quantum computer architectures
inferredcites →https://doi.org/10.1145/3360546openalex-snapshot
Qubit allocation as a combination of subgraph isomorphism and token swapping
inferredcites →https://doi.org/10.1145/3386162openalex-snapshot
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
inferredcites →https://doi.org/10.1145/3394885.3431604openalex-snapshot
Exploiting Quantum Teleportation in Quantum Circuit Mapping
inferredcites →https://doi.org/10.1145/3400302.3415621openalex-snapshot
A monte carlo tree search framework for quantum circuit transformation
inferredcites →https://doi.org/10.1145/3520434openalex-snapshot
Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017707openalex-snapshot
An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem
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.48550/arxiv.1810.08291openalex-snapshot
Qubit Allocation for Noisy Intermediate-Scale Quantum Computers
inferredcites →https://doi.org/10.48550/arxiv.2002.07289openalex-snapshot
A Depth-Aware Swap Insertion Scheme for the Qubit Mapping Problem
inferredcites →https://doi.org/10.5281/zenodo.2562110openalex-snapshot
Qiskit: An Open-source Framework for Quantum Computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781394238118.ch15openalex-snapshot
Role of QML in 6G Integrated Vehicular Networks
inferred← citeshttps://doi.org/10.1007/s11128-024-04342-9openalex-snapshot
Error mitigation using quantum neural Q network in secure qutrit distribution on Cleve's protocol on quantum computing
inferred← citeshttps://doi.org/10.1007/s11128-025-04648-2openalex-snapshot
Physical synthesis of quantum circuits using Q-learning
inferred← citeshttps://doi.org/10.1007/s11433-022-2057-yopenalex-snapshot
Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.129111openalex-snapshot
Hybrid classical–quantum neural networks enhanced by quantum architecture search for coronary artery stenosis detection
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.1088/1367-2630/ace077openalex-snapshot
Exploring ab initio machine synthesis of quantum circuits
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/iccad66269.2025.11240960openalex-snapshot
An Efficient Routing Optimization Framework for Silicon-Based Spin-Qubit Devices
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00112openalex-snapshot
AlphaRouter: Quantum Circuit Routing with Reinforcement Learning and Tree Search
inferred← citeshttps://doi.org/10.1109/tcad.2022.3179223openalex-snapshot
Supervised Learning Enhanced Quantum Circuit Transformation
inferred← citeshttps://doi.org/10.1109/tcad.2024.3387290openalex-snapshot
Efficient Qubit Routing Using a Dynamically Extract-and-Route Framework
inferred← citeshttps://doi.org/10.1109/tqe.2025.3527399openalex-snapshot
Benchmarking Quantum Circuit Transformation With QKNOB Circuits
inferred← citeshttps://doi.org/10.1145/3764386.3779586openalex-snapshot
Timing-Aware End-to-End Circuit Compilation Framework for Modular Quantum Systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4194374/v1openalex-snapshot
Design and Analysis of Quantum Transfer Fractal Priority Replay with Dynamic Memory (QTFPR-DM) algorithm to Enhancing Robotic Decision-Making by Quantum computing
inferred← citeshttps://doi.org/10.3390/app15116373openalex-snapshot
QELPS Algorithm: A Novel Dynamic Optimization Technology for Quantum Circuits Scheduling Engineering Problems
inferred← citeshttps://doi.org/10.3390/e25060855openalex-snapshot
Suppression of Crosstalk in Quantum Circuit Based on Instruction Exchange Rules and Duration
inferred← citeshttps://doi.org/10.4204/eptcs.394.18openalex-snapshot
Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation
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.