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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2roles
background 1polarities
background 1representative citing papers
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.
- Unified resonant-manifold framework for dynamical quantum phase transitions