145 search results - page 3 / 29 » BQP and the Polynomial Hierarchy |
CORR
2011
Springer
13 years 23 days ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
CSR
2007
Springer
13 years 12 months ago
2007
Springer
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...