✦ LIBER ✦

Solving the graph-isomorphism problem with a quantum annealer

✍ Scribed by Hen, Itay; Young, A. P.

Book ID: 118048223
Publisher: The American Physical Society
Year: 2012
Tongue: English
Weight: 322 KB
Volume: 86
Category: Article
ISSN: 1050-2947
DOI: 10.1103/physreva.86.042310

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the graph isomorphism counting

A note on the graph isomorphism counting problem

✍ Rudolf Mathon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A new algorithm for solving the tree iso

A new algorithm for solving the tree isomorphism problem

✍ A. Jovanović; D. Danilović 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 549 KB

On the Impossibility of a Quantum Sieve

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism

✍ Moore, Cristopher; Russell, Alexander; Śniady, Piotr 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 302 KB

On an isomorphism problem on the closed-

On an isomorphism problem on the closed-set lattice of a graph

✍ K. M. Koh; K. S. Poh 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 413 KB

Solving the traveling salesman problem w

Solving the traveling salesman problem with annealing-based heuristics: a computational study

✍ Pepper, J.W.; Golden, B.L.; Wasil, E.A. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 341 KB

On the isomorphism problem for a family

On the isomorphism problem for a family of cubic metacirculant graphs

✍ Ngo Dac Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 589 KB

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.