On the public citation graph

Physically-motivated dynamical algorithms for the graph isomorphism problem

https://doi.org/10.26421/qic5.6-7
0 signed · 58 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/jcc.540121012openalex-snapshot
The graph isomorphism problem
inferredcites →https://doi.org/10.1007/3-540-11493-9openalex-snapshot
Group-Theoretic Algorithms and Graph Isomorphism
inferredcites →https://doi.org/10.1007/978-1-4614-1939-6_12openalex-snapshot
Distance-Regular Graphs
inferredcites →https://doi.org/10.1016/0020-0190(71)90019-6openalex-snapshot
A V2 algorithm for determining isomorphism of planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(79)90004-8openalex-snapshot
A note on the graph isomorphism counting problem
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0022-0000(88)90010-4openalex-snapshot
Graph isomorphism is in the low hierarchy
inferredcites →https://doi.org/10.1016/c2014-0-03412-0openalex-snapshot
Latin Squares and their Applications
inferredcites →https://doi.org/10.1103/physreva.65.012322openalex-snapshot
Robustness of adiabatic quantum computation
inferredcites →https://doi.org/10.1103/physreva.65.042308openalex-snapshot
Quantum search by local adiabatic evolution
inferredcites →https://doi.org/10.1109/sfcs.2005.73openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling
inferredcites →https://doi.org/10.1126/science.1057726openalex-snapshot
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
inferredcites →https://doi.org/10.1137/s009753970139450xopenalex-snapshot
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
inferredcites →https://doi.org/10.1137/s0895480191196769openalex-snapshot
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
inferredcites →https://doi.org/10.1145/380752.380769openalex-snapshot
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
inferredcites →https://doi.org/10.1145/509907.509999openalex-snapshot
Quantum lower bound for the collision problem
inferredcites →https://doi.org/10.1145/780542.780546openalex-snapshot
Adiabatic quantum state generation and statistical zero knowledge
inferredcites →https://doi.org/10.1145/800061.808746openalex-snapshot
Canonical labeling of graphs
inferredcites →https://doi.org/10.1145/800070.802206openalex-snapshot
Isomorphism of graphs with bounded eigenvalue multiplicity
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0209112openalex-snapshot
Graph equivalence and characterization via a continuous evolution of a physical analog
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0206068openalex-snapshot
Constructing physically intuitive graph invariants
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0501066openalex-snapshot
The Symmetric Group Defies Strong Fourier Sampling: Part II
inferredcites →https://doi.org/10.7939/r3sx64c5kopenalex-snapshot
The Graph Isomorphism Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11128-010-0205-yopenalex-snapshot
Quantum walks, Ihara zeta functions and cospectrality in regular graphs
inferred← citeshttps://doi.org/10.1007/s11128-011-0250-1openalex-snapshot
On the relation between quantum walks and zeta functions
inferred← citeshttps://doi.org/10.1016/j.cjph.2021.09.020openalex-snapshot
Entanglement entropy in the ground state of supersymmetric fermion lattice models
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112412openalex-snapshot
A zeta function related to the transition matrix of the discrete-time quantum walk on a graph
inferred← citeshttps://doi.org/10.1016/j.imavis.2008.10.013openalex-snapshot
Graph matching using the interference of discrete-time quantum walks
inferred← citeshttps://doi.org/10.1016/j.patcog.2008.09.001openalex-snapshot
Graph matching using the interference of continuous-time quantum walks
inferred← citeshttps://doi.org/10.1088/1367-2630/13/3/033029openalex-snapshot
Directional correlations in quantum walks with two particles
inferred← citeshttps://doi.org/10.1088/1742-5468/2015/08/p08013openalex-snapshot
Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
inferred← citeshttps://doi.org/10.1088/1751-8113/41/7/075303openalex-snapshot
A classical approach to the graph isomorphism problem using quantum walks
inferred← citeshttps://doi.org/10.1088/1751-8113/45/4/045305openalex-snapshot
An enhanced classical approach to graph isomorphism using continuous-time quantum walk
inferred← citeshttps://doi.org/10.1088/1751-8113/47/32/325302openalex-snapshot
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
inferred← citeshttps://doi.org/10.1088/1751-8121/aadfa2openalex-snapshot
Two-particle coined-quantum walk with long-range interaction
inferred← citeshttps://doi.org/10.1103/physreva.81.052313openalex-snapshot
Two-particle quantum walks applied to the graph isomorphism problem
inferred← citeshttps://doi.org/10.1103/physreva.83.042317openalex-snapshot
Two-particle quantum walks: Entanglement and graph isomorphism testing
inferred← citeshttps://doi.org/10.1103/physreva.85.062313openalex-snapshot
Encoding graphs into quantum states: An axiomatic approach
inferred← citeshttps://doi.org/10.1103/physreva.86.022334openalex-snapshot
Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs
inferred← citeshttps://doi.org/10.1103/physreva.86.042310openalex-snapshot
Solving the graph-isomorphism problem with a quantum annealer
inferred← citeshttps://doi.org/10.1103/physreva.94.062317openalex-snapshot
Decoherence-enhanced performance of quantum walks applied to graph isomorphism testing
inferred← citeshttps://doi.org/10.1103/physreva.98.012320openalex-snapshot
Complexity bounds on quantum search algorithms in finite-dimensional networks
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/tmc.2017.2722413openalex-snapshot
Unambiguous Association of Crowd-Sourced Radio Maps to Floor Plans for Indoor Localization
inferred← citeshttps://doi.org/10.1126/sciadv.abb8375openalex-snapshot
Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor
inferred← citeshttps://doi.org/10.1140/epjp/i2017-11805-1openalex-snapshot
Entanglement entropy of free fermions on directed graphs
inferred← citeshttps://doi.org/10.1186/s40736-014-0009-6openalex-snapshot
A remark on zeta functions of finite graphs via quantum walks
inferred← citeshttps://doi.org/10.34133/icomputing.0097openalex-snapshot
Quantum Walk Computing: Theory, Implementation, and Application
inferred← citeshttps://doi.org/10.37236/1060openalex-snapshot
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant
inferred← citeshttps://doi.org/10.37236/652openalex-snapshot
Quantum Walks on Regular Graphs and Eigenvalues
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4987openalex-snapshot
A note on the discrete-time evolutions of quantum walk on a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1553openalex-snapshot
A remark on zeta functions of finite graphs via quantum walks
inferred← citeshttps://doi.org/10.48550/arxiv.1901.06530openalex-snapshot
The quantum algorithm for graph isomorphism problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0701033openalex-snapshot
Graph identification by quantum walks
inferred← citeshttps://doi.org/10.5109/1957499openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.5555/2011781.2011785openalex-snapshot
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
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.