Editing Interactive proof system (section)

=== QIP ===
{{main|QIP (complexity)}}
If we allow the elements of the system to use [[quantum computation]], the system is called a '''quantum interactive proof system''', and the corresponding complexity class is called '''QIP'''.<ref>{{cite arXiv|eprint=1012.4427v2|author1=Tsuyoshi Ito|author2=Hirotada Kobayashi|author3=John Watrous|title=Quantum interactive proofs with weak error bounds|class=quant-ph|year=2010}}</ref> A series of results culminated in a 2010 breakthrough that '''QIP''' = '''PSPACE'''.<ref>{{Cite book | last1=Jain | first1=Rahul | last2=Ji | first2=Zhengfeng | last3=Upadhyay | first3=Sarvagya | last4=Watrous | first4=John | author4-link=John Watrous (computer scientist) | title=STOC '10: Proceedings of the 42nd ACM symposium on Theory of computing | publisher=ACM | isbn=978-1-4503-0050-6 | year=2010 | chapter=QIP = PSPACE | pages=573–582}}</ref><ref>{{Cite journal | last1 = Aaronson | first1 = S. | doi = 10.1145/1859204.1859230 | title = QIP = PSPACE breakthrough | journal = Communications of the ACM | volume = 53 | issue = 12 | pages = 101 | year = 2010 | s2cid = 34380788 }}</ref>