PP was proved greater than QMA in by Kitaev and Watrous 2000 -Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems.Later Aaronson proved that PostBQP was equal to PP in his PHD 2004.It has been stated that the knowledge that PostBQP = PP makes proving PP is greater than or equal to QMA a lot easier. Is there a short explanation of this. Or if not could someone provide a reference detailing this fact?
Why does the Complexity Class PostBQP makes proving PP greater than or equal to QMA easier?
cc.complexity theory;complexity classes;quantum computing