Stoquastic PCP vs. Randomness
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intriguing intersection of stoquastic PCP and randomness in this 22-minute IEEE conference talk presented by Dorit Aharonov and Alex B. Grilo. Delve into the complexities of quantum computational theory as the speakers examine the relationship between stoquastic probabilistically checkable proofs (PCPs) and the role of randomness in quantum systems. Gain insights into cutting-edge research that challenges our understanding of quantum complexity classes and their implications for quantum computing.
Syllabus
Stoquastic PCP vs. Randomness
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Crash Course on Probabilistically Checkable Proofs - PCPSimons Institute via YouTube Crash Course on Probabilistically Checkable Proofs - Introduction
Simons Institute via YouTube Fully Linear PCPs and Their Cryptographic Applications
Simons Institute via YouTube How to Do Fiat-Shamir in the Standard Model
Simons Institute via YouTube How to Delegate Computations Publicly
Simons Institute via YouTube