Metraipolis › archive › dc_6d08f79e37f2
Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks — arXiv:2608.19020
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.19020
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:12:54.335Z
- SHA-256 of the archived text
7d640e8749ac950e4e6c52ae39af042d05e83e7d5256d0943c920a8daff48b3d- Stable URL of this page
https://metraipolis.com/documento/dc_6d08f79e37f2
How to cite
Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks — arXiv:2608.19020 — arXiv (en), https://arxiv.org/abs/2608.19020 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6d08f79e37f2 (Metraipolis archive dc_6d08f79e37f2, sha256 7d640e8749ac950e4e6c52ae39af042d05e83e7d5256d0943c920a8daff48b3d)
BibTeX
@misc{dc6d08f79e37f2,
title = {Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks — arXiv:2608.19020},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.19020},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6d08f79e37f2; sha256 7d640e8749ac950e4e6c52ae39af042d05e83e7d5256d0943c920a8daff48b3d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19020. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that entanglement-generation speed across a fixed network interface is governed by two distinct resources: the entangling capacity of the interface itself and the ability of the surrounding architecture to replenish it with fresh degrees of freedom. For fermionic Gaussian dynamics, we derive the coefficient-sharp bound $\sum_k|\dot\theta_k|\leq\frac12\|K_{AB}\|_*$ on the collective speed of the canonical entanglement angles. Explicit Ising-chain rematching trajectories saturate this bound, thereby certifying exact minimum interaction times under the stated control model. Beyond the Gaussian setting, exhaustive optimization of the complete $N=8$ tree--tree family shows that, at fixed interface capacity, first-layer entanglement, connectedness, and edge budget, the saturation depth is exactly classified by rooted architecture. With higher-resolution $x$-only control, variational entanglement-enhancing-field (VEEF) optimization reaches the numerically resolved fast-$X$ optimum in a two-channel benchmark. Across all 21 symmetry-reduced rooted orbits, a pre-specified two-time VEEF growth diagnostic recovers the complete replenishment partition directly from optimized dynamics. Interface capacity therefore sets how much entangling flux is available, whereas architecture determines whether fresh degrees of freedom can continually replenish the interface and sustain repeated use of that capacity.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-20 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el).
Pagina del lavoro: https://arxiv.org/abs/2608.19020 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:10:23.826Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).