scientific article; zbMATH DE number 6096707

zbMATH Open1268.81044MaRDI QIDQ3166192FDOQ3166192

Scott Aaronson

Publication date: 21 October 2012

Title of this publication is not available (Why is that?)

zbMATH Keywords

query complexitypolynomial methodcollision problemQMA

Mathematics Subject Classification ID

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

Cited In (13)

• An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
• Quantum commitments from complexity assumptions
• An Exponential Separation Between MA and AM Proofs of Proximity
• A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$
• Title not available (Why is that?)
• Title not available (Why is that?)
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• The NISQ complexity of collision finding
• On the Power of Statistical Zero Knowledge
• Zero-Knowledge Proofs of Proximity
• Approximate Degree in Classical and Quantum Computing
• Title not available (Why is that?)
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166192)