Classical verification of quantum proofs

DOI10.1145/2897518.2897634zbMath1373.68228arXiv1505.07432OpenAlexW1484565144MaRDI QIDQ5361888

Zhengfeng Ji

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.07432

zbMATH Keywords

Bell inequalitiesentanglementlocal Hamiltonian problemquantum interactive proofsnon-local games

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches

This page was built for publication: Classical verification of quantum proofs