qip = pspace
文献类型：会议论文
| 作者 | Jain Rahul ; Ji Zhengfeng ; Upadhyay Sarvagya ; Watrous John |
| 出版日期 | 2010 |
| 会议名称 | 42nd ACM Symposium on Theory of Computing, STOC 2010 |
| 会议日期 | 43987 |
| 会议地点 | Cambridge, MA, United states |
| 关键词 | Computational linguistics Mathematical programming Quantum computers Quantum theory |
| 页码 | 573-581 |
| 英文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | ACM Special Interest Group on Algorithms and Computation Theory; SIGACT |
| 会议录 | Proceedings of the Annual ACM Symposium on Theory of Computing
 |
| 会议录出版地 | United States |
| 语种 | 英语 |
| ISSN号 | 7378017 |
| ISBN号 | 9781610000000 |
| 源URL | [http://124.16.136.157/handle/311060/8868]  |
| 专题 | 软件研究所_软件所图书馆_2010软件所会议论文 |
| 推荐引用方式 GB/T 7714 | 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。