Metraipolis › archive › dc_f12d49bffaaa

Quantum walks and graph operations — arXiv:2610.07673

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07673
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:09.296Z
SHA-256 of the archived text
8e9acd4377ffd8ddc0fd1de216b67e4ee1cdfaf513832593288c481b3a1dc02a
Stable URL of this page
https://metraipolis.com/documento/dc_f12d49bffaaa

How to cite

Quantum walks and graph operations — arXiv:2610.07673 — arXiv (en), https://arxiv.org/abs/2610.07673 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f12d49bffaaa (Metraipolis archive dc_f12d49bffaaa, sha256 8e9acd4377ffd8ddc0fd1de216b67e4ee1cdfaf513832593288c481b3a1dc02a)
BibTeX
@misc{dcf12d49bffaaa,
  title = {Quantum walks and graph operations — arXiv:2610.07673},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07673},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f12d49bffaaa; sha256 8e9acd4377ffd8ddc0fd1de216b67e4ee1cdfaf513832593288c481b3a1dc02a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07673. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $U_X(t)$ be the transition matrix of a quantum walk on a graph $X$ relative to its adjacency matrix $A$ or the Laplacian matrix $L$. This paper investigates the behavior of quantum walks under Cartesian products, joins, and graph complements. We have two main goals. First, we characterize the conditions such that peak state transfer and pretty good state transfer are preserved under these operations, allowing us to construct new families of graphs admitting these properties. Our second goal is to analyze the relationship between the quantum walks on a graph and its complement. We provide bounds for $f_{u,v}(t)=\big|U_{X^c}(t)_{u,v}-e^{it\delta}U_X(-t)_{u,v}\big|$ and $g_{u,v}(t)=\big||U_X(t)_{u,v}|-|U_{X^c}(t)_{u,v}|\big|$, where $\delta=-1$ when dealing with $A$ and $\delta=n$ otherwise. Note that $f_{u,v}(t)$ and $g_{u,v}(t)$ both measure the difference between the behavior of quantum state transfer between vertices $u$ and $v$ in a graph and its complement. If $X$ is regular or $M=L$, then $f_{u,v}(t)$ is bounded above by $\frac{2}{|V(X)|}$. If $X$ is non-regular and $M=A$, then we utilize the main eigenvalues of a graph to obtain an upper bound for $f_{u,v}(t)$ which depends only on $A$. We also use the bounding matrix of the graph to give bounds for the Nordhaus-Gaddum type relations $|U_X(t)_{u,v}|+|U_{X^c}(t)_{u,v}|$ and $|U_X(t)_{u,v}|\cdot |U_{X^c}(t)_{u,v}|$. Finally, we demonstrate that most of our bounds are sharp for certain families of graphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07673 — 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-07T11:22:09.547Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).