45 citations · 203 across the 20 of their papers we have counts for
5 papers · 1 filter
Readiness of Quantum Optimization Machines for Industrial Applications
Alejandro Perdomo-Ortiz, Alexander Feldman, Asier Ozaeta +9
There have been multiple attempts to demonstrate that quantum annealing and, in particular, quantum annealing on quantum annealing machines, has the potential to outperform current…
Nonlocal games, synchronous correlations, and Bell inequalities
Nishant Rodrigues, Brad Lackey
Nonlocal games with synchronous correlations are a natural generalization of functions between two finite sets. In this work we examine analogues of Bell's inequalities for such co…
Fast optimization algorithms and the cosmological constant
Ning Bao, Raphael Bousso, Stephen Jordan +1
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The num…
Substochastic Monte Carlo Algorithms
Michael Jarret, Brad Lackey
In this paper we introduce and formalize Substochastic Monte Carlo (SSMC) algorithms. These algorithms, originally intended to be a better classical foil to quantum annealing than…
Penalty models for bitstrings of constant Hamming weight
Brad Lackey
To program a quantum annealer, one must construct objective functions whose minima encode hard constraints imposed by the underlying problem. For such "penalty models," one desires…