Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations

Abstract

We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the connection between Heisenberg models and the symmetric products of $G$. Our algorithms for computing upper bounds are based on generalized diameters of graphs. Computing the upper bounds amounts to solving the minimum assignment problem on $G$, which has well-known polynomial-time algorithms from the field of combinatorial optimization. We also study the possibility of computing the lower bounds on some of the smaller energy eigenvalues of Heisenberg models. This amounts to estimating the isoperimetric inequalities of the symmetric product of graphs. By using connections with discrete Sobolev inequalities, we show that this can be performed by considering just the vertex-induced subgraphs of $G$. If our conjecture for a polynomial time approximation algorithm to solve the edge-isoperimetric problem holds, then our proposed method of estimating the energy eigenvalues via approximating the edge-isoperimetric properties of vertex-induced subgraphs will yield a polynomial time algorithm for estimating the smaller energy eigenvalues of the Heisenberg ferromagnet.

25 pages, 2 figures. Merged from arxiv:1612.08259

References in corpus (2)

• Constructing physically intuitive graph invariants
• Validity of spin wave theory for the quantum Heisenberg model

Cited by in corpus (7)

• Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming
• Quantum storage in quantum ferromagnets
• Quantitatively improved finite-size criteria for spectral gaps
• On the Connectivity of Token Graphs of Trees
• Hamiltonicity of Token Graphs of some Join Graphs
• The automorphism groups of some token graphs
• Entanglement Entropy Bounds in the Higher Spin XXZ Chain