Quantum ComputingHardware & Implementation

Quantum Approximate Optimisation Algorithm

Overview

Direct Answer

The Quantum Approximate Optimisation Algorithm (QAOA) is a hybrid quantum-classical algorithm that addresses combinatorial optimisation problems by encoding them into parameterised quantum circuits executed on near-term quantum processors. Unlike algorithms requiring fault-tolerant quantum computers, QAOA is designed to deliver approximate solutions on noisy intermediate-scale quantum (NISQ) devices.

How It Works

QAOA applies alternating layers of problem-dependent unitary operators and mixer operators to a quantum state, with classical parameters tuned iteratively to maximise an objective function. The algorithm measures the resulting quantum state to obtain candidate solutions, then a classical optimiser (typically gradient-based or gradient-free) adjusts circuit parameters to improve solution quality across repeated executions.

Why It Matters

Organisations pursue QAOA because it offers a practical pathway to quantum advantage on existing hardware without waiting for error correction, reducing computational overhead for logistically constrained optimisation tasks. Industries including logistics, manufacturing, and finance prioritise it for potential speedups in supply chain routing and portfolio optimisation.

Common Applications

QAOA addresses maximum cut (MaxCut) problems, graph partitioning, constraint satisfaction problems, and vehicle routing optimisation. Research applications span portfolio optimisation in financial services and scheduling problems in manufacturing operations.

Key Considerations

Performance depends heavily on problem structure, circuit depth, and parameter initialisation; solutions are approximate rather than guaranteed optimal. Current implementations show mixed empirical results relative to classical heuristics, with advantage dependent on problem-specific topology and hardware calibration quality.

More in Quantum Computing