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

Game Theory
Stanford University via Coursera
Model Thinking
University of Michigan via Coursera
Online Games: Literature, New Media, and Narrative
Vanderbilt University via Coursera
Games without Chance: Combinatorial Game Theory
Georgia Institute of Technology via Coursera
Competitive Strategy
Ludwig-Maximilians-Universität München via Coursera