Skip to content
aiqbench takeQuantum Comms

aiqbench analysis

This paper advances the theoretical limits of perfect state transfer in quantum networks by analyzing polynomial Hamiltonians with bounded spectral width and degree. It establishes precise conditions under which optimal transfer times are integer multiples of $\pi/W$ and derives sharp asymptotics for specific graph structures like hypercubes. These findings provide critical mathematical constraints for designing efficient, high-fidelity quantum communication protocols using engineered spectral properties.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Spectral width and polynomial degree in perfect state transfer

arXiv2 min read

arXiv:2609.23633v1 Announce Type: new 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.

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.

Quantum Physics (quant-ph); Combinatorics (math.CO)

arXiv:2609.23633 [quant-ph]

(or arXiv:2609.23633v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.23633 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 230 words

Related coverage