4 citations · 4 across the 2 of their papers we have counts for
2 papers
quant-ph2017★ 4 cited
On efficiently solvable cases of Quantum k-SAT
Marco Aldi, Niel de Beaudrap, Sevag Gharibian +1
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k>=3), respectively, where QMA_1 is a quantum gener…
quant-ph2008
Theory of measurement-based quantum computing
Jonathan Robert Niel de Beaudrap
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as…