Parameters Fixing Strategy for Quantum Approximate Optimization Algorithm
arXiv:2108.05288 · doi:10.1109/QCE52317.2021.00016
Abstract
The quantum approximate optimization algorithm (QAOA) has numerous promising applications in solving the combinatorial optimization problems on near-term Noisy Intermediate Scalable Quantum (NISQ) devices. QAOA has a quantum-classical hybrid structure. Its quantum part consists of a parameterized alternating operator ansatz, and its classical part comprises an optimization algorithm, which optimizes the parameters to maximize the expectation value of the problem Hamiltonian. This expectation value depends highly on the parameters, this implies that a set of good parameters leads to an accurate solution. However, at large circuit depth of QAOA, it is difficult to achieve global optimization due to the multiple occurrences of local minima or maxima. In this paper, we propose a parameters fixing strategy which gives high approximation ratio on average, even at large circuit depths, by initializing QAOA with the optimal parameters obtained from the previous depths. We test our strategy on the Max-cut problem of certain classes of graphs such as the 3-regular graphs and the Erdös-Rényi graphs.
arXiv comment7 pages, 5 figures, accepted in the IEEE International Conference on Quantum Computing and Engineering
References in corpus (16)
- A Quantum Approximate Optimization Algorithm
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Benchmarking the Quantum Approximate Optimization Algorithm
- Parameter Concentration in Quantum Approximate Optimization
- MAXCUT QAOA performance guarantees for p >1
- Multistart Methods for Quantum Approximate Optimization
- Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
- Quantum approximate optimization is computationally universal
- The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
- For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
- To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
- Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth
- Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols