1.5k citations · 17.9k across the 190 of their papers we have counts for
Showing 2009 · quant-phShow all
2 papers · 2 filters
quant-ph2009★ 37 cited
On product, generic and random generic quantum satisfiability
C. R. Laumann, A. M. Läuchli, R. Moessner +2
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum…
quant-ph2009★ 12 cited
Phase transitions and random quantum satisfiability
C. R. Laumann, R. Moessner, A. Scardicchio +1
Alongside the effort underway to build quantum computers, it is important to better understand which classes of problems they will find easy and which others even they will find in…