Source-target entanglement in quantum walks on arbitrary networks is upper-bounded by connectivity, with graph matchings controlling its generation and higher connectivity reducing the maximum in random graphs.
Kempe, Contemporary Physics44, 307 (2003)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Classical random walks on finite 2D lattices of varying connectivity show diffusive spreading insensitive to lattice details, with mass fractal dimension 1.50±0.03 and hull dimension 1.37±0.03 that approach Brownian-motion values with increasing steps.
citing papers explorer
-
Entanglement capacity of complex networks from quantum walks
Source-target entanglement in quantum walks on arbitrary networks is upper-bounded by connectivity, with graph matchings controlling its generation and higher connectivity reducing the maximum in random graphs.
-
Finite-size scaling properties of classical random walk on various two-dimensional lattices
Classical random walks on finite 2D lattices of varying connectivity show diffusive spreading insensitive to lattice details, with mass fractal dimension 1.50±0.03 and hull dimension 1.37±0.03 that approach Brownian-motion values with increasing steps.