We consider multiprover interactive proof systems. We show that the polynomial hierarchy is provable by two provers in one round.
