463 citations · 2.5k across the 46 of their papers we have counts for
Showing 2013 · quant-phShow all
3 papers · 2 filters
quant-ph2013★ 18 cited
The Bose-Hubbard model is QMA-complete
Andrew M. Childs, David Gosset, Zak Webb
The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between adjacent vertices and experience a repulsive on-site i…
quant-ph2013★ 12 cited
An algorithm for the T-count
David Gosset, Vadym Kliuchnikov, Michele Mosca +1
We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically…
quant-ph2013★ 12 cited
Quantum 3-SAT is QMA1-complete
David Gosset, Daniel Nagaj
Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-loc…