Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Brief Introduction to the QAOA

Andreas Bärtschi

Published Jun 17, 2024• 0 citations
OpenAlex

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a heuristic for unconstrained combinatorial optimization.It prepares a statefrom which one would like to sample good solutions with high probability.QAOA is specified by • the initial state + 𝑛 , the uniform superposition over all basis states,• a Cost Hamiltonian 𝐻 𝐶 , used to phase basis states proportional to their cost 𝐶 𝑥 : 𝑥 ↦ 𝑒 -𝑖𝛾𝐶(𝑥) |𝑥⟩ and to evaluate the expectation value of the QAOA state, ⟨𝜷, 𝜸 𝐻 𝐶 𝜷, 𝜸⟩,• a Transverse Field Mixer ∑ 𝑖=1 𝑛 𝑋 𝑖 , used to interfere states in order to boost good solutions,• 𝑝 rounds with individual angle parameters 𝛽 1 , … , 𝛽 𝑝 , 𝛾 1 , … , 𝛾 𝑝 .

Related papers

Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants

Ng, Truman Yu, Jin Ming Koh, Dax Enshan Koh

The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm aimed at solving combinatorial optimization problems. Since its introduction, various generalizations have emerged, spanning modifications to the initial state, phase unitaries, and mixer unitaries. In this work, we present an analytical study of broad families of QAOA variants. We begin by examining a family of QAOA with product mixers, which includes single-body mixers parametrized by multiple variational angles, and derive exact analytical expressions for the cost expectation on weighted problem graphs in the single-layer ansatz setting. We then analyze a family of QAOA that employs many-body Grover-type mixers, deriving analogous analytical expressions for weighted problem hypergraphs in the setting of arbitrarily many circuit ansatz layers. For both families, we allow individual phase angles for each node and edge (hyperedge) in the problem graph (hypergraph). Our results reveal that, in contrast to product mixers, the Grover mixer is sensitive to contributions from cycles of all lengths in the problem graph, exhibiting a form of non-locality. Our study advances the understanding of QAOA's behavior in general scenarios, providing a foundation for further theoretical exploration.

arXiv:2411.09745•Nov 14, 2024•9 citations

Toward Quantum Combinatorial Optimization

Yunpyo Hong, Jaejoon Gill, Daeyeun Kim +3 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 citations

Hamiltonian-oriented homotopy quantum approximate optimization algorithm

Akash Kundu, Ludmila Botelho, Adam Glos

The classical homotopy optimization approach has the potential to deal with highly nonlinear landscapes, such as the energy landscape of quantum approximate optimization algorithm (QAOA) problems. Following this motivation, we introduce Hamiltonian-oriented homotopy QAOA (HOHo-QAOA), a heuristic method for combinatorial optimization using QAOA, based on classical homotopy optimization. The method consists of a homotopy map that produces an optimization problem for each value of the interpolating parameter. Therefore, HOHo-QAOA decomposes the optimization of QAOA into several loops, each using a mixture of the mixer and the objective Hamiltonian for cost function evaluation. Furthermore, we conclude that the HOHo-QAOA improves the search for low-energy states in the nonlinear energy landscape and outperforms other variants of QAOA.

arXiv:2301.13170•Physical Review A•Feb 20, 2024•4 citations

An Efficient QAOA via a Polynomial QPU-Needless Approach

Francisco Chicano, Zakaria Abdelmoiz Dahi, Gabriel Luque

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum algorithm described as ansatzes that represent both the problem and the mixer Hamiltonians. Both are parameterizable unitary transformations executed on a quantum machine/simulator and whose parameters are iteratively optimized using a classical device to optimize the problem's expectation value. To do so, in each QAOA iteration, most of the literature uses a quantum machine/simulator to measure the QAOA outcomes. However, this poses a severe bottleneck considering that quantum machines are hardly constrained (e.g. long queuing, limited qubits, etc.), likewise, quantum simulation also induces exponentially-increasing memory usage when dealing with large problems requiring more qubits. These limitations make today's QAOA implementation impractical since it is hard to obtain good solutions with a reasonably-acceptable time/resources. Considering these facts, this work presents a new approach with two main contributions, including (I) removing the need for accessing quantum devices or large-sized classical machines during the QAOA optimization phase, and (II) ensuring that when dealing with some k-bounded pseudo-Boolean problems, optimizing the exact problem's expectation value can be done in polynomial time using a classical computer.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 15, 2023•3 citations

