Please use this identifier to cite or link to this item:
|Title:||QIP = PSPACE||Authors:||Jain, R.
|Issue Date:||2010||Citation:||Jain, R., Ji, Z., Upadhyay, S., Watrous, J. (2010). QIP = PSPACE. Communications of the ACM 53 (12) : 102-109. ScholarBank@NUS Repository. https://doi.org/10.1145/1859204.1859231||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. © 2010 ACM.||Source Title:||Communications of the ACM||URI:||http://scholarbank.nus.edu.sg/handle/10635/39317||ISSN:||00010782||DOI:||10.1145/1859204.1859231|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.