Metraipolis › archive › dc_950d7b1e882f
Perfect $(s,r)$-state transfer — arXiv:2609.10713
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10713
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:14:10.442Z
- SHA-256 of the archived text
8816cb31bc82bcce25cc0ff34006ca1f3344389c908c3a5f9c138902d854c6cb- Stable URL of this page
https://metraipolis.com/documento/dc_950d7b1e882f
How to cite
Perfect $(s,r)$-state transfer — arXiv:2609.10713 — arXiv (en), https://arxiv.org/abs/2609.10713 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_950d7b1e882f (Metraipolis archive dc_950d7b1e882f, sha256 8816cb31bc82bcce25cc0ff34006ca1f3344389c908c3a5f9c138902d854c6cb)
BibTeX
@misc{dc950d7b1e882f,
title = {Perfect $(s,r)$-state transfer — arXiv:2609.10713},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10713},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_950d7b1e882f; sha256 8816cb31bc82bcce25cc0ff34006ca1f3344389c908c3a5f9c138902d854c6cb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10713. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of two vertex states, i.e.\ from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf \mu=\mathbf e_{\alpha} + r \mathbf e_{\beta}$, where $r=s$ is either $-1$ (which corresponds to pair state transfer) or $+1$ (which corresponds to plus state transfer), or more recently $r=s$ is taken to be any real number (which corresponds to $s$-pair state transfer). Here, we broaden the investigation of $s$-pair state transfer to \textit{perfect $(s,r)$-state transfer}, which is perfect state transfer from $\mathbf u = \mathbf e_a + s \mathbf e_b$ to $\mathbf \mu=\mathbf e_{\alpha} + r \mathbf e_{\beta}$ (up to some dilation) where $r,s\in \mathbb C$. We identify infinite families of graphs with perfect $(s,r)$-state transfer and provide characterizations of cases when $|r|= |s|$ and when $|r|\neq |s|$, showing situations when the degree of entanglement between vertex states is preserved, and when it is not preserved. The latter is particularly important as it represents perfect state transfer from an entangled pair of qubits to another one where the degree of entanglement need not be the same\mdash in fact, it can be set up so as to ``boost'' (increase) entanglement. We provide an algorithm that finds the vector with two nonzero entries that maximizes the fidelity of transfer for a fixed time $t$ starting from a given $s$-pair state $\mathbf u$. Finally, we provide a sensitivity analysis, with respect to readout time errors, of perfect $(s,r)$-state transfer.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Quantum Physics (quant-ph) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.10713 — 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-16T05:59:08.316Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).