@article{8171,
abstract = {{The polynomial hierarchy plays a central role in classical complexity theory. Here, we define
a quantum generalization of the polynomial hierarchy, and initiate its study. We show that
not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using the same techniques, we
also obtain hardness of approximation for the class QCMA. Our approach is based on the
use of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomial hierarchy [Umans, FOCS 1999].
The problems for which we prove hardness of approximation for include, among others, a
quantum version of the Succinct Set Cover problem, and a variant of the local Hamiltonian
problem with hybrid classical-quantum ground states.}},
author = {{Gharibian, Sevag and Kempe, Julia}},
journal = {{Quantum Information & Computation}},
keywords = {{Hardness of approximation, polynomial time hierarchy, succinct set cover, quantum complexity}},
number = {{5-6}},
pages = {{517--540}},
title = {{{Hardness of approximation for quantum problems}}},
volume = {{14}},
year = {{2014}},
}