Quantum Approximate Optimization Algorithms in Combinatorial Problems

The Quantum Approximate Optimization Algorithm (QAOA) represents a leading framework for addressing combinatorial optimisation problems on near-term quantum devices. By alternating between a cost Hamiltonian that encodes the objective function of discrete optimisation tasks and a mixer Hamiltonian that drives transitions across candidate solutions, QAOA employs a small number of variational parameters to guide a hybrid quantum–classical search. In practice, a sequence of p layers, each comprising one phase evolution under the cost operator and one under the mixer, yields a quantum state whose measurement outcomes concentrate near high-quality solutions. Such combinatorial tasks include MaxCut, Boolean satisfiability and portfolio selection, where classical methods often struggle with exponential scaling. QAOA’s promise lies in its potential to exploit quantum superposition and entanglement within the constraints of noisy intermediate-scale quantum (NISQ) hardware. Progress in parameter-optimisation strategies, ansatz design and resource-efficient compilation continues to refine its performance, while theoretical analyses clarify its limitations and scaling behaviour. Emerging studies also explore generalisations that adapt both cost and mixer operators to respect hard constraints, widening the scope of problems accessible to this quantum heuristic.

Research from Nature Portfolio

Simulations of QAOA applied to MaxCut problems on regular graphs have established realistic lower bounds on the quantum resources required for practical advantage. Detailed noise modelling and gate-level characterisations indicate that to surpass leading classical approximation algorithms for MaxCut, devices must scale to several hundred qubits with controlled coherence and connectivity. These findings underscore the gap between current NISQ machines and the threshold for quantum speed-up in representative combinatorial tasks, guiding experimental roadmaps for hardware development and error-mitigation strategies tailored to QAOA circuits.

Research from all publishers

Recent theoretical work has extended QAOA to hard constraint satisfaction problems, providing an analytical expression for the average success probability on random k-SAT at the satisfiability threshold. Numerical benchmarks demonstrate that beyond a moderate number of layers, QAOA can exhibit more favourable scaling than classical solvers on typical instances of random 8-SAT. Another line of enquiry introduces an adaptive, problem-tailored variant of QAOA in which the operator sequence is constructed iteratively. This adaptive scheme accelerates convergence, reduces the count of two-qubit gates and optimises classical-quantum feedback loops, improving feasibility for near-term devices. Complementing these algorithmic advances, innovations in qubit-reuse compilation leverage mid-circuit measurement and reset to recycle physical qubits. Applied to MaxCut circuits, this approach halves the qubit footprint and enables execution of higher-depth QAOA instances on existing hardware, thereby enhancing the practical reach of combinatorial quantum heuristics.

Quantum Approximate Optimization Algorithms in Combinatorial Problems publication trend

The graph below shows the total number of articles in quantum approximate optimization algorithms in combinatorial problems across all publications each year (not limited to Nature Index journals).

Technical terms

Quantum Approximate Optimization Algorithm (QAOA): hybrid quantum–classical variational algorithm that alternates between cost and mixer unitaries to approximate solutions of combinatorial optimisation problems.

Combinatorial optimisation problem: task of finding an optimal arrangement or selection from a finite set of discrete configurations based on an objective function.

Cost Hamiltonian: operator encoding the objective function of a combinatorial problem, whose ground state corresponds to the optimal or near-optimal solution.

Mixer Hamiltonian: operator that induces transitions among basis states, enabling exploration of the solution space in QAOA.

Variational parameter: real-valued angle determining the duration of evolution under Hamiltonians in a QAOA circuit, adjusted by a classical optimiser.

NISQ: noisy intermediate-scale quantum devices with limited qubit counts and coherence times, lacking full error correction.

References

1. Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices. Physical Review X (2020).
2. From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz. Algorithms (2019).
3. Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm. PRX Quantum (2024).
4. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific Reports (2019).
5. Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Physical Review Research (2022).
6. Qubit-Reuse Compilation with Mid-Circuit Measurement and Reset. Physical Review X (2023).