Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Entanglement: Bell Inequalities

In course

COM-309: Introduction to quantum information processing

Information is processed in physical devices. In the quantum regime the concept of classical bit is replaced by the quantum bit. We introduce quantum principles, and then quantum communications, key distribution, quantum entropy, and spin dynamics. No prio ...

Description

This lecture covers the concept of entanglement and Bell inequalities, exploring the proof of CSHS requirements, EPR paradox, and experimental verification. It delves into quantum mechanics, CHSH inequality, and experimental results.

Instructor

Nicolas Macris

Nicolas Macris received the PhD degree in theoretical physics from EPFL and then pursued his scientific activity at the mathematics department of Rutgers University (NJ, USA). He then joined the Faculty of Basic Science of EPFL, working in the field of quantum statistical mechanics and mathematical aspects of the quantum Hall effect. Since 2005 he is with the Communication Theories Laboratory and Information Processing group of the School of Communication and Computer Science and currently works at the interface of statistical mechanics, information theory and error correcting codes, inference and learning theory. He held long-term visiting appointments and collaborations with the University College and the Institute of Advanced studies in Dublin, the Ecole Normale Supérieure de Lyon, the Centre de Physique Theorique Luminy Marseille, Paris XI Orsay, the ETH Zürich and more recently Los Alamos National Lab. CV and publication list.

Official source

Related concepts (32)

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Proof theory

Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.

Proof (truth)

A proof is sufficient evidence or a sufficient argument for the truth of a proposition. The concept applies in a variety of disciplines, with both the nature of the evidence or justification and the criteria for sufficiency being area-dependent. In the area of oral and written communication such as conversation, dialog, rhetoric, etc., a proof is a persuasive perlocutionary speech act, which demonstrates the truth of a proposition.

Quantum mechanics

Quantum mechanics is a fundamental theory in physics that provides a description of the physical properties of nature at the scale of atoms and subatomic particles. It is the foundation of all quantum physics including quantum chemistry, quantum field theory, quantum technology, and quantum information science. Classical physics, the collection of theories that existed before the advent of quantum mechanics, describes many aspects of nature at an ordinary (macroscopic) scale, but is not sufficient for describing them at small (atomic and subatomic) scales.

Proof by contradiction

In logic, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Although it is quite freely used in mathematical proofs, not every school of mathematical thought accepts this kind of nonconstructive proof as universally valid. More broadly, proof by contradiction is any form of argument that establishes a statement by arriving at a contradiction, even when the initial assumption is not the negation of the statement to be proved.

Related lectures (50)

CHSH inequality

Explores the CHSH inequality, a Bell-type inequality used in quantum mechanics and quantum key distribution.

Quantum Entanglement: From Einstein to Bell

Delves into the journey from Einstein and Bell's debates to the practical applications of quantum entanglement, including quantum teleportation and key distribution.

Quantum Entanglement

Explores quantum entanglement, Bell inequalities, and self-testing in quantum systems.

Variational Formulation: Information Measures

Explores variational formulation for measuring information content and divergence between probability distributions.