54 citations · 56 across the 2 of their papers we have counts for
2 papers
quant-ph2014★ 54 cited
Quantum annealing: the fastest route to quantum computation?
C. R. Laumann, R. Moessner, A. Scardicchio +1
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small…
cond-mat.stat-mech2010★ 2 cited
Statistical mechanics of classical and quantum computational complexity
C. R. Laumann, R. Moessner, A. Scardicchio +1
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the cr…