A layerwise-multi-angle approach to fine-tuning the quantum approximate optimization algorithm

This paper introduces a novel variational quantum algorithm built upon the established Quantum Approximate Optimization Algorithm also known as QAOA. Since the known parameter fixing strategy imposes constraints on QAOA to enhance tractability at the cost of some expressive power, the proposed layerwise approach integrates it with the existing Multi-Angle QAOA technique, which is characterized in turn by height-ened expressiveness through an increased number of parameters, albeit with increased optimization challenges. Consequently, the proposed layerwise-Multi-Angle QAOA combines the strengths of one variant with the limitations of the other, striking a balance in algorithmic design. The effectiveness of the proposed algorithm is assessed through experimental evaluations on the Maximum Cut problem. This study reveals promising results in heuristic predictions, with robustness both in terms of approximation ratio and optimization capabilities.