### Refine

#### Year of publication

- 2012 (2) (remove)

A Bose-Hubbard model on a dynamical lattice was introduced in previous work as a spin system analogue of emergent geometry and gravity. Graphs with regions of high connectivity in the lattice were identified as candidate analogues of spacetime geometries that contain trapped surfaces. We carry out a detailed study of these systems and show explicitly that the highly connected subgraphs trap matter. We do this by solving the model in the limit of no back-reaction of the matter on the lattice, and for states with certain symmetries that are natural for our problem. We find that in this case the problem reduces to a one-dimensional Hubbard model on a lattice with variable vertex degree and multiple edges between the same two vertices. In addition, we obtain a (discrete) differential equation for the evolution of the probability density of particles which is closed in the classical regime. This is a wave equation in which the vertex degree is related to the local speed of propagation of probability. This allows an interpretation of the probability density of particles similar to that in analogue gravity systems: matter inside this analogue system sees a curved spacetime. We verify our analytic results by numerical simulations. Finally, we analyze the dependence of localization on a gradual, rather than abrupt, falloff of the vertex degree on the boundary of the highly connected region and find that matter is localized in and around that region.

In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath couplings that is applicable even in the thermodynamic limit. We identify conditions under which thermalization happens and discuss the underlying physics. Based on these results, we also present a fully general quantum algorithm for preparing Gibbs states on a quantum computer with a certified runtime and error bound. This complements quantum Metropolis algorithms, which are expected to be efficient but have no known runtime estimates and only work for local Hamiltonians.