Topological Entanglement Entropy of a Bose-Hubbard Spin Liquid

The Landau paradigm of classifying phases by broken symmetries was demonstrated to be incomplete when it was realized that different quantum Hall states could only be distinguished by more subtle, topological properties. Today, the role of topology as an underlying description of order has branched out to include topological band insulators, and certain featureless gapped Mott insulators with a topological degeneracy in the groundstate wavefunction. Despite intense focus, very few candidates for these topologically ordered "spin liquids" exist. The main difficulty in finding systems that harbour spin liquid states is the very fact that they violate the Landau paradigm, making conventional order parameters non-existent. Here, we uncover a spin liquid phase in a Bose-Hubbard model on the kagome lattice, and measure its topological order directly via the topological entanglement entropy. This is the first smoking-gun demonstration of a non-trivial spin liquid, identified through its entanglement entropy as a gapped groundstate with emergent Z2 gauge symmetry.Comment: 4+ pages, 3 figure

Development and operation of elastic parallel tree search applications using TASKWORK

Cloud resources can be dynamically provisioned according to application-specific requirements and are payed on a per-use basis. This gives rise to a new concept for parallel processing: Elastic parallel computations. However, it is still an open research question to which extent parallel applications can benefit from elastic scaling, which requires resource adaptation at runtime and corresponding coordination mechanisms. In this work, we analyze how to address these system-level challenges in the context of developing and operating elastic parallel tree search applications. Based on our findings, we discuss the design and implementation of TASKWORK, a cloud-aware runtime system specifically designed for elastic parallel tree search, which enables the implementation of elastic applications by means of higher-level development frameworks. We show how to implement an elastic parallel branch-and-bound application based on an exemplary development framework and report on our experimental evaluation that also considers several benchmarks for parallel tree search