On the public citation graph
Experimental quantum annealing: case study involving the graph isomorphism problem
0 signed · 76 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/978-3-031-02518-1openalex-snapshot
Adiabatic Quantum Computation and Quantum Annealing
inferredcites →https://doi.org/10.1007/s11128-008-0082-9openalex-snapshot
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
inferredcites →https://doi.org/10.1007/s11128-014-0892-xopenalex-snapshot
A case study in programming a quantum annealer for hard operational planning problems
inferredcites →https://doi.org/10.1016/j.jsc.2013.09.003openalex-snapshot
Practical graph isomorphism, II
inferredcites →https://doi.org/10.1038/ncomms3067openalex-snapshot
Experimental signature of programmable quantum annealing
inferredcites →https://doi.org/10.1038/nphys2900openalex-snapshot
Evidence for quantum annealing with more than one hundred qubits
inferredcites →https://doi.org/10.1038/srep05703openalex-snapshot
Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
inferredcites →https://doi.org/10.1103/physreva.86.042310openalex-snapshot
Solving the graph-isomorphism problem with a quantum annealer
inferredcites →https://doi.org/10.1103/physreva.89.022342openalex-snapshot
Graph isomorphism and adiabatic quantum computing
inferredcites →https://doi.org/10.1103/physrevlett.108.010501openalex-snapshot
Ramsey Numbers and Adiabatic Quantum Computing
inferredcites →https://doi.org/10.1109/sfcs.2005.73openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferredcites →https://doi.org/10.1137/050644896openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferredcites →https://doi.org/10.1140/epjst/e2015-02346-0openalex-snapshot
Reexamining classical and quantum models for the D-Wave One processor
inferredcites →https://doi.org/10.1145/1497561.1497573openalex-snapshot
External memory layout vs. schematic
inferredcites →https://doi.org/10.1145/1857914.1857918openalex-snapshot
Limitations of quantum coset states for graph isomorphism
inferredcites →https://doi.org/10.2200/s00585ed1v01y201407qmc008openalex-snapshot
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferredcites →https://doi.org/10.48550/arxiv.1406.2741openalex-snapshot
A practical heuristic for finding graph minors
inferredcites →https://doi.org/10.48550/arxiv.1410.2628openalex-snapshot
Algorithm engineering for a quantum annealing platform
inferredcites →https://doi.org/10.48550/arxiv.1411.4036openalex-snapshot
Computational Role of Collective Tunneling in a Quantum Annealer
inferredcites →https://doi.org/10.5860/choice.50-5645openalex-snapshot
Limits of computation: an introduction to the undecidable and the intractable
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-030-20656-7_7openalex-snapshot
Layout-Aware Embedding for Quantum Annealing Processors
inferred← citeshttps://doi.org/10.1007/s10515-025-00493-wopenalex-snapshot
Quantum software engineering and potential of quantum computing in software engineering research: a review
inferred← citeshttps://doi.org/10.1007/s11128-016-1240-0openalex-snapshot
A comparison of approaches for finding minimum identifying codes on graphs
inferred← citeshttps://doi.org/10.1007/s11128-016-1394-9openalex-snapshot
Differential geometric treewidth estimation in adiabatic quantum computation
inferred← citeshttps://doi.org/10.1007/s11128-017-1586-yopenalex-snapshot
Enhancing quantum annealing performance for the molecular similarity problem
inferred← citeshttps://doi.org/10.1007/s11128-017-1639-2openalex-snapshot
A subgradient approach for constrained binary optimization via quantum adiabatic evolution
inferred← citeshttps://doi.org/10.1007/s11128-018-2117-1openalex-snapshot
Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
inferred← citeshttps://doi.org/10.1007/s11128-019-2213-xopenalex-snapshot
Practical integer-to-binary mapping for quantum annealers
inferred← citeshttps://doi.org/10.1007/s12065-026-01240-0openalex-snapshot
A quantum annealing approach to high-dimensional feature selection: QUBO formulation for stress tolerance modeling in genomic systems
inferred← citeshttps://doi.org/10.1007/s42979-020-00431-5openalex-snapshot
A New QUBO Objective Function for Solving the Maximum Common Subgraph Isomorphism Problem Via Quantum Annealing
inferred← citeshttps://doi.org/10.1016/j.geomorph.2021.107782openalex-snapshot
Historical flooding regime along the Amur River and its links to East Asia summer monsoon circulation
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104609openalex-snapshot
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.04.016openalex-snapshot
QUBO formulations for the graph isomorphism problem and related problems
inferred← citeshttps://doi.org/10.1038/s41598-017-11732-wopenalex-snapshot
Magnetoelectric oxide based stochastic spin device towards solving combinatorial optimization problems
inferred← citeshttps://doi.org/10.1038/s41598-019-50473-wopenalex-snapshot
Finding Hadamard Matrices by a Quantum Annealing Machine
inferred← citeshttps://doi.org/10.1038/s41598-021-03586-0openalex-snapshot
Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer
inferred← citeshttps://doi.org/10.1038/s41598-024-51639-xopenalex-snapshot
Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems
inferred← citeshttps://doi.org/10.1038/s41598-025-90520-3openalex-snapshot
GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling
inferred← citeshttps://doi.org/10.1038/srep25797openalex-snapshot
Quantum versus simulated annealing in wireless interference network optimization
inferred← citeshttps://doi.org/10.1063/5.0305337openalex-snapshot
Energy landscape structure of small graph isomorphism under variational optimization
inferred← citeshttps://doi.org/10.1103/physreva.106.052605openalex-snapshot
Basic elements for simulations of standard-model physics with quantum annealers: Multigrid and clock states
inferred← citeshttps://doi.org/10.1103/physreva.93.062312openalex-snapshot
Driver Hamiltonians for constrained optimization in quantum annealing
inferred← citeshttps://doi.org/10.1103/physreva.94.022327openalex-snapshot
Simulated-quantum-annealing comparison between all-to-all connectivity schemes
inferred← citeshttps://doi.org/10.1103/physreva.96.062330openalex-snapshot
Ising formulation of associative memory models and quantum annealing recall
inferred← citeshttps://doi.org/10.1103/physrevapplied.12.014004openalex-snapshot
Readiness of Quantum Optimization Machines for Industrial Applications
inferred← citeshttps://doi.org/10.1103/physrevapplied.5.034007openalex-snapshot
Quantum Annealing for Constrained Optimization
inferred← citeshttps://doi.org/10.1109/3dv50981.2020.00068openalex-snapshot
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
inferred← citeshttps://doi.org/10.1109/access.2022.3188117openalex-snapshot
Implementation of Quantum Annealing: A Systematic Review
inferred← citeshttps://doi.org/10.1109/access.2024.3431540openalex-snapshot
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1109/ccpqt60491.2023.00010openalex-snapshot
A Graph Isomorphism Algorithm based on Continuous-Time Quantum Walks
inferred← citeshttps://doi.org/10.1109/csde50874.2020.9411586openalex-snapshot
A QUBO Formulation For the K-densest Common Subgraph Isomorphism Problem Via Quantum Annealing
inferred← citeshttps://doi.org/10.1109/cvpr46437.2021.01292openalex-snapshot
Quantum Permutation Synchronization
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00018openalex-snapshot
Efficient Optimization with Encoded Ising Models
inferred← citeshttps://doi.org/10.1109/hpec.2016.7761619openalex-snapshot
Parameter setting for quantum annealers
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.113openalex-snapshot
Performance Models for Split-Execution Computing Systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00184openalex-snapshot
Neural Networks and Graph Algorithms with Next-Generation Processors
inferred← citeshttps://doi.org/10.1109/jetcas.2023.3243260openalex-snapshot
Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing
inferred← citeshttps://doi.org/10.1109/ojsp.2023.3329756openalex-snapshot
Local Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3159713openalex-snapshot
Fast-Converging Simulated Annealing for Ising Models Based on Integral Stochastic Computing
inferred← citeshttps://doi.org/10.1142/s2010324721400063openalex-snapshot
An Automatic Approach for Combinational Problems on a Hybrid Quantum Architecture
inferred← citeshttps://doi.org/10.1145/3569095openalex-snapshot
A Quantum Algorithm for the Sub-graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1145/3622758openalex-snapshot
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
inferred← citeshttps://doi.org/10.1515/spma-2020-0132openalex-snapshot
Graph isomorphism and Gaussian boson sampling
inferred← citeshttps://doi.org/10.21236/ada623530openalex-snapshot
A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.22331/q-2025-03-20-1663openalex-snapshot
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
inferred← citeshttps://doi.org/10.3389/fict.2016.00014openalex-snapshot
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis
inferred← citeshttps://doi.org/10.3390/e20020141openalex-snapshot
Finding a Hadamard Matrix by Simulated Quantum Annealing
inferred← citeshttps://doi.org/10.36548/rrrj.2023.2.007openalex-snapshot
Quantum-Inspired Algorithms for Market Clearing in Smart Grids: A Comprehensive Review
inferred← citeshttps://doi.org/10.48550/arxiv.2009.10151openalex-snapshot
TIGER: Topology-aware Assignment using Ising machines Application to Classical Algorithm Tasks and Quantum Circuit Gates
inferred← citeshttps://doi.org/10.48550/arxiv.2107.04032openalex-snapshot
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2111.09821openalex-snapshot
Energy Landscape Structure of Small Graph Isomorphism Under Variational Optimization
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.