English
Related papers

Related papers: Operator growth bounds from graph theory

200 papers

We exactly solve a quantum Fermi accelerator model consisting of a time-independent non-Hermitian Hamiltonian with time-dependent Dirichlet boundary conditions. A Hilbert space for such systems can be defined in two equivalent ways, either…

Quantum Physics · Physics 2024-03-20 Andreas Fring , Takano Taira

The accuracy of quantum dynamics simulation is usually measured by the error of the unitary evolution operator in the operator norm, which in turn depends on certain norm of the Hamiltonian. For unbounded operators, after suitable…

Quantum Physics · Physics 2021-05-26 Dong An , Di Fang , Lin Lin

We provide a framework to determine the upper bound to the complexity of a computing a given observable with respect to a Hamiltonian. By considering the Heisenberg evolution of the observable, we show that each Hamiltonian defines an…

Quantum Physics · Physics 2025-08-04 Igor Ermakov , Tim Byrnes , Oleg Lychkovskiy

In an isolated system, the time evolution of a given observable in the Heisenberg picture can be efficiently represented in Krylov space. In this representation, an initial operator becomes increasingly complex as time goes by, a feature…

We develop a Logvinenko--Sereda theory for one-dimensional vector-valued self-adjoint operators. We thus deliver upper bounds on $L^2$-norms of eigenfunctions -- and linear combinations thereof -- in terms of their $L^2$- and…

Spectral Theory · Mathematics 2024-07-23 Michela Egidi , Delio Mugnolo , Albrecht Seelmann

In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector crafting, and show that these…

Computational Complexity · Computer Science 2016-10-31 Hans L. Bodlaender , Tom C. van der Zanden

We establish the existence of free energy limits for several combinatorial models on Erd\"{o}s-R\'{e}nyi graph $\mathbb {G}(N,\lfloor cN\rfloor)$ and random $r$-regular graph $\mathbb {G}(N,r)$. For a variety of models, including…

Probability · Mathematics 2013-12-17 Mohsen Bayati , David Gamarnik , Prasad Tetali

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

Mathematical Physics · Physics 2018-09-28 Daniel Lenz , Carsten Schubert , Ivan Veselić

The growth of commutators of initially commuting local operators diagnoses the onset of chaos in quantum many-body systems. We compute such commutators of local field operators with $N$ components in the $(2+1)$-dimensional $O(N)$ nonlinear…

Strongly Correlated Electrons · Physics 2017-09-13 Debanjan Chowdhury , Brian Swingle

In this paper we numerically calculate the out-of-time-order correlation functions in the one-dimensional Bose-Hubbard model. Our study is motivated by the conjecture that a system with Lyapunov exponent saturating the upper bound…

Quantum Gases · Physics 2017-08-21 Huitao Shen , Pengfei Zhang , Ruihua Fan , Hui Zhai

We obtain a central limit theorem for bulk counting statistics of free fermions in smooth domains of $\mathbb{R}^n$ with an explicit description of the covariance structure. This amounts to a study of the asymptotics of norms of commutators…

Spectral Theory · Mathematics 2024-05-14 Alix Deleporte , Gaultier Lambert

Bounded-size rules are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. One starts with the empty graph and at each stage two edges are chosen uniformly at random. One of…

Probability · Mathematics 2019-02-20 Shankar Bhamidi , Amarjit Budhiraja , Xuan Wang

Heisenberg time evolution under a chaotic many-body Hamiltonian $H$ transforms an initially simple operator into an increasingly complex one, as it spreads over Hilbert space. Krylov complexity, or `K-complexity', quantifies this growth…

High Energy Physics - Theory · Physics 2021-06-30 E. Rabinovici , A. Sánchez-Garrido , R. Shir , J. Sonner

Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…

Functional Analysis · Mathematics 2017-01-19 Palle Jorgensen , Erin Pearse , Feng Tian

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

Spectral Theory · Mathematics 2019-06-04 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

Combinatorics · Mathematics 2017-03-09 Luke Sernau

There has recently been considerable interest in studying quantum systems via dynamical Lie algebras (DLAs) -- Lie algebras generated by the terms which appear in the Hamiltonian of the system. However, there are some important properties…

We present a systematic development of inductive limits in the categories of ordered *-vector spaces, Archimedean order unit spaces, matrix ordered spaces, operator systems and operator C*-systems. We show that the inductive limit…

Operator Algebras · Mathematics 2017-05-15 Linda Mawhinney , Ivan G. Todorov

This paper investigates the temperature dependence of quantum information scrambling in local systems with an energy gap, $m$, above the ground state. We study the speed and shape of growing Heisenberg operators as quantified by…

Statistical Mechanics · Physics 2020-11-11 Subhayan Sahu , Brian Swingle

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

Probability · Mathematics 2016-08-11 Viktor Harangi , Bálint Virág