



@article {2321,
	title = {Bang-bang control as a design principle for classical and quantum optimization algorithms},
	journal = {Quantum Information \& Computation },
	volume = {19},
	year = {2019},
	month = {8/1/2019},
	pages = {424-446},
	abstract = {<p><span style="color: rgb(51, 51, 51); font-family: \&quot;Open Sans\&quot;, \&quot;Lucida Grande\&quot;, \&quot;Helvetica Neue\&quot;, Helvetica, Arial, sans-serif; font-size: 14px;">Physically motivated classical heuristic optimization algorithms such as simulated annealing (SA) treat the objective function as an energy landscape, and allow walkers to escape local minima. It has been argued that quantum properties such as tunneling may give quantum algorithms advantage in finding ground states of vast, rugged cost landscapes. Indeed, the Quantum Adiabatic Algorithm (QAO) and the recent Quantum Approximate Optimization Algorithm (QAOA) have shown promising results on various problem instances that are considered classically hard. Here, we argue that the type of control strategy used by the optimization algorithm may be crucial to its success. Along with SA, QAO and QAOA, we define a new, bang-bang version of simulated annealing, BBSA, and study the performance of these algorithms on two well-studied problem instances from the literature. Both classically and quantumly, the successful control strategy is found to be bang-bang, exponentially outperforming the quasistatic analogues on the same instances. Lastly, we construct O(1)-depth QAOA protocols for a class of symmetric cost functions, and provide an accompanying physical picture.</span></p>},
	url = {https://arxiv.org/abs/1812.02746},
	author = {Aniruddha Bapat and Stephen Jordan}
}
