On Benchmarking Quantum Heuristics

Wang, Zhihui

关键词: ALGORITHMS;    COMPUTER PROGRAMMING;    HAMILTONIAN FUNCTIONS;    HEURISTIC METHODS;    QUANTUM COMPUTERS;    QUANTUM THEORY;    SORTING ALGORITHMS;    SYSTEMS ANALYSIS;   

RP-ID  :  ARC-E-DAA-TN68340

学科分类：物理（综合）

美国|英语

来源: NASA Technical Reports Server

【 摘 要 】

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.