Efficient quantum circuits for Szegedy quantum walks

T. Loke, J. B. Wang

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    Abstract

    A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm.

    Original languageEnglish
    Pages (from-to)64-84
    Number of pages21
    JournalAnnals of Physics
    Volume382
    DOIs
    Publication statusPublished - 1 Jul 2017

    Fingerprint Dive into the research topics of 'Efficient quantum circuits for Szegedy quantum walks'. Together they form a unique fingerprint.

    Cite this