Lecture

Symmetry Operations in Quantum Mechanics

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

CH-250: Mathematical methods in chemistry

This course consists of two parts. The first part covers basic concepts of molecular symmetry and the application of group theory to describe it. The second part introduces Laplace transforms and Fourier series and their use for solving ordinary and partia ...

Description

This lecture covers the concept of symmetry operations in quantum mechanics, focusing on how these operations map states to preserve their properties. The instructor explains the relationship between Hamiltonians and symmetry elements, emphasizing the importance of eigenstates. The lecture also discusses the protection of files using security measures and password policies. Various examples and exercises are provided to illustrate the application of symmetry operations in quantum mechanics.

Instructors (2)

Jiri Vanicek

Teaching & PhD PhD Students Liam Oliver Marsh, Yeha Lee, Davide Barbiero, Yannick Calvino Alonso, Manas Nagda Past EPFL PhD Students Cesare Mollica, Ray Marcel Marin Florez, Marius Wehrle, Aurélien Patoz, Konstantin Karandashev, Tomislav Begusic, Julien Roulet, Seonghoon Choi, Roya Moghaddasi Fereidani, Zhan Tong Zhang, Eriks Kletnieks, Alan Scheidegger, Fabian Kröninger Courses Mathematical methods in chemistry CH-250 This course consists of two parts. The first part covers basic concepts

Ulrich Lorenz

Teaching & PhD PhD Students Jakub Hruby Past EPFL PhD Students Pavel Olshin, Gabriele Bongiovanni, Chengcheng Yan, Oliver Florian Harder, Mowry Nathan Junior, Constantin Richard Krüger

Official source

Related concepts (32)

Boundary layer

In physics and fluid mechanics, a boundary layer is the thin layer of fluid in the immediate vicinity of a bounding surface formed by the fluid flowing along the surface. The fluid's interaction with the wall induces a no-slip boundary condition (zero velocity at the wall). The flow velocity then monotonically increases above the surface until it returns to the bulk flow velocity. The thin layer consisting of fluid whose velocity has not yet returned to the bulk flow velocity is called the velocity boundary layer.

Type system

In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.

Type safety

In computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors.

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Dependent type

In computer science and logic, a dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and type systems. In intuitionistic type theory, dependent types are used to encode logic's quantifiers like "for all" and "there exists". In functional programming languages like Agda, ATS, Coq, F*, Epigram, and Idris, dependent types help reduce bugs by enabling the programmer to assign types that further restrain the set of possible implementations.

Related lectures (32)

Symmetry & Group Theory

Covers the fundamental concepts of symmetry and group theory.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Hamiltonian Mechanics: Phase Space and Poisson Bracket

Explores phase space, the Poisson bracket, and Hamiltonian mechanics concepts.

Robotics: Actuation and Mobility Analysis

Covers corrected exercises from the 2020 exam in the field of robotics, including topics such as accuracy, speed, DC motors, optimal gear ratio, dynamics of robot arms, encoders, and kinematics.

Multi-Regional Input Output Analysis: EXIOBASE 3