QIP = PSPACE
From MaRDI portal
Publication:5395673
DOI10.1145/2049697.2049704zbMath1281.68117arXiv0907.4737OpenAlexW2295995314MaRDI QIDQ5395673
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.4737
semidefinite programmingquantum computationinteractive proof systemsmatrix multiplicative weights update method
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Parallel approximation of min-max problems ⋮ Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method ⋮ Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Unnamed Item ⋮ Generalized Quantum Arthur--Merlin Games ⋮ Constant-space quantum interactive proofs against multiple provers ⋮ Unnamed Item ⋮ QPCF: higher-order languages and quantum circuits
