Unique Games Hardness of Quantum Max-Cut and Conjectured Vector-Valued Borell Inequality
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
The Most Addictive Python and SQL Courses
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore a comprehensive lecture on the Unique Games Hardness of Quantum Max-Cut and a conjectured vector-valued Borell's inequality presented by John Wright from the University of California, Berkeley. Delve into advanced concepts in quantum computing, optimization problems, and mathematical inequalities as part of IPAM's Topology, Quantum Error Correction and Quantum Gravity Workshop. Gain insights into the intersection of quantum mechanics, computational complexity theory, and mathematical analysis in this hour-long presentation recorded on November 28, 2023.
Syllabus
John Wright - Unique Games Hardness of Quantum Max-Cut & conjectured vector-valued Borell inequality
Taught by
Institute for Pure & Applied Mathematics (IPAM)