Graph matching using the interference of continuous-time quantum walks
From MaRDI portal
Recommendations
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
- An enhanced classical approach to graph isomorphism using continuous-time quantum walk
- Graph-Based Representations in Pattern Recognition
- On the relationship between continuous- and discrete-time quantum walk
- QUANTUM WALKS ON GENERAL GRAPHS
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1304334 (Why is no real title available?)
- scientific article; zbMATH DE number 1004939 (Why is no real title available?)
- scientific article; zbMATH DE number 2043363 (Why is no real title available?)
- scientific article; zbMATH DE number 1559521 (Why is no real title available?)
- scientific article; zbMATH DE number 2144695 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A classical approach to the graph isomorphism problem using quantum walks
- A distance measure between attributed relational graphs for pattern recognition
- A graph distance measure for image analysis
- An Algorithm for Subgraph Isomorphism
- An eigendecomposition approach to weighted graph matching problems
- An example of the difference between quantum and classical random walks
- Discrete quantum walks hit exponentially faster
- Exponential algorithmic speedup by a quantum walk
- Graph spectral image smoothing using the heat kernel
- Logical Approaches to Computational Barriers
- One-dimensional quantum walks
- Organization of Relational Models for Scene Analysis
- Physically-motivated dynamical algorithms for the graph isomorphism problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum walks on graphs
- Subgraph isomorphism, matching relational structures and maximal cliques
- The hidden subgroup problem and permutation group theory
Cited in
(16)- Graph-Based Representations in Pattern Recognition
- Local feature point extraction for quantum images
- Quantum walk and its application domains: a systematic review
- 3D shape retrieval using kernels on extended Reeb graphs
- scientific article; zbMATH DE number 5573019 (Why is no real title available?)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
- Graph Embedding Using Quantum Commute Times
- An enhanced classical approach to graph isomorphism using continuous-time quantum walk
- Similarity analysis from limiting quantum walks
- The Walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks
- Fast depth-based subgraph kernels for unattributed graphs
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
- Attributed graph similarity from the quantum Jensen-Shannon divergence
- Correlation between the continuous-time quantum walk and cliques in graphs and its application
- Graph kernels from the Jensen-Shannon divergence
This page was built for publication: Graph matching using the interference of continuous-time quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010111)
