Classical Verification of Quantum Proofs
STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016(2015)
摘要
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It follows from this protocol that approximating the non-local value of a multi-player one-round game to inverse polynomial precision is QMA-hard. Our work makes an interesting connection between the theory of QMA-completeness and Hamiltonian complexity on one hand and the study of non-local games and Bell inequalities on the other.
更多查看译文
关键词
Quantum Interactive Proofs,Local Hamiltonian Problem,Non-Local Games,Entanglement,Bell Inequalities
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络