Some results in quantum computing

Just some points to (rather) recent results in complexity theory with regard to quantum computing:

• Quantum Interative Proofs equals Polynomial Space class: QIP = PSPACE
  
• On the relation of the BQP class to the PH class; furthermore a separating decision problem would follow from the Generalized Linial-Nisan Conjecture: BQP vs PH