Extremal eigenvalues of local Hamiltonians
نویسندگان
چکیده
We apply classical algorithms for approximately solving constraint satisfaction problems to find bounds on extremal eigenvalues of local Hamiltonians. We consider spin Hamiltonians for which we have an upper bound on the number of terms in which each spin participates, and find extensive bounds for the operator norm and ground-state energy of such Hamiltonians under this constraint. In each case the bound is achieved by a product state which can be found efficiently using a classical algorithm.
منابع مشابه
On simulation of Hamiltonians using local unitary transformations
We give necessary conditions for the simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants recently introduced in [1] [2]. The results show that the problem of simulation of Hamiltonians in arbitrary bipartite or multipartite quantum systems cannot be described by only using eigenvalue...
متن کاملOn simulation of Hamiltonians using local unitary transforamtions
We give a necessary condition for the simulation of Hamiltonians, which is independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants recently introduced in [1] [2]. The result shows that the problem of simulation of Hamiltonians in arbitrary bipartite quantum systems cannot be described by only using eigenvalues, which is quite different to the two-qubit cas...
متن کاملNecessary conditions for efficient simulation of Hamiltonians using local unitary transformations
We give necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants recently introduced in [1] [2]. The results show that the problem of efficient simulation of Hamiltonians in arbitrary bipartite or multipartite quantum systems cannot be described by o...
متن کاملNecessary conditions for efficient simulation of Hamiltonians using local unitary operations
We give necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues of Hamiltonians and based on the algebraic-geometric invariants introduced in [1] [2]. The results show that the problem of efficient simulation of Hamiltonians in arbitrary bipartite or multipartite quantum systems cannot be described by only using...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.00739 شماره
صفحات -
تاریخ انتشار 2015