A quantum linearity test for robustly verifying entanglement

DOI10.1145/3055399.3055468zbMath1370.81045arXiv1610.03574OpenAlexW3106278932WikidataQ59792476 ScholiaQ59792476MaRDI QIDQ4978041

Anand Natarajan, Thomas Vidick

Publication date: 17 August 2017

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

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

zbMATH Keywords

nonlocal gamesquantum interactive proofsself-testingquantum PCP conjecture

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (11)

Stability of approximate group actions: uniform and probabilistic ⋮ Arkhipov's theorem, graph minors, and linear system nonlocal games ⋮ \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Unnamed Item ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Unnamed Item ⋮ Entanglement in non-local games and the hyperlinear profile of groups ⋮ Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Unnamed Item ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

This page was built for publication: A quantum linearity test for robustly verifying entanglement