- Access by Xinjiang University
Localization without disorder: Quantum walks on structured graphs
Phys. Rev. A 114, 022215 – Published 20 August, 2026
DOI: https://doi.org/10.1103/bzgp-lpdc
Abstract
We present an exact spectral and dynamical analysis of continuous-time quantum walks on barbell graphs and two variants of star-of-cliques graphs, obtaining closed-form eigenvalues, eigenvectors, eigenstate inverse participation ratios (IPRs), and long-time dynamical IPRs () for all families and vertex types. The central finding is that localization in these graphs arises through three distinct mechanisms, each responsible for a different vertex class: null-coupling confinement, in which dark modes have exactly zero amplitude at the intersubgraph connection and are therefore confined within individual cliques for all ; destructive-interference standing waves, whose opposite phase on either side of a structural bottleneck suppresses amplitude flow across it; and invariant-subspace dynamical localization, in which a large degenerate eigenspace drives for walks initialized at clique interior vertices—a result we establish through exact, vertex-specific dynamical IPR, in contrast to the graph-averaged treatments of degeneracy-driven trapping in prior work. In the barbell, clique interior vertices achieve while bridge vertices saturate at . In variant 1 of the star-of-cliques construction, where every clique vertex connects to the hub, both hub and clique vertices achieve . Restricting each clique to a single bridge connection (variant 2) reduces the hub's from 1 to —fixed by its participation in only three eigenmodes regardless of graph size—while bridge and clique vertices retain . Each mechanism responds differently to structural perturbation: The null-coupling mechanism is exact; the interference mechanism relies on the reflection symmetry between the two sides of the bottleneck; and the invariant-subspace mechanism is asymptotic in graph size. These results provide analytically solvable examples of how spectral degeneracy and connectivity together determine long-time quantum transport in modular networks.
Physics Subject Headings (PhySH)
Article Text
References (27)
- E. Farhi and S. Gutmann, Quantum computation and decision trees, Phys. Rev. A 58, 915 (1998).
- D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC) (ACM, New York, 2001), pp. 50–59.
- A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, One-dimensional quantum walks, in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC'01) (ACM, New York, NY, USA, 2001), pp. 37–49.
- O. Mülken and A. Blumen, Continuous-time quantum walks: Models for coherent transport on complex networks, Phys. Rep. 502, 37 (2011).
- M. Reshadi and D. Gregg, Dynamic resource partitioning for multi-tenant systolic array based DNN accelerator, in 2023 31st Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) (2023), pp. 76–83.
- S. E. Venegas-Andraca, Quantum walks: A comprehensive review, Quantum Inf. Process. 11, 1015 (2012).
- P. W. Anderson, Absence of diffusion in certain random lattices, Phys. Rev. 109, 1492 (1958).
- V. Kendon, Decoherence in quantum walks—A review, Math. Struct. Comp. Sci. 17, 1169 (2007).
- A. P. Balachandran, A. Kundalpady, P. Padmanabhan, and A. Sinha, Disorder-free localization in continuous-time quantum walks: Role of symmetries, Phys. Rev. A 109, 012205 (2024).
- A. Gilyén, C. Godsil, H. Shirazi, and H. Zhan, An improved quantum-inspired algorithm for linear regression, Quantum 6, 754 (2022).
- J. P. Keating, N. Linden, J. C. F. Matthews, and A. Winter, Localization and its consequences for quantum walk algorithms and quantum communication, Phys. Rev. A 76, 012315 (2007).
- J. Novotný, G. Chadzitaskos, I. Jex, S. M. Barnett, and T. Kiss, Quantum Buridan's ass, Proc. R. Soc. A 481, 20250023 (2025).
- D. J. Thouless, Electrons in disordered systems and the theory of localization, Phys. Rep. 13, 93 (1974).
- F. Evers and A. D. Mirlin, Anderson transitions, Rev. Mod. Phys. 80, 1355 (2008).
- A. Yadav and S. Jalan, Origin and implications of zero degeneracy in networks spectra, Chaos 25, 043110 (2015).
- L. Marrec and S. Jalan, Analysing degeneracies in networks spectra, Europhys. Lett. 117, 48001 (2017).
- C. Sarkar and S. Jalan, Spectral properties of complex networks, Chaos 28, 102101 (2018).
- R. Bueno and N. Hatano, Null-eigenvalue localization of quantum walks on complex networks, Phys. Rev. Res. 2, 033185 (2020).
- O. Mülken, V. Pernice, and A. Blumen, Quantum transport on small-world networks: A continuous-time quantum walk approach, Phys. Rev. E 76, 051125 (2007).
- A. Anishchenko, A. Blumen, and O. Mülken, Enhancing the spreading of quantum walks on star graphs by additional bonds, Quantum Inf. Proc. 11, 1273 (2012).
- Z. Darázs, A. Anishchenko, T. Kiss, A. Blumen, and O. Mülken, Transport properties of continuous-time quantum walks on Sierpinski fractals, Phys. Rev. E 90, 032113 (2014).
- M. Faccin, T. Johnson, J. Biamonte, S. Kais, and P. Migdal, Degree distribution in quantum walks on complex networks, Phys. Rev. X 3, 041007 (2013).
- L. Böttcher and M. A. Porter, Clustering-induced localization of quantum walks on networks, Phys. Rev. E 112, L062301 (2025).
- F. Wegner, Inverse participation ratio in 2+ε dimensions, Z. Phys. B 36, 209 (1980).
- A. M. Childs, Universal computation by quantum walk, Phys. Rev. Lett. 102, 180501 (2009).
- L. Novo, S. Chakraborty, M. Mohseni, H. Neven, and Y. Omar, Systematic dimensionality reduction for quantum walks: Optimal spatial search and transport on non-regular graphs, Sci. Rep. 5, 13304 (2015).
- shyam18596/dynamical-ipr-quantum-walks: v1.1-Initial release, Zenodo, 2026, https://doi.org/10.5281/zenodo.21936854.