Learning angles for quantum approximate optimization

Johannes Jakubik, Isabelle Wittmann, Zaheed Gaffoor +5 more

The Quantum Approximate Optimization Algorithm (QAOA) and its variants are leading algorithms to help solve challenging combinatorial optimization problems. QAOA maps these problems to Ising Hamiltonians such that their ground state is the desired solution. Candidate solutions are then drawn from a variational quantum circuit. The performance of QAOA hinges on a set of variational angles. However, finding good angles is an instance-specific and computationally expensive non-convex classical optimization task. Here, we learn the mapping from the problem instance to high-quality QAOA angles. Our learned models replace the per-instance optimization, that we call the solver, with a single forward pass that is several orders of magnitude faster than the solver with a near identical quality. Our models further generalize to unseen topologies such as Barabási-Albert and 2D grid graphs. Experiments on quantum hardware confirm that QAOA samples with angles produced by our open-source models are indistinguishable from solver angles. Crucially, models sensitive to the topology of the problem instance increase the quality of the QAOA angles. Our work amortizes a major bottleneck in QAOA by an up-front data generation and training cost. Importantly, this cost can be amortized over time in settings where many similar problems are optimized on a regular basis, as is often the case in applications for industry.

quant-pharXiv:2610.23296•Oct 19, 2026•0 citations

Quantum approximate optimization algorithm with random and subgraph phase operators

Anthony Wilkie, Igor Gaidai, James Ostrowski +1 more

The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and mixer Hamiltonians. In this work, we study how using Hamiltonians other than the usual cost Hamiltonian, dubbed custom phase operators, can affect the performance of the QAOA. We derive an expected value formula for the QAOA with custom phase operators at $p=1$ and show numerically that some of these custom phase operators can achieve higher approximation ratios than the original algorithm implementation. Out of all the graphs tested at $p=1$, 0.036% of the random custom phase operators, 75.9% of the subgraph custom phase operators, 95.1% of the triangle-removed custom phase operators, and 93.9% of the maximal degree edge-removed custom phase operators have a higher approximation ratio than the original QAOA implementation. Furthermore, we numerically simulate these phase operators for $p=2$ and $p=3$ levels of QAOA and find that there exist a large number of subgraph, triangle-removed, and maximal degree edge-removed custom phase operators that have a higher approximation ratio than the QAOA at the same depth. These findings open up the question of whether better phase operators can be designed to further improve the performance of the QAOA.

