2 papers
cs.CC2026
Probabilistically Checking Quantum Proofs, with Interaction
Baocheng Sun, Thomas Vidick
The model of interactive oracle proofs (IOP) generalizes the notion of probabilistically checkable proof (PCP), in which a static proof is verified probabilistically by querying a…
quant-ph2024
The Aldous--Lyons Conjecture II: Undecidability
Lewis Bowen, Michael Chapman, Thomas Vidick
This paper, and its companion [BCLV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. In this part we study tailored non-local games. This is…