Sciweavers

1352 search results - page 217 / 271
» Fault-Tolerant Quantum Computation
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 5 months ago
QIP = PSPACE
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 p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
FCT
2001
Springer
14 years 22 days ago
Quantum Algorithms
Umesh V. Vazirani