1.5k citations · 3.7k across the 74 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
quant-ph2006★ 16 cited
The Learnability of Quantum States
Scott Aaronson
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we…
quant-ph2006★ 4 cited
Quantum Versus Classical Proofs and Advice
Scott Aaronson, Greg Kuperberg
This paper studies whether quantum proofs are more powerful than classical proofs, or in complexity terms, whether QMA=QCMA. We prove three results about this question. First, we g…