Lecture

Free Energy and Semi-classical Propagator

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.

In course

PHYS-426: Quantum physics IV

Introduction to the path integral formulation of quantum mechanics. Derivation of the perturbation expansion of Green's functions in terms of Feynman diagrams. Several applications will be presented, including non-perturbative effects, such as tunneling an ...

Description

This lecture covers the concept of free energy as a sum of connected diagrams and the semi-classical propagator, emphasizing the calculation of coefficients and the general approximation methods used in quantum physics. The instructor discusses the perturbative theory and the semiclassical approximation when the wavelength of a particle is much shorter than the typical length over which the potential varies, providing insights into the geometric optics limit of wave propagation. The lecture also delves into the computation of propagators and the importance of vertices in graph theory.

Instructors (2)

Giuseppe Carleo

Giuseppe Carleo is a computational quantum physicist, whose main focus is the development of advanced numerical algorithms tostudy challenging problems involving strongly interacting quantum systems.He is best known for the introduction of machine learning techniques to study both equilibrium and dynamical properties,based on a neural-network representations of quantum states, as well for the time-dependent variational Monte Carlo method.He earned a Ph.D. in Condensed Matter Theory from the International School for Advanced Studies (SISSA) in Italy in 2011.He held postdoctoral positions at the Institut d’Optique in France and ETH Zurich in Switzerland, where he alsoserved as a lecturer in computational quantum physics.In 2018, he joined the Flatiron Institute in New York City in 2018 at the Center for Computational Quantum Physics (CCQ), working as a Research Scientist and project leader, and also leading the development of the open-source project NetKet.Since September 2020 he is an assistant professor at EPFL, in Switzerland, leading the Computational Quantum Science Laboratory (CQSL).

Riccardo Rossi

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Vertex (graph theory)

In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Related lectures (64)

Graph Theory and Network Flows

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Belief Propagation

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Information Theory: Basics

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Graph Sketching: Connected Components

Covers the concept of graph sketching with a focus on connected components.