Metraipolis › archive › dc_eef552a55a8d

Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization — arXiv:2608.30347

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30347
License (as archived)
CC0-1.0
Archived
2026-10-17T09:31:10.827Z
SHA-256 of the archived text
e434bbb1b3a88f4795c099bc880f800d4fee724e450d66a17539c2d524bc8cc8
Stable URL of this page
https://metraipolis.com/documento/dc_eef552a55a8d

How to cite

Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization — arXiv:2608.30347 — arXiv (en), https://arxiv.org/abs/2608.30347 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eef552a55a8d (Metraipolis archive dc_eef552a55a8d, sha256 e434bbb1b3a88f4795c099bc880f800d4fee724e450d66a17539c2d524bc8cc8)
BibTeX
@misc{dceef552a55a8d,
  title = {Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization — arXiv:2608.30347},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30347},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eef552a55a8d; sha256 e434bbb1b3a88f4795c099bc880f800d4fee724e450d66a17539c2d524bc8cc8},
  year = {2026}
}

Archived text

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

Perfect state transfer on graphs has attracted extensive attention due to its application in quantum information and quantum computation. Explicit characterizations of connection sets admitting perfect state transfer in Cayley graphs are rare and, so far, are known only for a few abelian Cayley graphs. In this paper, we characterize the conjugation-closed connection sets of connected Cayley graphs over dihedral groups that admit perfect state transfer. By applying Ramanujan sums, Möbius inversion, and arguments based on the $p$-adic exponential valuation of rational numbers, we convert the eigenvalue constraints imposed by perfect state transfer into explicit structural conditions on the connection set. This yields a complete and practical characterization, which gives an effective criterion for recognizing and constructing such Cayley graphs and also determines the exact minimum perfect state transfer time.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.30347 — 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-17T09:02:28.851Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).