Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …

Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Abstract Variational Quantum Algorithms (VQAs) have received considerable attention due
to their potential for achieving near-term quantum advantage. However, more work is …

The quantum approximate optimization algorithm (QAOA) generates an approximate
solution to combinatorial optimization problems using a variational ansatz circuit defined by …

Realizing the potential of near-term quantum computers to solve industry-relevant
constrained-optimization problems is a promising path to quantum advantage. In this work …

There is an increasing interest in quantum algorithms for problems of integer programming
and combinatorial optimization. Classical solvers for such problems employ relaxations …

The quantum approximate optimization algorithm (QAOA) has become a cornerstone of
contemporary quantum applications development. In QAOA, a quantum circuit is trained—by …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

Combinatorial optimization is a broadly attractive area for potential quantum advantage, but
no quantum algorithm has yet made the leap. Noise in quantum hardware remains a …

Quantum computing has emerged as a powerful computational paradigm capable of solving
problems beyond the reach of classical computers. However, today's quantum computers …