  We quantify the effect of weighted loops at the source and target nodes of a
graph on the strength of quantum state transfer between these vertices. We give
lower bounds on loop weights that guarantee strong transfer fidelity that works
for any graph where this protocol is feasible. By considering local spectral
symmetry, we show that the required weight size depends only on the maximum
degree of the graph and, in some less favorable cases, the distance between
vertices. Additionally, we explore the duration for which transfer strength
remains above a specified threshold.
