Abstract
In this chapter, we address coined quantum walks on three important finite graphs: cycles, finite two-dimensional lattices , and hypercubes: A cycle is a finite version of the line; a finite two-dimensional lattice is a two-dimensional version of the cycle in the form of a discrete torus; and a hypercube is a generalization of the cube to dimensions greater than three. These graphs have spatial symmetries and can be analyzed via the Fourier transform method. We obtain analytic results that are useful in other chapters of this book. For instance, here we describe the spectral decomposition of the quantum walk evolution operators of two-dimensional lattices and hypercubes. The results are used in Chap. 9 in the analysis of the time complexity of spatial search algorithms using coined quantum walks on these graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
