Abstract
We analyze the localization of quantum walks on a one-dimensional finite graph using vector-distance. We first vectorize the probability distribution of a quantum walker in each node. Then we compute out the probability distribution vectors of quantum walks in infinite and finite graphs in the presence of static disorder respectively, and get the distance between these two vectors. We find that when the steps taken are small and the boundary condition is tight, the localization between the infinite and finite cases is greatly different. However, the difference is negligible when the steps taken are large or the boundary condition is loose. It means quantum walks on a one-dimensional finite graph may also suffer from localization in the presence of static disorder. Our approach and results can be generalized to analyze the localization of quantum walks in higher-dimensional cases.
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.
