Quantum walk search on kronecker graphs

Thomas G. Wong, Konstantin Wünscher, Joshua Lockhart, Simone Severini

Research output: Contribution to journalArticlepeer-review


Kronecker graphs, obtained by repeatedly performing the Kronecker product of the adjacency matrix of an "initiator" graph with itself, have risen in popularity in network science due to their ability to generate complex networks with real-world properties. In this paper, we explore spatial search by continuous-time quantum walk on Kronecker graphs. Specifically, we give analytical proofs for quantum search on first-, second-, and third-order Kronecker graphs with the complete graph as the initiator, showing that search takes Grover's O(√N) time. Numerical simulations indicate that higher-order Kronecker graphs with the complete initiator also support optimal quantum search.

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Apr 27 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General

Fingerprint Dive into the research topics of 'Quantum walk search on kronecker graphs'. Together they form a unique fingerprint.

Cite this