Solving the graph-isomorphism problem with a quantum annealer

Itay Hen and A. P. Young
Phys. Rev. A 86, 042310 – Published 10 October 2012

Abstract

We propose a method using a quantum annealer—an analog quantum computer based on the principles of quantum adiabatic evolution—to solve the graph isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs. We also show that our method is applicable, within certain limitations, to currently available quantum hardware such as D-Wave One.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 8 August 2012

DOI:https://doi.org/10.1103/PhysRevA.86.042310

©2012 American Physical Society

Authors & Affiliations

Itay Hen* and A. P. Young

  • Department of Physics, University of California, Santa Cruz, California 95064, USA

  • *itayhe@physics.ucsc.edu

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 86, Iss. 4 — October 2012

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×