Articles under category:
Polynomial-Time Hierarchy
 Vol 18, Article 17 (pp 1-11) [NOTE] A Stochastic Calculus Approach to the Oracle Separation of $\mathsf{BQP}$ and $\mathsf{PH}$ by Xinyu Wu
 Vol 9, Article 26 (pp 809-843) On Beating the Hybrid Argument
 Vol 9, Article 4 (pp 143-252) The Computational Complexity of Linear Optics by Scott Aaronson and Alex Arkhipov
 Vol 9, Article 1 (pp 1-29) The Power of Nondeterminism in Self-Assembly
 Vol 3, Article 3 (pp 45-60) On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy by Ishay Haviv, Oded Regev, and Amnon Ta-Shma