摘要：We present a classical interactive protocol that checks the validity of a quantum
witness state for the local Hamiltonian problem. It follows from this protocol that approximating
the nonlocal value of a multi-player one-round game to inverse polynomial precision
is QMA-hard. Our result makes a connection between the theory of QMA-completeness and
Hamiltonian complexity on one hand and the study of nonlocal games and Bell inequalities
on the other.
关键词：quantum interactive proofs; local Hamiltonian problem; nonlocal games;;
entanglement; Bell inequalities
