In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement.
Zhengfeng Ji
Advertisement
Author Archives
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).
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved