scientific article

zbMath1268.81044MaRDI QIDQ3166192

Scott Aaronson

Publication date: 21 October 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

query complexitypolynomial methodcollision problemQMA

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (12)

Approximate Degree in Classical and Quantum Computing ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ On the Power of Statistical Zero Knowledge ⋮ Unnamed Item ⋮ Zero-Knowledge Proofs of Proximity ⋮ An Exponential Separation Between MA and AM Proofs of Proximity ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Unnamed Item ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ Unnamed Item ⋮ Quantum commitments from complexity assumptions

This page was built for publication: