A classical approach to the graph isomorphism problem using quantum walks

DOI10.1088/1751-8113/41/7/075303zbMath1134.81013arXiv0705.2531OpenAlexW3103918967MaRDI QIDQ5454303

B. L. Douglas, Jingbo B. Wang

Publication date: 28 March 2008

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0705.2531

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Applications of graph theory to circuits and networks (94C15)

Related Items (24)

Efficient quantum circuits for Szegedy quantum walks ⋮ Graph isomorphism and Gaussian boson sampling ⋮ \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers ⋮ Quantum walks on two kinds of two-dimensional models ⋮ Discrete-time interacting quantum walks and quantum hash schemes ⋮ Quantum walk and its application domains: a systematic review ⋮ Discrete-time quantum walk algorithm for ranking nodes on a network ⋮ Szegedy quantum walks with memory on regular graphs ⋮ Quantum walks with memory provided by parity of memory ⋮ Quantum walk inspired algorithm for graph similarity and isomorphism ⋮ A systematic method to building Dirac quantum walks coupled to electromagnetic fields ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Three-state quantum walk on the Cayley graph of the dihedral group ⋮ Efficient quantum circuits for continuous-time quantum walks on composite graphs ⋮ Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation ⋮ \(Qcompiler\): quantum compilation with the CSD method ⋮ GPU-accelerated algorithms for many-particle continuous-time quantum walks ⋮ Two quantum coins sharing a walker ⋮ Local feature point extraction for quantum images ⋮ Quantum walks, Ihara zeta functions and cospectrality in regular graphs ⋮ Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Entanglement dynamics of two-particle quantum walks ⋮ Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices

This page was built for publication: A classical approach to the graph isomorphism problem using quantum walks