arXiv:2402.18412•Physical Review A•Aug 27, 2024•8 citations
The Quantum Approximate Optimization Algorithm (QAOA) is a heuristic for unconstrained combinatorial optimization.It prepares a statefrom which one would like to sample good solutions with high probability.QAOA is specified by • the initial state + 𝑛 , the uniform superposition over all basis states,• a Cost Hamiltonian 𝐻 𝐶 , used to phase basis states proportional to their cost 𝐶 𝑥 : 𝑥 ↦ 𝑒 -𝑖𝛾𝐶(𝑥) |𝑥⟩ and to evaluate the expectation value of the QAOA state, ⟨𝜷, 𝜸 𝐻 𝐶 𝜷, 𝜸⟩,• a Transverse Field Mixer ∑ 𝑖=1 𝑛 𝑋 𝑖 , used to interfere states in order to boost good solutions,• 𝑝 rounds with individual angle parameters 𝛽 1 , … , 𝛽 𝑝 , 𝛾 1 , … , 𝛾 𝑝 .
The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm aimed at solving combinatorial optimization problems. Since its introduction, various generalizations have emerged, spanning modifications to the initial state, phase unitaries, and mixer unitaries. In this work, we present an analytical study of broad families of QAOA variants. We begin by examining a family of QAOA with product mixers, which includes single-body mixers parametrized by multiple variational angles, and derive exact analytical expressions for the cost expectation on weighted problem graphs in the single-layer ansatz setting. We then analyze a family of QAOA that employs many-body Grover-type mixers, deriving analogous analytical expressions for weighted problem hypergraphs in the setting of arbitrarily many circuit ansatz layers. For both families, we allow individual phase angles for each node and edge (hyperedge) in the problem graph (hypergraph). Our results reveal that, in contrast to product mixers, the Grover mixer is sensitive to contributions from cycles of all lengths in the problem graph, exhibiting a form of non-locality. Our study advances the understanding of QAOA's behavior in general scenarios, providing a foundation for further theoretical exploration.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.
The classical homotopy optimization approach has the potential to deal with highly nonlinear landscapes, such as the energy landscape of quantum approximate optimization algorithm (QAOA) problems. Following this motivation, we introduce Hamiltonian-oriented homotopy QAOA (HOHo-QAOA), a heuristic method for combinatorial optimization using QAOA, based on classical homotopy optimization. The method consists of a homotopy map that produces an optimization problem for each value of the interpolating parameter. Therefore, HOHo-QAOA decomposes the optimization of QAOA into several loops, each using a mixture of the mixer and the objective Hamiltonian for cost function evaluation. Furthermore, we conclude that the HOHo-QAOA improves the search for low-energy states in the nonlinear energy landscape and outperforms other variants of QAOA.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum algorithm described as ansatzes that represent both the problem and the mixer Hamiltonians. Both are parameterizable unitary transformations executed on a quantum machine/simulator and whose parameters are iteratively optimized using a classical device to optimize the problem's expectation value. To do so, in each QAOA iteration, most of the literature uses a quantum machine/simulator to measure the QAOA outcomes. However, this poses a severe bottleneck considering that quantum machines are hardly constrained (e.g. long queuing, limited qubits, etc.), likewise, quantum simulation also induces exponentially-increasing memory usage when dealing with large problems requiring more qubits. These limitations make today's QAOA implementation impractical since it is hard to obtain good solutions with a reasonably-acceptable time/resources. Considering these facts, this work presents a new approach with two main contributions, including (I) removing the need for accessing quantum devices or large-sized classical machines during the QAOA optimization phase, and (II) ensuring that when dealing with some k-bounded pseudo-Boolean problems, optimizing the exact problem's expectation value can be done in polynomial time using a classical computer.
The Quantum Approximate Optimization Algorithm (QAOA) and its variants are leading algorithms to help solve challenging combinatorial optimization problems. QAOA maps these problems to Ising Hamiltonians such that their ground state is the desired solution. Candidate solutions are then drawn from a variational quantum circuit. The performance of QAOA hinges on a set of variational angles. However, finding good angles is an instance-specific and computationally expensive non-convex classical optimization task. Here, we learn the mapping from the problem instance to high-quality QAOA angles. Our learned models replace the per-instance optimization, that we call the solver, with a single forward pass that is several orders of magnitude faster than the solver with a near identical quality. Our models further generalize to unseen topologies such as Barabási-Albert and 2D grid graphs. Experiments on quantum hardware confirm that QAOA samples with angles produced by our open-source models are indistinguishable from solver angles. Crucially, models sensitive to the topology of the problem instance increase the quality of the QAOA angles. Our work amortizes a major bottleneck in QAOA by an up-front data generation and training cost. Importantly, this cost can be amortized over time in settings where many similar problems are optimized on a regular basis, as is often the case in applications for industry.
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and mixer Hamiltonians. In this work, we study how using Hamiltonians other than the usual cost Hamiltonian, dubbed custom phase operators, can affect the performance of the QAOA. We derive an expected value formula for the QAOA with custom phase operators at p=1p=1p=1 and show numerically that some of these custom phase operators can achieve higher approximation ratios than the original algorithm implementation. Out of all the graphs tested at p=1p=1p=1, 0.036% of the random custom phase operators, 75.9% of the subgraph custom phase operators, 95.1% of the triangle-removed custom phase operators, and 93.9% of the maximal degree edge-removed custom phase operators have a higher approximation ratio than the original QAOA implementation. Furthermore, we numerically simulate these phase operators for p=2p=2p=2 and p=3p=3p=3 levels of QAOA and find that there exist a large number of subgraph, triangle-removed, and maximal degree edge-removed custom phase operators that have a higher approximation ratio than the QAOA at the same depth. These findings open up the question of whether better phase operators can be designed to further improve the performance of the QAOA.