Related papers: Graph identification by quantum walks

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…

This paper has been withdrawn by the author(s). Please see arXiv:0711.3910 for revision.

We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…

This paper has been withdrawn by the authors

This paper has been withdrawn due to same as quant-ph/9908068

This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…

This paper has been withdrawn

This paper has been withdrawn by the authors, due a oversimplified decoherence model. It will be substituted by a new work.

The paper has been withdrawn

The paper has been withdrawn

This paper has been withdrawn by the authors due to new experimental results.

This paper has been withdrawn.

Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular…

The paper has been withdrawn because the research work is still in progress.

This paper was withdrawn by the author.

This paper has been withdrawn due to its publication

This paper has been withdrawn by the authors. It has been superseded by hep-th/0309154

This paper has been withdrawn.

This paper has been withdrawn by the author due to time-consuming revision.

The paper has been withdrawn.