arXiv:2609.20390
Entanglement Dynamics in Katz-Weighted Graph States
Lucio De Simone, Lorenzo Capra, Roberto Franzosi
Abstract
We investigate the entanglement dynamics of quantum states defined on graphs with non-local Ising interactions governed by the Katz kernel of the underlying network. The interaction pattern is physically motivated by a gapped fermionic mediator propagating on the same graph, whose perturbative elimination yields an effective Katz-weighted Ising Hamiltonian. Using the Entanglement Distance, we derive an exact analytical expression for the entanglement generated from an initially separable state and apply it to representative deterministic graph families. We then characterize the dynamics in different propagation regimes. In the weak-Katz regime, the dynamics admits a systematic motif expansion with triangles entering at first order order and four-cycles, local degree structure, and overlappin triangles appearing at second order. In the strong-propagation regime, the interaction is instead dominated by the principal adjacency mode and by the localization properties of its eigenvector. For Erdős--Rényi graphs, the weak-propagation expansion can be averaged analytically, revealing a locally tree-like contribution in the sparse regime and saturation of the Entanglement Distance density in the dense regime. Our results connect entanglement dynamics with both the walk-based and spectral structure of complex networks.
AI Summary
The paper asks how graph walks and spectral structure determine entanglement generated by nonlocal Ising interactions with Katz couplings $K=A(I-\beta A)^{-1}$. A second-order Schrieffer–Wolff elimination of a gapped fermionic mediator gives this interaction for $\beta<1/\lambda_1$, where $\lambda_1$ is the largest adjacency eigenvalue. Starting from $|+\rangle^{\otimes M}$, it derives the exact effective-model expression $E_i(t)=1-\prod_{j\ne i}\cos^2(tK_{ij})$, with dimensionless time $t=J\tau$. The total Entanglement Distance $E=\sum_iE_i$ sums normalized single-qubit linear entropies, quantifying one-qubit-versus-rest entanglement. Complete, star, and path graphs receive analytical treatments; the asymmetric 12-vertex Frucht graph is evaluated numerically. Special times on complete and star graphs produce states locally Clifford-equivalent to GHZ states, or collectively twisted variants. Expanding through $O(\beta^2)$ while retaining finite-time dependence connects first-order corrections to triangles and second-order corrections to four-cycles, neighborhood degrees, and overlapping triangles. A sufficient control condition is $t\beta\lambda_1^2/(1-\beta\lambda_1)\ll1$. Near the Katz threshold, keeping $s=t\lambda_1/(1-\beta\lambda_1)$ fixed yields principal-eigenvector-controlled dynamics; localization concentrates the entangling phases. Analytical Erdős–Rényi averages give a vanishing linear correction in the sparse regime $p=c/M$, with surviving quadratic terms determined by locally tree-like branching. In the dense regime, the density $E/M$ approaches one away from adjacency revival times within the controlled weak-propagation scaling. Exactness applies only within the effective Ising model; robustness to disorder, mediator inhomogeneity, and decoherence, and graph design for targeted state preparation, remain open extensions.
Error found: For disconnected graphs with a degenerate largest adjacency eigenvalue, the strong-propagation limit requires the full top-eigenspace projector rather than the paper's single principal-eigenvector formula. The dense Erdős–Rényi saturation claim fails at adjacency revival times t=nπ, where the ED density can tend to zero even while both stated weak-propagation conditions hold.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11 pages, 6 figures