A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
From MaRDI portal
Publication:2878633
DOI10.1088/1751-8113/47/32/325302zbMath1311.68071arXiv1401.1278OpenAlexW1978536401MaRDI QIDQ2878633
Luca Zanetti, Dario Tamascelli
Publication date: 4 September 2014
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1278
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (6)
Quantum walk and its application domains: a systematic review ⋮ Novel two-party quantum private comparison via quantum walks on circle ⋮ Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation ⋮ Constructing quantum hash functions based on quantum walks on Johnson graphs ⋮ Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk ⋮ Hash function based on quantum walks
This page was built for publication: A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
