## Abstract

A quantum particle evolving by Schrödinger’s equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace’s operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Laplacian and adjacency matrix. The two walks differ qualitatively and quantitatively in their required jumping rate, runtime, sampling of marked vertices, and in what constitutes a natural initial state. Thus the choice of the Laplacian or adjacency matrix to effect the walk has important algorithmic consequences.

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

## References

- 1.
Schrödinger, E.: An undulatory theory of the mechanics of atoms and molecules. Phys. Rev.

**28**, 1049–1070 (1926) - 2.
Griffiths, D.J.: Introduction to Quantum Mechanics. Prentice Hall, New Jersey (2005)

- 3.
Bloch, I.: Ultracold quantum gases in optical lattices. Nat. Phys.

**1**, 23–30 (2005) - 4.
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A

**58**, 915–928 (1998) - 5.
Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A

**70**, 022314 (2004) - 6.
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing. STOC ’03, pp. 59–68. ACM, New York, NY, USA (2003)

- 7.
Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the Hamiltonian NAND tree. Theory Comput.

**4**(8), 169–190 (2008) - 8.
Bose, S., Casaccino, A., Mancini, S., Severini, S.: Communication in XYZ all-to-all quantum networks with a missing link. Int. J. Quantum Inf.

**07**(04), 713–723 (2009) - 9.
Alvir, R., Dever, S., Lovitz, B., Myer, J., Tamon, C., Xu, Y., Zhan, H.: Perfect state transfer in Laplacian quantum walk. J. Algebraic Combin.

**43**, 801–826 (2016) - 10.
Ackelsberg, E., Brehm, Z., Chan, A., Mundinger, J., Tamon, C.: Laplacian state transfer in coronas. Linear Algebra Appl.

**506**, 154–167 (2016) - 11.
Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. A: Math. Theor.

**48**(43), 435304 (2015) - 12.
Janmark, J., Meyer, D.A., Wong, T.G.: Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett.

**112**, 210502 (2014) - 13.
Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. Phys. Rev. Lett.

**114**, 110503 (2015) - 14.
Wong, T.G.: Spatial search by continuous-time quantum walk with multiple marked vertices. Quantum Inf. Process.

**15**(4), 1411–1443 (2016) - 15.
Wong, T.G., Ambainis, A.: Quantum search with multiple walk steps per oracle query. Phys. Rev. A

**92**, 022338 (2015) - 16.
Wong, T.G.: Faster quantum walk search on a weighted graph. Phys. Rev. A

**92**, 032320 (2016) arXiv:1508.01327v3 - 17.
Novo, L., Chakraborty, S., Mohseni, M., Neven, H., Omar, Y.: Systematic dimensionality reduction for quantum walks: optimal spatial search and transport on non-regular graphs. Sci. Rep.

**5**, 13304 (2015) - 18.
Chakraborty, S., Novo, L., Ambainis, A., Omar, Y.: Spatial search by quantum walk is optimal for almost all graphs. Phys. Rev. Lett.

**116**, 100501 (2016) - 19.
Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortsch. Phys.

**46**(4–5), 493–505 (1998) - 20.
Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, New York (1995)

- 21.
von Schelling, H.: Auf der spur des zufalls. Deutsches Statistisches Zentralblatt

**26**, 137–146 (1934) - 22.
von Schelling, H.: Coupon collecting for unequal probabilities. Amer. Math. Mon.

**61**(5), 306–311 (1954) - 23.
Flajolet, P., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl. Math.

**39**, 207–229 (1992) - 24.
Wong, T.G.: Diagrammatic approach to quantum search. Quantum Inf. Process.

**14**(6), 1767–1775 (2015)

## Acknowledgments

TW and NN were 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. LT was supported by CNPq CSF/BJT grant reference 301181/2014-4.

## Author information

### Affiliations

### Corresponding author

## Appendices

### Appendix 1: Eigensystem for Laplacian walk

The search Hamiltonian, when walking with the Laplacian, is given in (2). Finding the exact eigenvectors and eigenvalues of *H* is intractable, but they can be approximated for large *N* using degenerate perturbation theory, which also gives a way to find the critical \(\gamma \)’s [12]. To do this, we separate the Hamiltonian (2) into its leading- and higher-order terms, *i.e.*, \(H = H^{(0)} + H^{(1)} + \dots \), where

