Frustrating frustrated problems
Helmut G. Katzgraber
Abstract
The advent of fast and cost-effective computers as well as efficient algorithms has made computational physics into a powerful third way, besides experiment and theory, to do research.  The computational physics group at Texas A&M studies problems ranging from the computation of error thresholds in topologically-protected quantum computing proposals and the calculation of quasiparticle braidings to emulate an universal set of quantum gates to dipolar random magnets, to structural and spin glasses. Despite ongoing research spanning several decades in the area of glassy systems, there remain many fundamental open questions in the field. Concepts from the study of glasses, such as ergodicity breaking, aging and ultrametricity have been applied to fields as diverse as structural biology, geology, computer science and even financial analysis. Understanding these systems on a fundamental level is therefore of paramount importance. I will illustrate why--thanks to modern computers and algorithms--these frustrated systems are not so frustrating after all and how we can answer the seemingly simple question: "Do spin glasses order in a field?"
 
 
Time: Apr. 18th, 2012 (Wednesday) 10:00am
Place: IOP D-210 Conference Room
Contact: Ying Deng 82649414