We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
QIP=PSPACE=IP.
- Authors
Jain, Rahul
- Abstract
A reprint of the article "QIP = PSPACE = IP" by Rahul Jain which appeared in the "Centre for Quantum Technologies Annual Report 2009" is presented. It explains interactive proofs in the field of study called Complexity Theory which tries to study inherent hardness of problems in terms of time and space needed to solve them using a computer called the Turing Machine. It details the class of problems that can be solved efficiently in time and those that can be solved efficiently in space.
- Subjects
QUANTUM optical phenomena; QUANTUM information science; JAIN, Rahul; COMPLEXITY (Philosophy); MACHINE theory; TURING machines; QUANTUM theory; HYPERSPACE
- Publication
Innovation, 2010, Vol 9, Issue 2, p12
- ISSN
0219-4023
- Publication type
Article