Compiled Quantum Optimization Algorithms in NISQ Processors

We discuss resource estimation and synthesis optimization results related to compilation of a variety of structured variational algorithms. Specifically, we look at software tools and methods for finding a swap network that allows the efficient execution of algorithms on different superconducting chips (Rigetti’s Aspen Chip, Google’s Sycamore, IBM’s Tokyo). Efficiency is measured in terms of the total temporal makespan of execution of the compiled quantum circuit. Examples include algorithms for scheduling and asset allocation with both soft and hard constraints. We address two different regimes: where near-optimal compilations can be found, and where only heuristics (e.g., temporal planning methods) are available.