YoVDO

Classical Win Probability of CHSH Game - Quantum Computer Programming Lesson 78

Offered By: Ryan O'Donnell via YouTube

Tags

Quantum Computing Courses Game Theory Courses Probability Theory Courses Bell's Theorem Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the classical win probability of the CHSH Game in this 13-minute video lesson, part of the "Quantum Computer Programming in 100 Easy Lessons" series. Discover why Alice and Bob, using classical probabilistic strategies, cannot exceed a 75% win probability in the CHSH Game. Learn from Ryan O'Donnell, a professor at Carnegie Mellon University, as he delves into this fundamental concept in quantum computing. Gain insights into the limitations of classical strategies and understand the significance of this probability threshold in distinguishing classical from quantum approaches.

Syllabus

#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy Lessons


Taught by

Ryan O'Donnell

Related Courses

Introduction to Statistics: Probability
University of California, Berkeley via edX
Aléatoire : une introduction aux probabilités - Partie 1
École Polytechnique via Coursera
Einführung in die Wahrscheinlichkeitstheorie
Johannes Gutenberg University Mainz via iversity
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera
Probability
University of Pennsylvania via Coursera