110 citations · 159 across the 6 of their papers we have counts for
6 papers
Complexity analysis of quantum walk based search algorithms
B. L. Douglas, J. B. Wang
We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quan…
The Weisfeiler-Lehman Method and Graph Isomorphism Testing
B. L. Douglas
Properties of the `-equivalent' graph families constructed in Cai, Fürer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive -dim WL method. A…
Automorphism Properties of Adinkras
B. L. Douglas, S. James Gates, Jingbo B. Wang
Adinkras are a graphical tool for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set o…
Efficient quantum circuit implementation of quantum walks
B. L. Douglas, J. B. Wang
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been develo…
Classical approach to the graph isomorphism problem using quantum walks
B. L. Douglas, J. B. Wang
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…
Graph identification by quantum walks
J. B. Wang, B. L. Douglas
This paper has been withdrawn by the authors; replaced by arXiv:0705.2531v2 [quant-ph].