1. Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)
2. Knill, E.: Quantum randomness and nondeterminism, quant-ph/9610012 (1996)
3. Graduate Studies in Mathematics;A.Y.. Kitaev,2002
4. Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proc. 41st FOCS, 537–546 (2000)
5. Janzing, D., Wocjan, P., Beth, T.: Identity check is QMA-complete, quant-ph/0305050 (2003)