A Relativizing MIP for BQP
This work shows that every problem in BQP can be proven using an interactive proof system (MIP) that works even when given any classical oracle O. The authors construct a specific PCP for a BQPO-complete problem, using an exponentially long classical proof based on quantum state synthesis. This proves the containment BQP ⊆ MIP holds universally, advancing the quest to understand if BQP equals IPBQP.