A Transformer-based intrinsic optimization framework for QAOA, in which the optimizer itself is learned and embedded directly into the hybrid quantum-classical loop, demonstrating that Transformer-based intrinsic optimization can provide a structured and transferable mechanism for improving the classical component of hybrid quantum optimization algorithms.
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a leading variational framework for combinatorial optimization on noisy intermediate-scale quantum hardware, but its practical performance depends strongly on the classical optimizer used to train its variational parameters. This outer-loop optimization is often nonconvex, initialization-sensitive, and costly when repeated across large families of related problem instances. In this work, we propose a Transformer-based intrinsic optimization framework for QAOA, in which the optimizer itself is learned and embedded directly into the hybrid quantum-classical loop. The proposed graph-conditioned Transformer processes problem structure, current QAOA parameters, measurement feedback, and recent optimization history to predict the next variational-parameter update, thereby reformulating instance-wise classical optimization as an amortized learned policy. We develop a mathematical formulation of this intrinsic-optimization perspective and evaluate the method on QAOA-based MaxCut benchmarks across multiple problem settings, with comparisons against representative classical and learned optimization baselines. The results demonstrate that Transformer-based intrinsic optimization can provide a structured and transferable mechanism for improving the classical component of hybrid quantum optimization algorithms.
This work proposes a bilevel optimization model for diagonal cost Hamiltonians where coefficients depend on a tunable outer parameter and develops correlator-reuse implicit differentiation (CR-ID), which obtains outer gradients by reusing quantum measurements already collected during inner energy estimation, requiring...
Tobias Rohe, M. Baumann, Federico Harjes Ruiloba et al.· 0 citations
Many optimization problems reveal inexpensive structural information before requiring costly final evaluation, whereas the conventional quantum approximate optimization algorithm (QAOA) applies a single aggregate objective throughout. We introduce the learned-projector quantum alternating operator ansatz (LP-QAOA), a m...
A hybrid quantum-classical column-and-constraint generation (QCCG) framework for solving two-stage adaptive robust optimization problems with binary first-stage decisions and linear recourse under polyhedral uncertainty and introduces a bound-adjustment mechanism that yields valid lower and upper bounds and provides a...
Duong The Do, Jiaming Cheng, Duong Tung Nguyen· 0 citations
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 theo...
S. Thota, N. Shilpa, Nasr Al Din Ide· IEEE Access· 0 citations
This work introduces a warm-start method based on local correlators obtained from the Quantum Approximate Optimization Algorithm (QAOA), and uses this information to initialize the Burer-Monteiro (BM) rank-two relaxation.
Bao Gia Bach, Ilya Safro, Filip B. Maciejewski· 0 citations
The proposed approach uses two-point correlations between decision variables derived from the Quantum Approximate Optimization Algorithm to construct a modified objective function that is subsequently provided to mixed-integer programming (MIP) solvers.
Anurag Ramesh, Bhuvanesh Sundar, Maxime Dupont et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.