analiza aiqbench
This study establishes rigorous upper bounds on recurrence times in isolated quantum systems, linking the phenomenon directly to inverse quantum speed limit problems and Hamiltonian variance. By demonstrating that these theoretical limits are generically saturated for random Hamiltonians, the research provides a quantitative framework essential for understanding fundamental dynamics in closed quantum environments without relying on AI or classical machine learning techniques.
Tight bounds on recurrence time in closed quantum systems
arXiv:2601.10409v3 Announce Type: replace Abstract: The evolution of an isolated quantum system inevitably exhibits recurrence: the state returns to the vicinity of its initial condition after finite time. Despite its fundamental nature, a rigorous quantitative understanding of recurrence has been lacking. We establish upper bounds on the recurrence time, $t_{\mathrm{rec}} \lesssim t_{\mathrm{exit}}(\epsilon)(1/\epsilon)^d$, where $d$ is the Hilbert-space dimension, $\epsilon$ the neighborhood size, and $t_{\mathrm{exit}}(\epsilon)$ the escape time from this neighborhood. For pure states evolving under a Hamiltonian $H$, estimating $t_{\mathrm{exit}}$ is equivalent to an inverse quantum speed limit problem: finding upper bounds on the time a time-evolved state $\psi_t$ needs to depart from the $\epsilon$-vicinity of the initial state $\psi_0$. We provide a partial solution, showing that under mild assumptions $t_{\mathrm{exit}}(\epsilon) \approx \epsilon /\sqrt{ \Delta(H^2)}$, with $\Delta(H^2)$ the Hamiltonian variance in $\psi_0$. We show that our upper bound on $t_{\mathrm{rec}}$ is generically saturated for random Hamiltonians. Finally, we analyze the impact of coherence of the initial state in the eigenbasis of $H$ on recurrence behavior.
Abstract:The evolution of an isolated quantum system inevitably exhibits recurrence: the state returns to the vicinity of its initial condition after finite time. Despite its fundamental nature, a rigorous quantitative understanding of recurrence has been lacking. We establish upper bounds on the recurrence time, $t_{\mathrm{rec}} \lesssim t_{\mathrm{exit}}(\epsilon)(1/\epsilon)^d$, where $d$ is the Hilbert-space dimension, $\epsilon$ the neighborhood size, and $t_{\mathrm{exit}}(\epsilon)$ the escape time from this neighborhood. For pure states evolving under a Hamiltonian $H$, estimating $t_{\mathrm{exit}}$ is equivalent to an inverse quantum speed limit problem: finding upper bounds on the time a time-evolved state $\psi_t$ needs to depart from the $\epsilon$-vicinity of the initial state $\psi_0$. We provide a partial solution, showing that under mild assumptions $t_{\mathrm{exit}}(\epsilon) \approx \epsilon /\sqrt{ \Delta(H^2)}$, with $\Delta(H^2)$ the Hamiltonian variance in $\psi_0$. We show that our upper bound on $t_{\mathrm{rec}}$ is generically saturated for random Hamiltonians. Finally, we analyze the impact of coherence of the initial state in the eigenbasis of $H$ on recurrence behavior.
arXiv:2601.10409 [quant-ph]
(or arXiv:2601.10409v3 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2601.10409 Focus to learn more arXiv-issued DOI via DataCite
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.
Text integral sub licența deschisă a publicației · 249 cuvinte
Subiecte conexe

How long before a quantum system repeats itself?
Quantum Zeitgeist · 1 oct. 2026
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026

AI and Quantum Computing Briefing
livetradingnews.com · 4 aug. 2026

A brief history of quantum vs classical computational advantage
Quantum Journal · 1 sept. 2026