scientific article
From MaRDI portal
Publication:3002783
DOI10.4086/toc.2007.v003a007zbMath1213.68290OpenAlexW2610967815MaRDI QIDQ3002783
Greg Kuperberg, Scott Aaronson
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (10)
Total functions in QMA ⋮ The learnability of quantum states ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Shadow Tomography of Quantum States ⋮ Quantum vs Classical Proofs and Subset Verification ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Quantum Commitments from Complexity Assumptions ⋮ The complexity of quantum disjointness ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Quantum commitments from complexity assumptions
This page was built for publication: