• Home
  • Search
  • Lower bounds on circuit depth of the quantum approximate optimization algorithm
  • Open Access IconOpen Access
  • Cite Icon39
  • https://doi.org/10.1007/s11128-021-03001-7Copy DOI Icon

Lower bounds on circuit depth of the quantum approximate optimization algorithm

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. Here, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

Similar Papers
  • Research Article

Modified recursive QAOA for exact MAX-CUT solutions on bipartite graphs: closing the gap beyond QAOA limit

  • Nov 28, 2025
  • Journal of Physics A: Mathematical and Theoretical
  • Eunok Bae +3
  • PDF
  • Research Article
  • Citations8

Iteration-Free quantum approximate optimization algorithm using neural networks

  • Jul 01, 2024
  • Quantum Machine Intelligence
  • Ohad Amosy +5
  • PDF
  • Research Article
  • Citations150

Quantum annealing initialization of the quantum approximate optimization algorithm

  • Jul 01, 2021
  • Quantum
  • Stefan H Sack +1
  • Research Article
  • Citations12

Automatic depth optimization for a quantum approximate optimization algorithm

  • Mar 21, 2022
  • Physical Review A
  • Yu Pan +2
  • PDF
  • Research Article
  • Citations1

Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models

  • Dec 10, 2024
  • Quantum
  • Elisabeth Wybo +1
  • Conference Article
  • Citations2

Insights on Training Neural Networks for QUBO Tasks

  • Jun 27, 2020
  • Thomas Gabor +4
  • Research Article
  • Citations65

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

  • Nov 17, 2021
  • Physical Review A
  • Jonathan Wurtz +1
  • Research Article
  • Citations3

Deep-Circuit QAOA

  • Oct 13, 2025
  • Quantum
  • Gereon Koßmann +4
  • Research Article
  • Citations12

Analog quantum approximate optimization algorithm

  • Sep 26, 2022
  • Quantum Science & Technology
  • Nancy Barraza +5
  • Research Article
  • Citations13

Quantum Neural Network Inspired Hardware Adaptable Ansatz for Efficient Quantum Simulation of Chemical Systems.

  • Dec 04, 2023
  • Journal of Chemical Theory and Computation
  • Xiongzhi Zeng +4
  • Research Article
  • Citations789

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

  • Feb 12, 2019
  • Algorithms
  • Stuart Hadfield +5
  • Research Article
  • Citations1

VRoptBees

  • Jan 01, 2018
  • International Journal of Natural Computing Research
  • Thiago A.S Masutti +1
  • Conference Article

Design of a Superposition-Based Approximate QRAM for Noise-Tolerant Quantum Machine Learning

  • Jan 09, 2026
  • Sohrab Sajadimanesh +1
  • PDF
  • Research Article
  • Citations7

Quantum Convolutional Long Short-Term Memory Based on Variational Quantum Algorithms in the Era of NISQ

  • Mar 22, 2024
  • Information
  • Zeyu Xu +3
  • Research Article
  • Citations21

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting.

  • Oct 20, 2023
  • The Journal of Physical Chemistry Letters
  • Yi Fan +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.