scientific article
From MaRDI portal
Publication:3002799
DOI10.4086/toc.2009.v005a001zbMath1213.68280arXiv0804.0802OpenAlexW2610452584MaRDI QIDQ3002799
Andrew Drucker, Salman Beigi, Bill Fefferman, Scott Aaronson, Peter W. Shor
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.0802
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (11)
Quantum de Finetti theorems under local measurements with applications ⋮ Entanglement of the antisymmetric state ⋮ Unnamed Item ⋮ A quantum characterization of NP ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Epsilon-net method for optimizations over separable states ⋮ Shorter unentangled proofs for ground state connectivity ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Faithful squashed entanglement ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
This page was built for publication:
