YoVDO

Exponential Separation between Quantum Communication and Logarithm of Approximate Rank

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Theoretical Computer Science Courses Quantum Communication Courses

Course Description

Overview

Explore groundbreaking research on quantum communication and approximate rank in this 19-minute IEEE conference talk. Delve into the exponential separation between quantum communication and the logarithm of approximate rank as presented by Makrand Sinha and Ronald de Wolf. Learn about randomized and quantum communication, the SINK function, and its approximate rank. Examine the theorem on quantum communication and understand the implications of conditioning on collision events. Consider the implications for the Log-rank Conjecture and gain insights into cutting-edge developments in quantum information theory.

Syllabus

Intro
Randomized and Quantum Communication
The SINK Function
Approximate Rank of SINK
Theorem: Quantum Communication
Conditioning on Collision Events
Log-rank Conjecture?


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera