| 题名: | qip = pspace |
| 作者: | Jain Rahul
; Ji Zhengfeng
; Upadhyay Sarvagya
; Watrous John
|
| 会议文集: | Proceedings of the Annual ACM Symposium on Theory of Computing
|
| 会议名称: | 42nd ACM Symposium on Theory of Computing, STOC 2010
|
| 会议日期: | 43987
|
| 出版日期: | 2010
|
| 会议地点: | Cambridge, MA, United states
|
| 关键词: | Computational linguistics
; Mathematical programming
; Quantum computers
; Quantum theory
|
| 出版地: | United States
|
| 收录类别: | ei
|
| ISSN: | 7378017
|
| ISBN: | 9781610000000
|
| 部门归属: | (1) Department of Computer Science, Centre for Quantum Technologies, National University of Singapore, Singapore; (2) Perimeter Institute for Theoretical Physics, Waterloo, ON, Canada; (3) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (4) Institute for Quantum Computing, School of Computer Science, University of Waterloo, Waterloo, ON, Canada
|
| 主办者: | ACM Special Interest Group on Algorithms and Computation Theory; SIGACT
|
| 英文摘要: | We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the computational power of quantum interactive proofs. As the containment of PSPACE in QIP follows immediately from the well-known equality IP = PSPACE, the equality QIP = PSPACE follows. © 2010 ACM. |
| 语种: | 英语
|
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/8868
|
| Appears in Collections: | 中科院软件所图书馆_2010软件所会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| p573-jain.pdf（360KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Jain Rahul,Ji Zhengfeng,Upadhyay Sarvagya,et al. qip = pspace[C]. 见:42nd ACM Symposium on Theory of Computing, STOC 2010. Cambridge, MA, United states. 43987.
|
|
|
