Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations

DOI10.1063/1.5084136MaRDI QIDQ5228057zbMATH OpenOpenAlexFDO

Authors Yingkai Ouyang

Publication date 8 August 2019

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.02446, http://eprints.whiterose.ac.uk/152018/8/1.5084136.pdf

zbMATH Keywords

algorithmsgraphsspectral graph theoryexact solutionsspectral gapmean field modelisoperimetric boundslower bounds on the spectrumcombinatorial optimization algorithmgraph diametersSobolev inequalities on graphsbounds on largest eigenvaluesHeisenberg Hamiltonian (HH)Heisenberg spectrumHeisenberg spin 1/2 ferromagnetic model (HM)symmetric powers of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Software, source code, etc. for problems pertaining to statistical mechanics (82-04) Exact enumeration problems, generating functions (05A15) Estimates of eigenvalues in context of PDEs (35P15) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Interacting particle systems in time-dependent statistical mechanics (82C22) Statistical mechanics of magnetic materials (82D40)

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.

Recommendations

• Spectral bounds for the Ising ferromagnet on an arbitrary given graph
• On the spectrum of the Heisenberg Hamiltonian
• Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
• Ordering of Energy Levels in Heisenberg Models and Applications
• Upper bound on the free energy of the spin 1/2 Heisenberg ferromagnet

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3002434 (Why is no real title available?)
• scientific article; zbMATH DE number 2120941 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A class of asymmetric gapped Hamiltonians on quantum spin chains and its characterization I
• Approximation algorithms for NP-hard problems.
• Association schemes and coding theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Edge isoperimetric inequalities for product graphs
• Eigenvalues and expanders
• Eigenvalues of Graphs and Sobolev Inequalities
• Fast linear algebra is stable
• Isoperimetric Inequalities and Their Applications
• Laplacian matrices of graphs: A survey
• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• On a problem of Kleitman and West
• Permutation-invariant qudit codes from polynomials
• Permutationally invariant codes for quantum error correction
• Proof of Aldous' spectral gap conjecture
• Sobolev spaces on graphs
• Some simplified NP-complete graph problems
• Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
• Spectrum and scattering of excitations in the one-dimensional isotropic Heisenberg model
• Swapping labeled tokens on graphs
• Symmetric squares of graphs
• The connectivity of token graphs
• Token graphs
• Upper bounds for eigenvalues of the discrete and continuous Laplace operators
• Validity of the spin-wave approximation for the free energy of the Heisenberg ferromagnet
• Vertex Bisection is Hard, too

Cited in

(9)

• The edge-connectivity of token graphs
• On the Connectivity of Token Graphs of Trees
• On the algebraic connectivity of some token graphs
• Garland's method for token graphs
• Quantitatively improved finite-size criteria for spectral gaps
• Entanglement entropy bounds in the higher spin XXZ chain
• On the spectra of token graphs of cycles and other graphs
• The automorphism groups of some token graphs
• Spectral properties of token graphs

This page was built for publication: Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228057)