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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Continuous-time quantum walks show quadratic short-time scaling in multi-time position measurement nonclassicality unlike the linear scaling of single-time quantum-classical distance, with strong topology dependence at long times that varies under position versus energy dephasing.
A Weyl-ordered KvN generator with summation-by-parts discretization achieves exact unitary evolution for spectrally truncated fluid and plasma dynamics suitable for quantum computers.
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.
-
Temporal nonclassicality in continuous-time quantum walks
Continuous-time quantum walks show quadratic short-time scaling in multi-time position measurement nonclassicality unlike the linear scaling of single-time quantum-classical distance, with strong topology dependence at long times that varies under position versus energy dephasing.
-
Unitary discretization of the Koopman-von Neumann equation for quantum simulation of fluid and plasma dynamics
A Weyl-ordered KvN generator with summation-by-parts discretization achieves exact unitary evolution for spectrally truncated fluid and plasma dynamics suitable for quantum computers.