3 citations · 3 across the 1 of their papers we have counts for
3 papers
quant-ph2019
Classical and Quantum Bounded Depth Approximation Algorithms
M. B. Hastings
We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of "local" classical optimization algorithms and show that a…
quant-ph2019
Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad
M. B. Hastings
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solut…
quant-ph2019★ 3 cited
The Short Path Algorithm Applied to a Toy Model
M. B. Hastings
We numerically investigate the performance of the short path optimization algorithm on a toy problem, with the potential chosen to depend only on the total Hamming weight to allow…