Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions

Abstract

Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently warm-start approaches have been proposed to improve the performance of QAOA, where approximate solutions are obtained by classical algorithms in advance and incorporated into the initial state and/or unitary ansatz. In this work, we study in detail how the accuracy of approximate solutions affect the performance of the warm-start QAOA (WS-QAOA). We numerically find that in typical MAX-CUT problems, WS-QAOA tends to outperform QAOA as approximate solutions become closer to the exact solutions in terms of the Hamming distance. We reveal that this could be quantitatively attributed to the initial state of the ansatz. We also solve MAX-CUT problems by WS-QAOA with approximate solutions obtained via QAOA, having a better result than QAOA especially when the circuit is relatively shallow. We believe that our study may deepen understanding of the performance of WS-QAOA and also provide a guide as to the necessary quality of approximate solutions.

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Superconducting Qubits: Current State of Play
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Annealing and Analog Quantum Computation
• Perspectives of quantum annealing: Methods and implementations
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• Warm-starting quantum optimization
• $XY$-mixers: analytical and numerical results for QAOA
• Filtering variational quantum algorithms for combinatorial optimization
• Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Quantum annealing with longitudinal bias fields

Cited by in corpus (1)

• Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation