An enhanced classical approach to graph isomorphism using continuous-time quantum walk
From MaRDI portal
Recommendations
- A graph isomorphism algorithm using signatures computed via quantum walk search model
- A classical approach to the graph isomorphism problem using quantum walks
- Quantum walk inspired algorithm for graph similarity and isomorphism
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Graph matching using the interference of continuous-time quantum walks
Cited in
(12)- Graph matching using the interference of continuous-time quantum walks
- Local feature point extraction for quantum images
- Bosonic random walk neural networks for graph learning
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Solving problem of graph isomorphism by membrane-quantum hybrid model
- A classical approach to the graph isomorphism problem using quantum walks
- A graph isomorphism algorithm using signatures computed via quantum walk search model
- Correlation between the continuous-time quantum walk and cliques in graphs and its application
- Quantum walk inspired algorithm for graph similarity and isomorphism
- Percolation induced effects in two-dimensional coined quantum walks: analytic asymptotic solutions
- Phase-modified CTQW unable to distinguish strongly regular graphs efficiently
- Quantum walk on simplicial complexes for simplicial community detection
This page was built for publication: An enhanced classical approach to graph isomorphism using continuous-time quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3118829)