Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NIKHIL VYAS:
All reports by Author Nikhil Vyas:

TR26-150 | 19th August 2026
Mitali Bafna, Nikhil Vyas

Private PCPs from Product Expansion

The quantum analogue of the PCP theorem for QMA remains wide open. A central obstacle is the local indistinguishability of quantum codes: every sufficiently small view of an encoded witness is independent of the witness, seemingly preventing a local verifier from distinguishing YES from NO instances. One approach to this ... more >>>




ISSN 1433-8092 | Imprint