no. 16 · Tuesday 17 November 2026
Graph spectra and late-time concurrence in a lossy reservoir network
Abstract
We investigate how coupling the local environments of noninteracting qubits into a network changes their late-time entanglement dynamics. Each qubit interacts with a lossy bosonic memory mode, with coherent hopping between memory modes determined by an underlying graph. The initial state contains at most two excitations. We show that the graph spectrum selects the collective modes that survive longest, thereby controlling both the decay and spatial distribution of pair concurrence. At resonance, nonbipartite graphs generically approach a fixed pattern of relative concurrence determined by the Perron eigenvector, whereas bipartite graphs support interference between two equally damped modes. This interference can produce arbitrarily late entanglement revivals when it overcomes the exponential decay of the surviving modes. We derive explicit thresholds separating revival and eventual monotonic decay, and show that loss from two-excitation states can drive the system across these thresholds without changing the graph or the initial one-excitation state. Underlying these results is a general bound on the sector decay rates, $γ_2\ge2γ_1$, valid at arbitrary uniform detuning. We also identify an exceptional equal-rate regime in which coherence between the vacuum and two-excitation sectors contributes to the leading concurrence. Together, these results establish how the topology of a structured dissipative environment and the redistribution of excitations through loss determine the long-time behavior of entanglement.
- comments
- 18 pages, 5 Figures
- fields
- Mathematical Physics