Speaker: Ojas Parekh (Sandia National Laboratory) Abstract Although discrete optimization has inspired much quantum algorithmic work, exponential advantages for conventional discrete optimization have remained largely elusive. Why? I’ll offer my perspective on this question using the Max Cut problem as a running example. I’ll talk about approximating Quantum Max Cut, which has very recently has […]