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\).

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7


  1. 1.

    Sakurai, J.J.: Modern Quantum Mechanics (Revised Edition). Addison Wesley, Boston (1993)

  2. 2.

    Janmark, J., Meyer, D.A., Wong, T.G.: Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett. 112, 210502 (2014)

    ADS  Google 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)

    ADS  MathSciNet  Google 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)

    ADS  Google Scholar 

Download references


Thanks to David Meyer for useful discussions. This work was partially supported by the European Union Seventh Framework Programme (FP7/2007-2013) under the QALGO (Grant Agreement No. 600700) project, and the ERC Advanced Grant MQC.

Author information



Corresponding author

Correspondence to Thomas G. Wong.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wong, T.G. Diagrammatic approach to quantum search. Quantum Inf Process 14, 1767–1775 (2015). https://doi.org/10.1007/s11128-015-0959-3

Download citation


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