Efficient quantum circuit implementation of quantum walks

Brendan Douglas, Jingbo Wang

    Research output: Contribution to journalArticle

    27 Citations (Scopus)

    Abstract

    Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the “glued trees” algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.
    Original languageEnglish
    Pages (from-to)Article number 052335, 5pp
    JournalPhysical Review A
    Volume79
    Issue number5
    DOIs
    Publication statusPublished - 2009

    Fingerprint Dive into the research topics of 'Efficient quantum circuit implementation of quantum walks'. Together they form a unique fingerprint.

    Cite this