



@article {2261,
	title = {Quantum generalizations of the polynomial hierarchy with applications to QMA(2)},
	journal = {Proceedings of 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
	year = {2018},
	abstract = {<p>The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda\&$\#$39;s theorem. For the latter, we place its third level, QΣ3, into NEXP {using the Ellipsoid Method for efficiently solving semidefinite programs}. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs \&quot;equivalent\&quot;), then QMA(2) is in the Counting Hierarchy (specifically, in PPPPP). Second, unless QMA(2)=QΣ3 (i.e., alternating quantifiers do not help in the presence of \&quot;unentanglement\&quot;), QMA(2) is strictly contained in NEXP.</p>},
	doi = {https://doi.org/10.4230/LIPIcs.MFCS.2018.58},
	url = {https://arxiv.org/abs/1805.11139},
	author = {Sevag Gharibian and Miklos Santha and Jamie Sikora and Aarthi Sundaram and Justin Yirka}
}
@article {1785,
	title = {Tensor network non-zero testing},
	journal = {Quantum Information \& Computation},
	volume = {15},
	year = {2015},
	month = {2015/07/01},
	pages = {885-899},
	abstract = {Tensor networks are a central tool in condensed matter physics. In this paper, we initiate the study of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector? We show that TNZ is not in the Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among other results) that the special cases of TNZ on non-negative and injective tensor networks are in NP. Using this, we make a simple observation: The commuting variant of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for logarithmic k and constant D. This reveals the first class of quantum Hamiltonians whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant D, and (3) for arbitrary interaction graphs.},
	url = {http://arxiv.org/abs/1406.5279},
	author = {Sevag Gharibian and Zeph Landau and Seung Woo Shin and Guoming Wang}
}
