A
Andrew Drucker
Researcher at University of Chicago
Publications - 57
Citations - 1035
Andrew Drucker is an academic researcher from University of Chicago. The author has contributed to research in topics: Boolean function & Quantum algorithm. The author has an hindex of 12, co-authored 55 publications receiving 918 citations. Previous affiliations of Andrew Drucker include Massachusetts Institute of Technology & Princeton University.
Papers
More filters
Proceedings ArticleDOI
On the power of the congested clique model
TL;DR: It is shown that the unicast congested clique can simulate powerful classes of bounded-depth circuits, implying that even slightly super-constant lower bounds for the congestedClique would give new lower bounds in circuit complexity.
Journal ArticleDOI
New Limits to Classical and Quantum Instance Compression
TL;DR: Given an instance of a hard decision problem, a limited goal is to compress that instance into a smaller, equivalent instances of a second problem.
Journal Article
New Limits to Classical and Quantum Instance Compression.
TL;DR: It is shown that strong AND- or OR-compression for SAT would imply non-uniform, statistical zero-knowledge proofs for SAT-an even stronger and more unlikely consequence than NP ⊆ coNP/poly.
Proceedings ArticleDOI
New Limits to Classical and Quantum Instance Compression
TL;DR: In this article, Fort and Santhanam showed that strong AND- \emph{or} OR-compression for SAT would imply non-uniform, statistical zero-knowledge proofs.
Journal ArticleDOI
The Power of Unentanglement
TL;DR: The class QMA(k), introduced by Kobayashi et al. as mentioned in this paper, consists of all languages that can be verified using k unentangled quantum proofs and can be amplified to exponentially small error.