scientific article
From MaRDI portal
Publication:3400478
zbMath1187.81058arXiv0810.5109MaRDI QIDQ3400478
Publication date: 5 February 2010
Full work available at URL: https://arxiv.org/abs/0810.5109
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (7)
Unnamed Item ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Epsilon-net method for optimizations over separable states ⋮ Shorter unentangled proofs for ground state connectivity ⋮ Faithful squashed entanglement ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) ⋮ Approximating the set of separable states using the positive partial transpose test
This page was built for publication:
