papers
Publications (5)
cs.CC2016
On the complexity of probabilistic trials for hidden satisfiability problems
Itai Arad, Adam Bouland, Daniel Grier +3
quant-ph2015
The Classification of Reversible Bit Operations
Scott Aaronson, Daniel Grier, Luke Schaeffer
quant-ph2018
New Hardness Results for the Permanent Using Linear Optics
Daniel Grier, Luke Schaeffer
cs.CC2013
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete
Daniel Grier
quant-ph2019
A Quantum Query Complexity Trichotomy for Regular Languages
Scott Aaronson, Daniel Grier, Luke Schaeffer