298 citations · 490 across the 12 of their papers we have counts for
Showing 2007 · quant-phShow all
3 papers · 2 filters
quant-ph2007★ 14 cited
Quantum Simulated Annealing
R. Somma, S. Boixo, H. Barnum
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quan…
quant-ph2007★ 298 cited
A generalized no-broadcasting theorem
Howard Barnum, Jonathan Barrett, Matthew Leifer +1
We prove a generalized version of the no-broadcasting theorem, applicable to essentially \emph{any} nonclassical finite-dimensional probabilistic model satisfying a no-signaling cr…
quant-ph2007★ 1 cited
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Howard N. Barnum
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box f…