2000 character limit reached
Study of potential Hamiltonians for quantum graphity
Published 16 Aug 2018 in cond-mat.stat-mech | (1808.05632v1)
Abstract: In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we propose a new measure of the equivalence of vertices in the graph. We then propose a Hamiltonian that has a rectangular lattice as a ground state that appears to be non-degenerate. The resulting graphs are close to being a rectangular lattice, and the defects from the perfect lattice seem to behave like particles of quantized mass that attract one another.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.