Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

Spectral width and polynomial degree in perfect state transfer

  • Xingkun Song
Open at sourcePDFDOICite

Abstract

We study the minimum time for perfect state transfer under polynomial Hamiltonians with bounded degree and spectral width. For a strongly cospectral pair and width bound W, the optimum, when finite, is an integer multiple of π/W, determined by integer interpolation with prescribed parities. For equally spaced supported eigenvalues with alternating signs, we give degree bounds under which every minimizer is affine, and sharp asymptotics for each fixed exact degree. Near-minimizing phase polynomials satisfy a quantitative Chebyshev stability estimate. We determine the optimal transfer time for every degree bound on hypercubes of odd prime dimension. For complementary vertices of J(2m,m), the optimal time at fixed spectral width grows exponentially in m throughout an interval of feasible degrees. We also construct polynomial Hamiltonians showing that every feasible degree m−t with t=o(m) admits subexponential transfer time.

Related

  1. Perfect state transfer under matrix powers: parity and spectral arithmetic
    Xingkun Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsQuantum physics & quantum informationarXiv
  2. Perfect matchings in planar 3-connected graphs: girth five and minimum degree five
    Xinyu Dai
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Explicit M-polynomial and degree-based topological indices of Hanoi graphs
    El-Mehdi Mehiri
    Discrete Applied MathematicsPeer-reviewedLicence not statedFull text2 citedTheoretical & computational chemistryCombinatorics & discrete mathematicsHAL
  4. A Mealy machine with polynomial growth of irrational degree
    Laurent Bartholdi, Illya Reznykov
    International Journal of Algebra and ComputationPeer-reviewedLicence not statedFull text5 citedAlgebra & number theoryHAL
  5. Linear Independence of Polynomial Compositions with Bounded Input Degree
    Xiaotian Chang, Yacoub Hendi
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{song2026spectral,
  title = {{Spectral width and polynomial degree in perfect state transfer}},
  author = {Xingkun Song},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.23633},
  eprint = {2609.23633},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.23633},
}
RIS
TY  - UNPB
TI  - Spectral width and polynomial degree in perfect state transfer
AU  - Xingkun Song
PY  - 2026
DA  - 2026/09/20
PB  - arXiv
DO  - 10.48550/arxiv.2609.23633
UR  - https://arxiv.org/abs/2609.23633
AB  - We study the minimum time for perfect state transfer under polynomial Hamiltonians with bounded degree and spectral width. For a strongly cospectral pair and width bound W, the optimum, when finite, is an integer multiple of π/W, determined by integer interpolation with prescribed parities. For equally spaced supported eigenvalues with alternating signs, we give degree bounds under which every minimizer is affine, and sharp asymptotics for each fixed exact degree. Near-minimizing phase polynomials satisfy a quantitative Chebyshev stability estimate. We determine the optimal transfer time for every degree bound on hypercubes of odd prime dimension. For complementary vertices of J(2m,m), the optimal time at fixed spectral width grows exponentially in m throughout an interval of feasible degrees. We also construct polynomial Hamiltonians showing that every feasible degree m−t with t=o(m) admits subexponential transfer time.
ER  -