Hardness of Approximation for Quantum Problems
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. Our work thus yields the first known hardness of approximation results for a quantum complexity class. Using these 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 1999). We close by showing that a variant of the local Hamiltonian problem with hybrid classical-quantum ground states is complete for the second level of our quantum hierarchy.
KeywordsQuantum Circuit Quantum Problem Quantum Setting Polynomial Hierarchy Quantum Generalization
Unable to display preview. Download preview PDF.
- [AALV09]Aharonov, D., Arad, I., Landau, Z., Vazirani, U.: The detectibility lemma and quantum gap amplification. In: 41st ACM Syposium on Theory of Computing, vol. 287, pp. 417–426 (2009)Google Scholar
- [Aar06]Aaronson, S.: The quantum PCP manifesto (2006), http://scottaaronson.com/blog/?p=139
- [AN02]Aharonov, D., Naveh, T.: Quantum NP - A survey. Preprint at arXiv:quant-ph/0210077v1 (2002)Google Scholar
- [Ara10]Arad, I.: A note about a partial no-go theorem for quantum PCP. Preprint at arXiv:quant-ph/1012.3319 (2010)Google Scholar
- [Has12]Hastings, M.B.: Trivial low energy states for commuting hamiltonians, and the quantum PCP conjecture. Preprint at arXiv:quant-ph/1201.3387 (2012)Google Scholar
- [Hem02]Hemaspaandra, L.: SIGACT news complexity theory column 38. ACM SIGACT News 33(4) (2002); Guest column by Schaefer, M., Umans, C.Google Scholar
- [KSV02]Kitaev, A., Shen, A., Vyalyi, M.: Classical and Quantum Computation. American Mathematical Society (2002)Google Scholar
- [Sip83]Sipser, M.: A complexity theoretic approach to randomness. In: 15th Symposium on Theory of Computing, pp. 330–335. ACM Press (1983)Google Scholar
- [SZ94]Srinivasan, A., Zuckerman, D.: Computing with very weak random sources. In: 35th Symposium on Foundations of Computer Science, pp. 264–275 (1994)Google Scholar
- [Uma99]Umans, C.: Hardness of approximating \(\Sigma_2^p\) minimization problems. In: 40th Symposium on Foundations of Computer Science, pp. 465–474 (1999)Google Scholar
- [Wat09]Watrous, J.: Quantum computational complexity. In: Meyers, R. (ed.) Encyclopedia of Complexity and Systems Science, ch. 17, pp. 7174–7201. Springer (2009)Google Scholar
- [Yam02]Yamakami, T.: Quantum NP and a quantum hierarchy. In: 2nd IFIP International Conference on Theoretical Computer Science, pp. 323–336. Kluwer Academic Publishers (2002)Google Scholar