Abstract
The adjacency matrices of graphs provide the foundation for constructing the Hamiltonians of Continuous-Time Quantum Walks (CTQWs). Various classes of graphs have been identified to be highly reducible and the reduced Hamiltonian preserves the dynamics of the original system. This makes the CTQW implementation feasible in the near term for search problems of large size. Highly reducible Hamiltonians are desirable because existing quantum devices are of limited size in terms of the number of qubits. In this work, we review the recent developments of dimensionality reduction and coupling factor value finding techniques. The CTQWs based on a reduced Hamiltonian can search optimally when the correctly calculated coupling factor is used. We list identified highly reducible graphs and include their optimality proofs when correct coupling factors are used. In addition, we discuss the recent developments on Lackadaisical Quantum Walkers (LQW) (a type of coin-based discrete-time quantum walk) for one- and two-dimensional spatial search. The optimal lower upper bound remains open in one- and two-dimensional Discrete-Time Quantum Walk.








Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Notes
\(H_{\mathrm{seek}} = -\gamma H_{\mathrm{ra}} -|\omega \rangle \langle \omega |\) as seen in Algorithm 3
References
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2):915 (1998)
Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307–327 (2003)
Childs, A.M.: Universal computation by quantum walk. Phys. Rev. Lett. 102(18):180501 (2009)
Lovett, N.B., Cooper, S., Everitt, M., Trevers, M., Kendon, V.: Universal quantum computation using the discrete-time quantum walk. Phys. Rev. A 81(4):042330 (2010)
Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O’Brien, J.L., Wang, J.B., Matthews, J.C.: Efficient quantum walk on a quantum processor. Nat. Commun. 7(1), 1–6 (2016)
Shor, P.W.: Quantum computing. Doc. Math. 1(1000):1 (1998)
Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 352–361. IEEE (1993)
Jordan, S.P., Lee, K.S., Preskill, J.: Quantum algorithms for quantum field theories. Science 336(6085), 1130–1133 (2012)
Nayak, C., Simon, S.H., Stern, A., Freedman, M., Sarma, S.D.: Non-abelian anyons and topological quantum computation. Rev. Mod. Phys. 80(3):1083 (2008)
Mizel, A., Lidar, D.A., Mitchell, M.: Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys. Rev. Lett. 99(7):070502 (2007)
Chiang, C.-F., Hsieh, C.-Y.: Resonant transition-based quantum computation. Quantum Inf. Process. 16(5):120 (2017)
Morimae, T., Fujii, K.: Blind topological measurement-based quantum computation. Nat. Commun. 3:1036 (2012)
Gross, D., Eisert, J.: Novel schemes for measurement-based quantum computation. Phys. Rev. Lett. 98(22):220503 (2007)
Briegel, H.J., Browne, D.E., Dür, W., Raussendorf, R., Van den Nest, M.: Measurement-based quantum computation. Nat. Phys. 5(1), 19–26 (2009)
Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68(2):022312 (2003)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings, pp. 124–134. IEEE (1994)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM (1996)
Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70(2):022314 (2004)
Aaronson, S., Ambainis, A.: Quantum search of spatial regions. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, pp. 200–209. IEEE (2003)
Novo L., Chakraborty S., Mohseni M., Neven H., Omar Y. (2015) Systematic dimensionality reduction for quantum walks: optimal spatial search and transport on non-regular graphs. Sci Rep 5:13304
Chakraborty, S., Novo, L., Ambainis, A., Omar, Y.: Spatial search by quantum walk is optimal for almost all graphs. Phys. Rev. Lett. 116(10):100501 (2016)
Wong, T.G.: Spatial search by continuous-time quantum walk with multiple marked vertices. Quantum Inf. Process. 15(4), 1411–1443 (2016)
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A. (2003) Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 59–68. ACM (2003)
Childs, A.M., Schulman, L.J., Vazirani, U.V.: Quantum algorithms for hidden nonlinear structures. In: 48th Annual IEEE Symposium on Foundations of Computer Science, 2007. FOCS’07. pp. 395–404. IEEE (2007)
Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007)
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413–424 (2007)
Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the hamiltonian nand tree. arXiv:quant-ph/0702144 (2007)
Berry, S.D., Wang, J.B.: Two-particle quantum walks: entanglement and graph isomorphism testing. Phys. Rev. A 83(4):042317 (2011)
Gamble, J.K., Friesen, M., Zhou, D., Joynt, R., Coppersmith, S.: Two-particle quantum walks applied to the graph isomorphism problem. Phys. Rev. A 81(5):052313 (2010)
Douglas, B.L., Wang, J.B.: A classical approach to the graph isomorphism problem using quantum walks. J. Phys. A Math. Theor. 41(7):075303 (2008)
Berry, S.D., Wang, J.B.: Quantum-walk-based search and centrality. Phys. Rev. A 82(4):042333 (2010)
Sánchez-Burillo, E., Duch, J., Gómez-Gardenes, J., Zueco, D.: Quantum navigation and ranking in complex networks. arXiv:1202.3471 (2012)
Yang, Y.-G., Zhao, Q.-Q.: Novel pseudo-random number generator based on quantum random walks. Sci. Rep. 6:20362 (2016)
Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2):1687 (1993)
Childs, A.M.: On the relationship between continuous-and discrete-time quantum walk. Commun. Math. Phys. 294(2), 581–603 (2010)
Caruso, F., Chin, A.W., Datta, A., Huelga, S.F., Plenio, M.B.: Highly efficient energy excitation transfer in light-harvesting complexes: the fundamental role of noise-assisted transport. J. Chem. Phys. 131(10):09B612 (2009)
Mohseni, M., Rebentrost, P., Lloyd, S., Aspuru-Guzik, A.: Environment-assisted quantum walks in photosynthetic energy transfer. J. Chem. Phys. 129(17):11B603 (2008)
Rebentrost, P., Mohseni, M., Kassal, I., Lloyd, S., Aspuru-Guzik, A.: Environment-assisted quantum transport. N J. Phys. 11(3):033003 (2009)
Plenio, M.B., Huelga, S.F.: Dephasing-assisted transport: quantum networks and biomolecules. N. J. Phys. 10(11):113019 (2008)
Bose, S.: Quantum communication through an unmodulated spin chain. Phys. Rev. Lett. 91(20):207901 (2003)
Kay, A.: Perfect, efficient, state transfer and its application as a constructive tool. Int. J. Quantum Inf. 8(04), 641–676 (2010)
Omar, Y., Moutinho, J., Melo, A., Coutinho, B., Kovacs, I., Barabasi, A.: Quantum link prediction in complex networks. APS 2019:R28–003 (2019)
Chiang, C.-F.: Optimal dimensionality reduced quantum walk and noise characterization. In: Proceedings of the Future Technologies Conference, pp. 914–929. Springer (2018)
Koscinski, V., Chiang, C.-F.: Dimensionality reduction of the complete bipartite graph with \(k\) edges removed for quantum walks. In: 2018 IEEE Nanotechnology Symposium (ANTS), pp. 1–3. IEEE (2018)
Chiang, C.-F., Gregory, A.: Quantum walk on dimensionality reduced complete bipartite graphs with k edges removed. In: 2019 IEEE Globecom Workshops (GC Wkshps), pp. 1–6. IEEE (2019)
Nahimovs, N.: Lackadaisical quantum walks with multiple marked vertices. In: International Conference on Current Trends in Theory and Practice of Informatics, pp. 368–378. Springer (2019)
Wong, T.G.: Faster search by lackadaisical quantum walk. Quantum Inf. Process. 17(3):68 (2018)
Giri, P.R., Korepin, V.: Lackadaisical quantum walk for spatial search. Modern Phys. Lett. A 35(08):2050043 (2020)
Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1099–1108. Society for Industrial and Applied Mathematics (2005)
Tregenna, B., Flanagan, W., Maile, R., Kendon, V.: Controlling discrete quantum walks: coins and initial states. N. J. Phys. 5(1):83 (2003)
Brun, T.A., Carteret, H.A., Ambainis, A.: Quantum walks driven by many coins. Phys. Rev. A 67(5):052317 (2003)
Venegas-Andraca, S., Ball, J., Burnett, K., Bose, S.: Quantum walks with entangled coins. N. J. Phys. 7(1):221 (2005)
Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: 45th Annual IEEE Symposium on Foundations of Computer Science, 2004. Proceedings, pp. 32–41. IEEE (2004)
Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding is as easy as detecting for quantum walks. In: International Colloquium on Automata, Languages, and Programming, pp. 540–551. Springer (2010)
Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. United States Government Press Office, Los Angeles, CA (1950)
Jafarizadeh, M., Sufiani, R., Salimi, S., Jafarizadeh, S.: Investigation of continuous-time quantum walk by using krylov subspace-lanczos algorithm. Eur. Phys. J. B 59(2), 199–216 (2007)
Gregory, A., Chiang, C.-F.: Simulation of quantum walks via hamiltonian reduction. In: 2018 IEEE Nanotechnology Symposium (ANTS), pp. 1–4. IEEE (2018)
Chiang, C.-F., Hsieh, C.-Y.: Noise characterization: keeping reduction based per-turbed quantum walk search optimal. In: EPJ Web of Conferences, vol. 198, p. 00001. EDP Sciences (2019)
Bousso, R.: The holographic principle. Rev. Modern Phys. 74(3):825 (2002)
Benioff, P.: Space searches with a quantum robot. arXiv:quant-ph/0003006 (2000)
Wong, T.G., Ambainis, A.: Quantum search with multiple walk steps per oracle query. Phys. Rev. A 92(2):022338 (2015)
Inui, N., Konno, N., Segawa, E.: One-dimensional three-state quantum walk. Phys. Rev. E 72(5):056112 (2005)
Štefaňák, M., Bezděková, I., Jex, I.: Limit distributions of three-state quantum walks: the role of coin eigenstates. Phys. Rev. A 90(1):012342 (2014)
Wong, T.G.: Grover search with lackadaisical quantum walks. J. Phys. A Math. Theor. 48(43):435304 (2015)
Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305:53–74 (2002)
Acknowledgements
C. C. gratefully acknowledges support from the seed Grant funding (917035-13) from the State University of New York Polytechnic
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Basis change with perturbation
Theorem 2
[43] Given a reduced 3 \(\times \) 3 Hamiltonian \(H_{\mathrm{seek}} = H^{(0)}+ H^{(1)}\) in the \((|\omega \rangle , |b_1\rangle , |b_2\rangle )\) basis where
\(v_1\) and \(v_2\) are negative numbers and \(v_3\) is a non-positive number where \(v_1/v_2 \ge 1\). Let the eigenvectors basis of \(H^{(0)}\) be \((|\omega \rangle , |e_1\rangle , |e_2\rangle )\). Let \(\kappa = \frac{v_3}{v_1} \ge 0\) and \(\beta _\pm =\frac{\kappa \pm \sqrt{\kappa ^2 + 4}}{2}\), then eigenvectors
with corresponding eigenvalues \(\lambda _\pm = v_1 \beta _\pm \). H expressed in the \((|\omega \rangle , |e_1\rangle , |e_2\rangle )\) eigenbasis is
Proof
Let \(|e'\rangle = |b_1\rangle +\beta |b_2\rangle \) be an eigenvector of \(H^{(0)}\) with eigenvalue \(\lambda \). After some calculation, we obtain \(\lambda _{\pm } = {\beta _{\pm } v_1}\) where
Let eigenvector \(|e'_1\rangle = |b_1\rangle +\beta _+ |b_2\rangle \) with eigenvalue \(\lambda _+\) and eigenvector \(|e'_2\rangle = |b_1\rangle +\beta _- |b_2\rangle \) with eigenvalue \(\lambda _-\), by renormalization we have
By basis change and Eq. (53) with \(H^{(1)}\) in the \((|\omega \rangle , |e_1\rangle , |e_2\rangle )\) eigenbasis, we obtain \(H^{(1)}|\omega \rangle \) as
Hence, the Hamiltonian \(H_{\mathrm{seek}}\) can be expressed as shown in Eq. (55). \(\square \)
Lemma 1
[43] (Computational basis to eigenbasis) Given a derived reduced Hamiltonian \(H_{\mathrm{seek}}\) written in the \((|\omega \rangle , |e_1\rangle , |e_2\rangle )\) basis as shown in Theorem 2, we then know that (a) Hamiltonian \(H_{\mathrm{seek}}\) is symmetric and (b) \(\beta _+> 0 > \beta _-\) and \(\lambda _+ <0, \lambda _- > 0\).
Proof
With the value of \(\beta _\pm \) as shown in Theorem 2, we know \(\beta _+ \beta _- = -1 \), we know
Hence, H is symmetric. For property (b), it is immediate since \(\sqrt{\kappa ^2 + 4}> \kappa > 0 \) and \(\lambda _{\pm } = v_1\beta _{\pm }\). \(\square \)
By Lemma 1, \(H_{\mathrm{seek}}\) can be written in the \((|\omega \rangle , |e_1\rangle ,|e_2\rangle )\) basis as
where
Appendix B: Low-state transport escape rate
Theorem 3
[43] Given a Hamiltonian \(H_{\mathrm{seek}}\) in the form shown in Lemma 1, it is desirable to have \(\lambda _+ = -1\) such that \(|\omega \rangle \) and \(|e_1\rangle \) form the basis for the two states of the lowest eigenvalue. If \(v_1= -\gamma N(\sqrt{\alpha (1- \alpha )})\), \(v_2= -\gamma (\sqrt{N (1-\alpha )})\) then the degeneracy between site energies of \(|\omega \rangle \) and \(|e_1\rangle \) facilitates transport between these two low energy states, hence \(\gamma = (N\sqrt{\alpha (1- \alpha )}\beta _+)^{-1}\). The transport between \(|\omega \rangle \) and \(|e_2\rangle \) is negligible since \(\delta _2\) is much smaller than \(\lambda _-\).
Proof
Since we desire to have faster transport between the lowest eigen energy states, we need to set
With the fact that \(v_1 = -\gamma N(\sqrt{\alpha (1- \alpha )})\), we need to set
From Eq. (62) and \(\lambda _- = v_1\beta _{-}\), we know \(\delta _2\) is much smaller than \(\lambda _-\) because
\(\square \)
Rights and permissions
About this article
Cite this article
Chiang, CF. Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term. Quantum Inf Process 19, 364 (2020). https://doi.org/10.1007/s11128-020-02876-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-020-02876-2