A quasipolynomial-time algorithm for the quantum separability problem

DOI10.1145/1993636.1993683zbMath1288.68068arXiv1011.2751OpenAlexW3098084575WikidataQ59711936 ScholiaQ59711936MaRDI QIDQ5419104

Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard

Publication date: 5 June 2014

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

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

zbMATH Keywords

quantum computationinteractive proofsconditional mutual informationsquashed entanglementseparability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Quantum de Finetti theorems under local measurements with applications ⋮ Computing quantum discord is NP-complete ⋮ The sum-of-squares hierarchy on the sphere and applications in quantum information theory ⋮ Epsilon-net method for optimizations over separable states ⋮ Dvoretzky's theorem and the complexity of entanglement detection ⋮ Faithful squashed entanglement ⋮ De Finetti theorems for braided parafermions ⋮ Exponential decay of correlations implies area law ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ Large-d phase transitions in holographic mutual information

This page was built for publication: A quasipolynomial-time algorithm for the quantum separability problem