On Benchmarking Quantum Heuristics
Zhihui Wang · NASA Technical Reports Server (NASA) · 2019
Present an outline of important aspects for benchmarking quantum algorithms, in particular quantum heuristics. Using quantum approximate optimization algorithm as an example, we demonstrate how the choice of cost Hamiltonian, of mixer, and of initial states can affect the performance. We also discuss how realistic aspects of near-term quantum hardware will influence the algorithm performance.