scientific article
From MaRDI portal
Publication:2906789
zbMath1260.81048arXiv1108.4306MaRDI QIDQ2906789
François Le Gall, Harumichi Nishimura, Shota Nakagawa
Publication date: 5 September 2012
Full work available at URL: https://arxiv.org/abs/1108.4306
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (max. 100)
Quantum interactive proofs and the complexity of separability testing ⋮ 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 ⋮ An improved semidefinite programming hierarchy for testing entanglement
This page was built for publication:
