Diagrammatic approach to quantum search
- 131 Downloads
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\).
KeywordsQuantum search Quantum walks Quantum algorithms Perturbation theory Grover’s algorithm
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.
- 1.Sakurai, J.J.: Modern Quantum Mechanics (Revised Edition). Addison Wesley, Boston (1993)Google Scholar
- 3.Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. arXiv:1409.5876 [quant-ph] (2014)
- 5.Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106 (2000)