Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a mathematical lecture examining the Aaronson-Ambainis (AA) conjecture through the lens of Fourier completely bounded polynomials. Delve into the 2008 conjecture stating that low-degree polynomials bounded in infinity norm possess influential variables - a concept with significant implications for quantum computing speedup limitations. Learn about a related but weaker conjecture involving Fourier completely bounded polynomials, which maintains the same quantum computing implications while offering a different analytical approach. Understand how polynomials evaluated on matrix inputs relate to being Fourier completely bounded, and discover why this property implies infinity norm boundedness. Follow the progression from an introduction to the AA conjecture through to the proof of a specific case of the weaker conjecture, drawing from research published in the Chicago Journal of Theoretical Computer Science.
