Quantum Information Processing

, Volume 14, Issue 6, pp 1767–1775

Diagrammatic approach to quantum search


DOI: 10.1007/s11128-015-0959-3

Cite this article as:
Wong, T.G. Quantum Inf Process (2015) 14: 1767. doi:10.1007/s11128-015-0959-3


We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory’s effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with \(N\).


Quantum search Quantum walks Quantum algorithms  Perturbation theory Grover’s algorithm 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Faculty of ComputingUniversity of LatviaRigaLatvia

Personalised recommendations