21 citations · 38 across the 11 of their papers we have counts for
14 papers
Quantum Fan-out: Circuit Optimizations and Technology Modeling
Pranav Gokhale, Samantha Koretsky, Shilin Huang +4
Instruction scheduling is a key compiler optimization in quantum computing, just as it is for classical computing. Current schedulers optimize for data parallelism by allowing simu…
The Power of Many Samples in Query Complexity
Andrew Bassilakis, Andrew Drucker, Mika Göös +3
The randomized query complexity of a boolean function is famously characterized (via Yao's minimax) by the least number of queries needed to dis…
A Note on a Communication Game
Andrew Drucker
We describe a communication game, and a conjecture about this game, whose proof would imply the well-known Sensitivity Conjecture asserting a polynomial relation between sensitivit…
Advice Coins for Classical and Quantum Computation
Scott Aaronson, Andrew Drucker
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particul…
High-Confidence Predictions under Adversarial Uncertainty
Andrew Drucker
We study the setting in which the bits of an unknown infinite binary sequence x are revealed sequentially to an observer. We show that very limited assumptions about x allow one to…
Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
Jing Chen, Andrew Drucker
BellQMA protocols are a subclass of multi-prover quantum Merlin-Arthur protocols in which the verifier is restricted to perform nonadaptive,unentangled measurements on the quantum…