Thumbnail
Access Restriction
Subscribed

Author Jain, Rahul ♦ Ji, Zhengfeng ♦ Watrous, John ♦ Upadhyay, Sarvagya
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The interactive proof system model of computation has been studied extensively in computational complexity theory and theoretical cryptography for more than 25 years, and has driven the development of interesting new techniques and insights in those fields. This work considers the quantum interactive proof system model, which is the classical model's natural quantum computational analog. An exact characterization of the expressive power of quantum interactive proof systems is obtained: the collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable with an ordinary classical computer using at most a polynomial amount of memory (or QIP = PSPACE in complexity-theoretic terminology). One striking implication of this characterization is that it implies quantum computing provides no increase in computational power whatsoever over classical computing in the context of interactive proof systems.
Description Affiliation: Waterloo, Ontario, Canada (Ji, Zhengfeng) || National University of Singapore, Republic of Singapore (Jain, Rahul) || University of Waterloo Waterloo, Ontario, Canada (Upadhyay, Sarvagya; Watrous, John)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 53
Issue Number 12
Page Count 8
Starting Page 102
Ending Page 109


Open content in new tab

   Open content in new tab
Source: ACM Digital Library