Lecture

Spin Glasses and Holography

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores the connection between spin glasses and holography, focusing on the role of disorder and averaging in AdS/CFT discussions. It delves into topics such as the SYK model, the pseudo-Goldstone associated with reparametrizations, and the quantum butterfly effect. The speaker discusses the characteristic properties of the spin glass phase, the behavior of the Lyapunov exponent, and the fate of zero temperature entropy. The lecture also touches upon the complexity of canonical ensembles, the p-spin spherical model, and the large N effective action for the SU(M) Heisenberg magnet. The analytical treatment of the transition from the deconfined SYK spin liquid to the confined spin glass is also presented.

Official source

Related concepts (32)

Mood disorder

A mood disorder, also known as an affective disorder, is any of a group of conditions of mental and behavioral disorder where a disturbance in the person's mood is the main underlying feature. The classification is in the Diagnostic and Statistical Manual of Mental Disorders (DSM) and International Classification of Diseases (ICD).

Complexity class

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Personality disorder

Personality disorders (PD) are a class of mental disorders characterized by enduring maladaptive patterns of behavior, cognition, and inner experience, exhibited across many contexts and deviating from those accepted by the individual's culture. These patterns develop early, are inflexible, and are associated with significant distress or disability. The definitions vary by source and remain a matter of controversy.

Schizoaffective disorder

Schizoaffective disorder (SZA, SZD) is a mental disorder characterized by abnormal thought processes and an unstable mood. This diagnosis requires symptoms of both schizophrenia (usually psychosis) and a mood disorder: either bipolar disorder or depression. The main criterion is the presence of psychotic symptoms for at least two weeks without any mood symptoms. Schizoaffective disorder can often be misdiagnosed when the correct diagnosis may be psychotic depression, bipolar I disorder, schizophreniform disorder, or schizophrenia.

Related lectures (64)

Statistical Entropy and Disorder

Explores statistical entropy and disorder in isolated systems, including kinetic gases and calorimetric coefficients.

Replica Symmetry Breaking: Full Solution & Condensation

Explores Replica Symmetry Breaking in the Random Energy Model, discussing configurational entropy and condensation.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Implementation Research: Concepts and Scope