Quantum Information Processing

, Volume 14, Issue 6, pp 1767–1775 | Cite as

Diagrammatic approach to quantum search



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 


  1. 1.
    Sakurai, J.J.: Modern Quantum Mechanics (Revised Edition). Addison Wesley, Boston (1993)Google Scholar
  2. 2.
    Janmark, J., Meyer, D.A., Wong, T.G.: Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett. 112, 210502 (2014)ADSGoogle Scholar
  3. 3.
    Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. arXiv:1409.5876 [quant-ph] (2014)
  4. 4.
    Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70, 022314 (2004)ADSMathSciNetGoogle Scholar
  5. 5.
    Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106 (2000)
  6. 6.
    Childs, A.M., Deotto, E., Farhi, E., Goldstone, J., Gutmann, S., Landahl, A.J.: Quantum search by measurement. Phys. Rev. A 66, 032314 (2002)ADSGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Faculty of ComputingUniversity of LatviaRigaLatvia

Personalised recommendations