CoChat

A classical approach to the graph isomorphism problem using quantum walks

Open access
Douglas, Brendan L, Wang, Jingbo B · 2008 · Journal of Physics A: Mathematical and Theoretical

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such algorithms have been scarce. In this work, we enumerate some important differences between quantum and classical walks, leading to their markedly different properties. We show that for many practical purposes, the implementation of quantum walks can be efficiently achieved using a classical computer. We then develop both classical and quantum graph isomorphism algorithms based on discrete-time quantum walks. We show that they are effective in identifying isomorphism classes of large databases of graphs, in particular groups of strongly regular graphs. We consider this approach to represent a promising candidate for an efficient solution to the graph isomorphism problem, and believe that similar methods employing quantum walks, or derivatives of these walks, may prove beneficial in constructing other algorithms for a variety of purposes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1751-8113/41/7/075303

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Research works printed but not linked: 4

  1. Hopcroft J, 1971, J. Comput. Syst. Sci., 1, 32
  2. Mackay B, 1981, Congr. Numer., 30, 45
  3. Graham R, 1995, Handbook of Combinatorics, 2
  4. Gross J, 2004, Handbook of Graph Theory

Cited by

See all 140

Metadata

Authors
Douglas, B. L., & Wang, J. B.
Affiliations
The University of Western Australia (AU)
Venue
Journal of Physics A: Mathematical and Theoretical
Published
2008-02-05
Volume
41
Issue
7
Pages
075303
ISSN
  • 1751-8113 (ISSN-L)
  • 1751-8121
OpenAlex
W2094509719
Cited by
126
References
13
Citations by year
2026: 2 · 2025: 9 · 2024: 5 · 2023: 3 · 2022: 4 · 2021: 11 · 2020: 12 · 2019: 8 · 2018: 15 · 2017: 11 · 2016: 4 · 2015: 7 · 2014: 8 · 2013: 4 · 2012: 7
FWCI
8.46
Type
journal article
Language
en
Open access
Locations
  • Journal of Physics A Mathematical and Theoretical (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • UWA Profiles and Research Repository (UWA) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
graph isomorphism, quantum walks, discrete-time quantum walks, classical random walks, strongly regular graphs, quantum algorithms, graph databases

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A classical approach to the graph isomorphism problem using quantum walks. https://app.cochat.ai/papers/10.1088/1751-8113/41/7/075303
The paper
Douglas, B. L., & Wang, J. B. (2008). A classical approach to the graph isomorphism problem using quantum walks. Journal of Physics A: Mathematical and Theoretical. https://doi.org/10.1088/1751-8113/41/7/075303

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.