75 citations · 188 across the 17 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
quant-ph2016
New Hardness Results for the Permanent Using Linear Optics
Daniel Grier, Luke Schaeffer
In 2011, Aaronson gave a striking proof, based on quantum linear optics, showing that the problem of computing the permanent of a matrix is #P-hard. Aaronson's proof led naturally…
quant-ph2016★ 15 cited
The Classification of Clifford Gates over Qubits
Daniel Grier, Luke Schaeffer
We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the stan…