On the public citation graph
Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
0 signed · 54 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.1002/rsa.10090openalex-snapshot
The computational complexity of two‐state spin systems
inferredcites →https://doi.org/10.1007/bf01342928openalex-snapshot
Die lange Reichweite der regelmäßigen Atomanordnung in Mischkristallen
inferredcites →https://doi.org/10.1007/bf02980577openalex-snapshot
Beitrag zur Theorie des Ferromagnetismus
inferredcites →https://doi.org/10.1007/s00373-003-0534-zopenalex-snapshot
On Graphs Determined by Their Tutte Polynomials
inferredcites →https://doi.org/10.1016/0003-4916(61)90115-4openalex-snapshot
Two soluble models of an antiferromagnetic chain
inferredcites →https://doi.org/10.1016/0009-2614(94)00117-0openalex-snapshot
Quantum annealing: A new method for minimizing multidimensional functions
inferredcites →https://doi.org/10.1016/0031-8914(72)90045-6openalex-snapshot
On the random-cluster model
inferredcites →https://doi.org/10.1016/j.dam.2009.02.021openalex-snapshot
The bivariate Ising polynomial of a graph
inferredcites →https://doi.org/10.1016/j.ejc.2011.03.012openalex-snapshot
Distinguishing graphs by their left and right homomorphism profiles
inferredcites →https://doi.org/10.1016/j.jctb.2006.04.002openalex-snapshot
Symmetric squares of graphs
inferredcites →https://doi.org/10.1016/s0024-3795(03)00483-xopenalex-snapshot
Which graphs are determined by their spectrum?
inferredcites →https://doi.org/10.1017/s0963548312000259openalex-snapshot
Complexity of Ising Polynomials
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.1080/00029890.1966.11970915openalex-snapshot
Can One Hear the Shape of a Drum?
inferredcites →https://doi.org/10.1080/00029890.1987.12000742openalex-snapshot
An Introduction to the Ising Model
inferredcites →https://doi.org/10.1088/0305-4470/34/31/301openalex-snapshot
Can one hear the shape of a graph?
inferredcites →https://doi.org/10.1088/1367-2630/14/12/123016openalex-snapshot
Quantum adiabatic Markovian master equations
inferredcites →https://doi.org/10.1103/physreva.81.052313openalex-snapshot
Two-particle quantum walks applied to the graph isomorphism problem
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/physreve.58.5355openalex-snapshot
Quantum annealing in the transverse Ising model
inferredcites →https://doi.org/10.1126/science.1068774openalex-snapshot
Theory of Quantum Annealing of an Ising Spin Glass
inferredcites →https://doi.org/10.1126/science.284.5415.779openalex-snapshot
Quantum Annealing of a Disordered Magnet
inferredcites →https://doi.org/10.1137/s0097539705447323openalex-snapshot
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
inferredcites →https://doi.org/10.37236/1060openalex-snapshot
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant
inferredcites →https://doi.org/10.4153/cjm-1954-010-9openalex-snapshot
A Contribution to the Theory of Chromatic Polynomials
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cphc.201600781openalex-snapshot
Quantum Computation using Arrays of N Polar Molecules in Pendular States
inferred← citeshttps://doi.org/10.1002/qute.202300330openalex-snapshot
Quantum Parallel Training of a Boltzmann Machine on an Adiabatic Quantum Computer
inferred← citeshttps://doi.org/10.1007/978-981-19-9530-9_19openalex-snapshot
Quantum Machine Learning in Prediction of Breast Cancer
inferred← citeshttps://doi.org/10.1038/ncomms10327openalex-snapshot
Computational multiqubit tunnelling in programmable quantum annealers
inferred← citeshttps://doi.org/10.1038/npjqi.2016.17openalex-snapshot
Nested quantum annealing correction
inferred← citeshttps://doi.org/10.1038/s41534-022-00580-wopenalex-snapshot
Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
inferred← citeshttps://doi.org/10.1038/s41598-019-49699-5openalex-snapshot
Analog Coupled Oscillator Based Weighted Ising Machine
inferred← citeshttps://doi.org/10.1038/srep11168openalex-snapshot
Experimental quantum annealing: case study involving the graph isomorphism problem
inferred← citeshttps://doi.org/10.1038/srep22318openalex-snapshot
Maximum-Entropy Inference with a Programmable Annealer
inferred← citeshttps://doi.org/10.1038/srep33957openalex-snapshot
Solving Set Cover with Pairs Problem using Quantum Annealing
inferred← citeshttps://doi.org/10.1039/d2cp00380eopenalex-snapshot
Realization of Heisenberg models of spin systems with polar molecules in pendular states
inferred← citeshttps://doi.org/10.1088/1367-2630/aa59c4openalex-snapshot
Modernizing quantum annealing using local searches
inferred← citeshttps://doi.org/10.1103/physreva.102.032622openalex-snapshot
Discriminating nonisomorphic graphs with an experimental quantum annealer
inferred← citeshttps://doi.org/10.1103/physreva.102.062606openalex-snapshot
Fluctuation-guided search in quantum annealing
inferred← citeshttps://doi.org/10.1103/physreva.91.042314openalex-snapshot
Consistency tests of classical and quantum models for a quantum annealer
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.95.022308openalex-snapshot
Quantum-annealing correction at finite temperature: Ferromagnetic p -spin models
inferred← citeshttps://doi.org/10.1103/physreva.97.022308openalex-snapshot
Scalable effective-temperature reduction for quantum annealers via nested quantum annealing correction
inferred← citeshttps://doi.org/10.1103/physrevx.6.031015openalex-snapshot
What is the Computational Value of Finite-Range Tunneling?
inferred← citeshttps://doi.org/10.1109/access.2022.3188117openalex-snapshot
Implementation of Quantum Annealing: A Systematic Review
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.113openalex-snapshot
Performance Models for Split-Execution Computing Systems
inferred← citeshttps://doi.org/10.26565/2220-637x-2024-42-06openalex-snapshot
On structural invariants of energy spectrum of S=1 Heisenberg antiferromagnets with single-ion anisotropy
inferred← citeshttps://doi.org/10.3389/fphy.2014.00079openalex-snapshot
Adiabatic quantum optimization for associative memory recall
inferred← citeshttps://doi.org/10.4204/eptcs.214.4openalex-snapshot
An Overview of Approaches to Modernize Quantum Annealing Using Local Searches
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.