Skip to content
Preprint

Spectral width and polynomial degree in perfect state transfer

Sep 2026 · 0 citations · 16 references
Physics Mathematics

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 $\pi/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.

View source

Similar papers

Preprint Sep 2026

Perfect state transfer under matrix powers: parity and spectral arithmetic

For a real symmetric matrix $H$ and distinct vertices $a,b$, we classify exponents $k$ for which $H^k$ has perfect state transfer (PST) from $a$ to $b$. If their supported eigenvalues are integer multiples of a common positive number, every odd exponent reduces to $H$ and every positive even exponent reduces to $H^2$....

Xing-Wu Song · 1 citation · ⚡1
Review Nov 2026

Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus

This paper proves asymptotically optimal linear degree lower bounds for Nullstellensatz and Polynomial Calculus, yielding a four-way polynomial-versus-exponential proof-size classification for uniform polynomial consequences over fields of positive characteristic. The size bounds use full, explicit coefficient lists, i...

Søren Riis · 0 citations
Preprint Nov 2026

Sharp Proximity Bounds for Integer Programs with Few Rows

We study the proximity between an optimal vertex of a standard form linear program with constraint matrix $A\in\mathbb{Z}^{m\times n}$ and an optimal integer solution. When $m = 2$, we prove the sharp infinity-norm bound $\Delta-1$, where $\Delta$ is the largest absolute maximal minor of $A$. When $m = 1$, we express t...

Stefan Kuhlmann, Lu-Ze Xu · 0 citations
Preprint Nov 2026

Levenshtein-type bounds for $(a,b)$-avoiding spherical codes

We develop a Levenshtein-type linear programming framework (for maximal $s$-codes and for minimal energy) for $(a,b)$-avoiding spherical codes, that is, codes whose inner products between distinct points avoid $(a,b)$. We introduce and investigate signed measures that are positive definite up to an appropriate degree a...

P. Boyvalenkov, D. Cherkashin, P. Dragnev et al. · 0 citations
Preprint Oct 2026

Yau's number-theoretic conjecture and sharp spectral bounds for quantum harmonic oscillators

We prove Yau's number-theoretic conjecture on positive integral points in real right simplices in every dimension $n\ge3$, and apply the resulting sharp polynomial bound to quantum harmonic oscillators. The lattice-point bound holds for every choice of positive real intercepts for which the count is nonzero, with equal...

Zhi-Wen Liu, S. Yau, Hao Zuo · 1 citation
Preprint Oct 2026

Uniform adjacency-degree probes from differential rigidity

We construct a fixed triangular family of noncommutative polynomials that spans the joint cyclic module of a real symmetric pair from any prescribed vector. In dimension at most $N$, when the second matrix has spectral diameter at most $N-1$, the family has $N(N+1)/2$ members, degree at most $N-1$, and a shared arithme...

Zhi-Peng Lu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.