The idea is to first find the eigenvectors and eigenvalues of the leading-order Hamiltonian \(H^{(0)}\), which is a much simpler matrix. Then we add the next-order corrections \(H^{(1)}\) and see how this perturbation modifies them. This gives an approximation for the eigenvectors and eigenvalues of *H*.

To begin, the eigenvectors and eigenvalues of \(H^{(0)}\) are

Note that the third eigenvector, which we call \({\left| r \right\rangle }\), is approximately \({\left| s \right\rangle }\) for large *N* since the \(k_1\) and \(k_2\) terms in \({\left| s \right\rangle }\) are dominated by \(N_1\) and \(N_2\) for large *N*.

Now we include the perturbation \(H^{(1)}\) to see how these leading-order eigenvectors and eigenvalues change. If they are non-degenerate, then \(H^{(1)}\) can only contribute higher-order terms to the eigenvectors and eigenvalues, so the starting state \({\left| s \right\rangle } \approx {\left| r \right\rangle }\) is still an approximate eigenvector of the perturbed system for large *N* [2]. If the leading-order eigenvectors are degenerate, however, the behavior is vastly different. For example, say

so that \({\left| a \right\rangle }\) and \({\left| r \right\rangle }\) are degenerate to leading-order. Then the addition of \(H^{(1)}\) causes two linear combinations of them

become eigenstates of the perturbed system [2]. To find the coefficients, we solve the eigenvalue problem

where \(H_{ar} = \langle a | H^{(0)} + H^{(1)} | r \rangle \), etc. Evaluating the matrix elements,

This has solutions

Since \({\left| r \right\rangle } \approx {\left| s \right\rangle }\), for large *N*, the (unnormalized) eigenvectors and eigenvalues of *H* when \(\gamma = \gamma _a\) are

as stated in the main text of the paper.

Note that \({\left| s \right\rangle } + {\left| a \right\rangle }\) and \({\left| s \right\rangle } - {\left| a \right\rangle }\) are non-degenerate eigenstates of the perturbed system, so the first-order correction \(H^{(1)}\) has lifted the degeneracy. Then any higher-order corrections (\(H^{(2)}\), \(H^{(3)}\), etc.) will not significantly change these eigenstates and eigenvalues, meaning any contributions from them will go to zero more quickly than the terms we have derived [2], and hence we can safely ignore them.

Using the method of Sect. IV of [16], we can find how close \(\gamma \) must be to its critical value. Say \(\gamma \) is within \(\epsilon \) of its critical value, *i.e.*, \(\gamma = \gamma _a + \epsilon = 1/N_2 + \epsilon \). If \(\epsilon \) is small such that \({\left| a \right\rangle }\) and \({\left| r \right\rangle }\) are near-degenerate to leading-order, then the perturbation still causes \(\alpha _a {\left| a \right\rangle } + \alpha _r {\left| r \right\rangle }\) to be eigenvectors of the perturbed system. To find the coefficients, one solves an eigenvalue problem, which has a leading-order term in \(\epsilon \) scaling as \(\epsilon N_2\) due to the component \(H_{aa} = \langle a | H^{(0)} + H^{(1)} | a \rangle \). Thus for the system to retain the error-free energy gap of \(\Theta (1/\sqrt{N})\), we need \(\epsilon N_2 = o(1/\sqrt{N})\). That is, \(\epsilon = o(1/N^{3/2})\), which is the precision stated in the main text of the paper.

Similarly, if

so that \({\left| b \right\rangle }\) and \({\left| r \right\rangle }\) are degenerate to leading-order, then the perturbation \(H^{(1)}\) causes two linear combinations \(\alpha _b {\left| b \right\rangle } + \alpha _r {\left| r \right\rangle }\) to be eigenvectors of the perturbed system. Solving a similar eigenvalue problem for the coefficients \(\alpha _b\) and \(\alpha _r\), we find that the perturbed eigenstates are

Since \({\left| r \right\rangle } \approx {\left| s \right\rangle }\), for large *N*, the (unnormalized) eigenvectors and eigenvalues of *H* when \(\gamma = \gamma _b\) are

as stated in the main text of the paper.

For the precision with which \(\gamma \) must be chosen to its critical value, we can again use the argument of [16] to show that \(\gamma \) must be within \(o(1/N^{3/2})\) of \(\gamma _b\), as stated in the main text of the paper.

