scientific article; zbMATH DE number 6292739
From MaRDI portal
Publication:5414620
DOI10.4086/cjtcs.2013.001zbMath1286.68150arXiv1108.2098OpenAlexW1663554127MaRDI QIDQ5414620
Alessandro Chiesa, Michael A. Forbes
Publication date: 7 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2098
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
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: