Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Noncommutative Analysis, Computational Complexity, and Quantum Information

Harvard CMSA via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intersection of noncommutative analysis, computational complexity, and quantum information through this comprehensive lecture series from Harvard CMSA. Delve into advanced topics including invariant theory and noncommutative optimization with presentations by Ankit Garg and Rafael Oliveira, examining theoretical foundations and practical applications. Learn about sum-of-squares hierarchies in quantum information systems through Aram Harrow's analysis, and discover the Bayesian perspective on optimization problems, particularly quantum separability challenges, as presented by Boaz Barak. Investigate the mathematical structures underlying algebras and synchronous games with Vern Paulsen, while exploring quantum measurement compatibility and free spectrahedra inclusion through Ion Nechita's research. Master practical algorithmic approaches to matrix scaling problems with Jason Altschuler's nearly-optimal solutions, and examine approximation algorithms specifically designed for quantum many-body systems through David Gosset's work. Gain insights into non-convex optimization through geometric perspectives with Suvrit Sra, and explore the intricate world of matricial singularities in noncommutative polynomials with Jurij Volčič. Expand your understanding of mathematical foundations through Salma Kuhlmann's exploration of generalized power series fields, and conclude with Victor Vinnikov's analysis of noncommutative analytic function germs at matrix points, providing a comprehensive foundation in these interconnected mathematical and computational domains.

Syllabus

Ankit Garg | Invariant theory, noncommutative optimization and applications Pt. I
Rafael Oliveira | Invariant theory, noncommutative optimization and applications Pt. II
Aram Harrow | Sum-of-squares hierarchies and quantum information
Boaz Barak | The Bayesian view of optimization and the quantum separability problem
Vern Paulsen | Algebras and Synchronous Games
Ion Nechita | Compatibility of quantum measurements and inclusion of free spectrahedra
Jason Altschuler | Simple, practical, nearly-optimal algorithms for matrix scaling
David Gosset | Approximation algorithms for quantum many-body problems
Suvrit Sra | Some non-convex optimization problems through a geometric lens
Jurij Volčič | Matricial singularities of noncommutative polynomials
Salma Kuhlmann | Fields of Generalized Power Series
Victor Vinnikov | Germs of nc analytic functions at a matrix point

Taught by

Harvard CMSA

Reviews

Start your review of Noncommutative Analysis, Computational Complexity, and Quantum Information

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.