This calculation using degenerate perturbation theory can also be understood diagrammatically [24]. The search Hamiltonian (2) can be depicted as shown in Fig. 7a. Keeping only the leading-order terms, \(H^{(0)}\) is shown in Fig. 7b, and the diagram reveals its four eigenvectors: \({\left| a \right\rangle }\), \({\left| b \right\rangle }\), and two linear combinations of \({\left| c \right\rangle }\) and \({\left| d \right\rangle }\) (one of which we called \({\left| r \right\rangle }\)). By choosing \({\left| a \right\rangle }\) to be degenerate with \({\left| r \right\rangle }\), the perturbation, which restores the missing edges, causes \({\left| a \right\rangle }\) and \({\left| r \right\rangle }\) to mix. Similarly, if \({\left| b \right\rangle }\) is degenerate with \({\left| r \right\rangle }\), the perturbation causes them to mix.

### Appendix 2: Eigensystem for adjacency walk

Similar to the last section, we approximate the eigenvectors and eigenvalues of the search Hamiltonian (3) using degenerate perturbation theory [12]. Breaking *H* into its leading- and higher-order terms,

\(H^{(0)}\) has eigenvectors and eigenvalues

Note that the third eigenvector, which we call \({\left| u \right\rangle }\), is approximately \({\left| \sigma \right\rangle }\) for large *N*. Also, the fourth eigenvector, which we call \({\left| v \right\rangle }\), is approximately \({\left| \delta \right\rangle }\) for large *N*.

Now we include the perturbation \(H^{(1)}\). If \({\left| u \right\rangle }\) is non-degenerate to leading-order, then the starting state \({\left| \sigma \right\rangle } \approx {\left| u \right\rangle }\) approximately remains an eigenstate of the perturbed system. On the other hand, if

then \({\left| a \right\rangle }\), \({\left| b \right\rangle }\), and \({\left| u \right\rangle }\) are degenerate to leading-order, and the three linear combinations of them

will be eigenvectors of the perturbed system. To find the coefficients, we solve the eigenvalue problem

where \(H_{ab} = \langle a | H^{(0)} + H^{(1)} | b \rangle \), etc. Evaluating the matrix components, we get

Solving this yields (unnormalized) eigenstates

with corresponding eigenvalues

Note that \(\psi _\mp \) and its corresponding eigenvalues \(E_\mp \) were stated in the main text of the paper, with \({\left| u \right\rangle }\) replaced by \({\left| \sigma \right\rangle }\), assuming large *N*.

As before, we can use the argument of [16] to find the precision with which \(\gamma \) must be chosen to its critical value. If \(\gamma \) is within \(\epsilon \) of \(\gamma _*\), then there is a term scaling as \(\epsilon \sqrt{N_1N_2}\) that appears in the perturbative calculation, which is leading-order in \(\epsilon \). For this to be small enough to not interfere with the energy gap of \(\Theta (1/\sqrt{N})\), we get \(\epsilon = o(1/N^{3/2})\), which is the precision stated in the main text of the paper.

The Hamiltonian (3) can be represented diagrammatically [24], as depicted in Fig. 8a. Keeping only the leading-order terms, \(H^{(0)}\) is shown in Fig. 8b, and we see that \({\left| a \right\rangle }\) and \({\left| b \right\rangle }\) are always degenerate since they have the same self-loop. Making these degenerate with \({\left| u \right\rangle }\), which is a combination of \({\left| c \right\rangle }\) and \({\left| d \right\rangle }\), the perturbation restores the missing edges and mixes \({\left| a \right\rangle }\), \({\left| b \right\rangle }\), and \({\left| u \right\rangle }\).

Finally, since \(\gamma > 0\), the leading-order eigenvector \({\left| v \right\rangle }\) is never degenerate with the others. So it remains an approximate eigenstate of the perturbed system. Since \({\left| v \right\rangle } \approx {\left| \delta \right\rangle }\), we get that \({\left| \delta \right\rangle }\) is approximately an eigenvector of *H* for large *N*, as stated in the main text of the paper.

## Rights and permissions

## About this article

### Cite this article

Wong, T.G., Tarrataca, L. & Nahimov, N. Laplacian versus adjacency matrix in quantum walk search.
*Quantum Inf Process* **15, **4029–4048 (2016). https://doi.org/10.1007/s11128-016-1373-1

Received:

Accepted:

Published:

Issue Date:

### Keywords

- Quantum walk
- Continuous time
- Spatial search
- Laplacian
- Adjacency matrix