The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quan- tum algorithm for solving combinatorial optimization problems. One major challenge with QAOA arises when the optimizer is unable to progress due to barren plateau problems. To address this, we propose a novel optimization technique called the Layered Quantum Approximate Optimization Al- gorithm (LQAOA), which uses warm-starting by fine-tuning parameters from previously optimized layers to initialize subsequent layers, training one layer at a time. Additionally, we incorporate adaptive layer-adding strategies, where layers are added based on a cost-convergence condition. The optimization approach, tested on Erdős–Rényi graphs for the Max-Cut problem with various hyperparameter settings, demonstrates improved performance over standard QAOA.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quan- tum algorithm for solving combinatorial optimization problems. One major challenge with QAOA arises when the optimizer is unable to progress due to barren plateau problems. To address this, we propose a novel optimization technique called the Layered Quantum Approximate Optimization Al- gorithm (LQAOA), which uses warm-starting by fine-tuning parameters from previously optimized layers to initialize subsequent layers, training one layer at a time. Additionally, we incorporate adaptive layer-adding strategies, where layers are added based on a cost-convergence condition. The optimization approach, tested on Erdős–Rényi graphs for the Max-Cut problem with various hyperparameter settings, demonstrates improved performance over standard QAOA.
The capability of the quantum approximate optimization algorithm (QAOA) in solving combinatorial optimization problems has been intensively studied in recent years due to its application in the quantum-classical hybrid regime. Despite having difficulties that are innate in the variational quantum algorithms (VQA), such as barren plateaus and the local minima problem, QAOA remains one of the applications that is suitable for the recent noisy intermediate scale quantum (NISQ) devices. Recent works have shown that the performance of QAOA largely depends on the initial parameters, which motivate parameter initialization strategies to obtain good initial points for the optimization of QAOA. On the other hand, optimization strategies focus on the optimization part of QAOA instead of the parameter initialization. Instead of having absolute advantages, these strategies usually impose trade-offs to the performance of the optimization problems. One such example is the layerwise optimization strategy, in which the QAOA parameters are optimized layer by layer instead of the full optimization. The layerwise strategy costs less in total compared to the full optimization, in exchange of lower approximation ratio. In this work, we propose the iterative layerwise optimization strategy and explore the possibility for the reduction of optimization cost in solving problems with QAOA. Using numerical simulations, we found that by combining the iterative layerwise strategy with proper initialization strategies, the optimization cost can be significantly reduced in exchange for a minor reduction in the approximation ratio. We also show that in some cases, the approximation ratio given by the iterative layerwise strategy is even higher than that given by the full optimization.
In the Noisy Intermediate-Scale Quantum (NISQ) era, the Quantum Approximate Optimization Algorithm (QAOA) has attracted significant attention as an algorithm for solving combinatorial optimization problems that are classically intractable. Various modifications and training strategies have been proposed to enhance the performance of QAOA. However, as the circuit depth increases, existing methods encounter greater training difficulty and reach a barren plateau in performance improvements. In this paper, we propose the Smart Insert Layerwise QAOA (SIL QAOA) to overcome these challenges. In SIL QAOA, at each stage, a new layer is inserted into all possible positions; each circuit is independently optimized, and the parameter set from the circuit yielding the highest expectation value is adopted as the initial parameter for the next stage. Applying the proposed method to the MaxCut problem, we achieved up to approximately 11% higher approximation ratios compared to conventional Layerwise learning QAOA, while successfully mitigating early performance saturation observed at shallow depths. These results demonstrate the superior performance improvement capability of SIL QAOA. Furthermore, we also discuss its potential applicability to more complex optimization problems and deeper variational quantum circuits in future work.
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA Ansatz is not optimal, there is no systematic approach for finding better Ans\"atze. We address this problem by developing an iterative version of QAOA that is problem tailored, and which can also be adapted to specific hardware constraints. We simulate the algorithm on a class of Max-Cut graph problems and show that it converges much faster than the standard QAOA, while simultaneously reducing the required number of CNOT gates and optimization parameters. We provide evidence that this speedup is connected to the concept of shortcuts to adiabaticity.
Graph-based combinatorial optimization problems are computationally challenging for classical optimization techniques due to their NP-hard nature. This paper proposes a novel Quantum-Assisted Hybrid Optimization Algorithm (QAHOA) that integrates the Quantum Approximate Optimization Algorithm (QAOA), spectral graph theory, and classical optimization strategies for graph-based combinatorial optimization. The developed framework uses spectral initialization via the graph Laplacian Fiedler vector to provide structurally informed starting variational parameters, aiming to stabilize the parameter search space and improve convergence trajectories under noisy conditions. The mathematical framework, alongside a convergence analysis to first-order stationary points, is provided to establish theoretical baseline properties. Evaluated on synthetic Erdős–Rényi random graph instances, the current study serves as a preliminary, small-to-medium-scale proof-of-concept. Controlled evaluations demonstrate that the proposed QAHOA achieves marginal yet stable and statistically significant improvements in mean cut values and approximation ratios over classical Greedy heuristics, Simulated Annealing, the standard QAOA, and Warm-Start QAOA. Formal paired hypothesis testing mathematically verifies the stability of the framework, while preliminary 4-qubit hardware executions demonstrate baseline architectural compatibility under physical NISQ noise channels.
Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in the near term. In this work, we focus on the quantum approximate optimisation algorithm (QAOA) for solving the MaxCut problem. Specifically, we address two problems in the QAOA, how to initialise the algorithm, and how to subsequently train the parameters to find an optimal solution. For the former, we propose graph neural networks (GNNs) as a warm-starting technique for QAOA. We demonstrate that merging GNNs with QAOA can outperform both approaches individually. Furthermore, we demonstrate how graph neural networks enables warm-start generalisation across not only graph instances, but also to increasing graph sizes, a feature not straightforwardly available to other warm-starting methods. For training the QAOA, we test several optimisers for the MaxCut problem up to 16 qubits and benchmark against vanilla gradient descent. These include quantum aware/agnostic and machine learning based/neural optimisers. Examples of the latter include reinforcement and meta-learning. With the incorporation of these initialisation and optimisation toolkits, we demonstrate how the optimisation problems can be solved using QAOA in an end-to-end differentiable pipeline.
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems that are classically intractable. Careful parameter initialization in QAOA can reduce the number of quantum circuit evaluations required, making it more feasible to run on noisy intermediate-scale quantum (NISQ) devices. In this work, We focus on MaX-Cut, a classic NP-hard optimization problem, and propose a conditional variational autoencoder (CVAE) scheme for generating initial QAOA parameters for the Max-Cut problems based on input graph structures. The CVAE, trained on optimal parameters from 270 ten-node graphs, produces multiple parameter candidates conditioned on 27-dimensional feature vectors that incorporate spectral properties as well as learned embeddings. We evaluate and compare two strategies: direct initialization using the highestconfidence prediction, and dynamic injection which monitors optimization progress and intervenes when needed. On 89 test graphs, the dynamic injection strategy increased successful convergence cases from 41 to 49, reduced mean iteration count by 4.94.