QIP = PSPACE

DOI10.1145/1806689.1806768zbMath1293.68133OpenAlexW2912359042MaRDI QIDQ2875184

John Watrous, Rahul Jain, Sarvagya Upadhyay, Zhengfeng Ji

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806768

zbMATH Keywords

semidefinite programmingquantum computationmatrix multiplicative weights update methodquantum interactive proof systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Online variance minimization ⋮ Quantum commitments from complexity assumptions

This page was built for publication: QIP = PSPACE