Quantum entanglement, sum of squares, and the log rank conjecture

DOI10.1145/3055399.3055488zbMath1369.68230arXiv1701.06321OpenAlexW2581091247MaRDI QIDQ4978039

Pravesh K. Kothari, David Steurer, Boaz Barak

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/1701.06321

zbMATH Keywords

sum-of-squares semidefinite programming hierarchybest separable state problempolynomial reweighting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Quantum measurement theory, state operations, state preparations (81P15)

Related Items (6)

Log-Sobolev inequality for the multislice, with applications ⋮ Unnamed Item ⋮ The sum-of-squares hierarchy on the sphere and applications in quantum information theory ⋮ Unnamed Item ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares ⋮ The weirdness theorem and the origin of quantum paradoxes

This page was built for publication: Quantum entanglement, sum of squares, and the log rank conjecture