Oracle Separation of QMA and QCMA with Bounded Adaptivity

Watch a technical conference talk exploring the oracle separation between QMA and QCMA for quantum algorithms with bounded adaptivity in their oracle queries. Delve into a simplified version of the Li, Liu, Pelecanos, and Yamakawa construction, focusing on cases where quantum algorithms have limited rounds of oracle calls while allowing polynomial parallel queries per round. Learn about the newly introduced concept of "slipperiness" in relations and its potential applications in establishing a comprehensive classical oracle separation between QMA and QCMA. Presented at the 19th Theory of Quantum Computation, Communication and Cryptography Conference (TQC 2024), this 28-minute presentation advances theoretical quantum information science through rigorous mathematical analysis and innovative problem-solving approaches.