Quantum proof systems for iterated exponential time, and beyond

DOI10.1145/3313276.3316343zbMath1436.81027arXiv1805.12166OpenAlexW2963105196MaRDI QIDQ5212788

Thomas Vidick, Zhengfeng Ji, Joseph Fitzsimons, Henry C. Yuen

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum entanglementquantum correlationsself-testingquantum multiprover interactive proofs

Mathematics Subject Classification ID

Quantum computation (81P68) Mechanization of proofs and logical operations (03B35) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Unnamed Item

This page was built for publication: Quantum proof systems for iterated exponential time, and beyond