Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Multi-angle quantum approximate optimization algorithm

Journal Article · · Scientific Reports
 [1];  [2];  [1];  [2];  [1]
  1. Univ. of Tennessee, Knoxville, TN (United States)
  2. Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Quantum Computing Inst.
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.
Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
National Science Foundation (NSF); US Air Force Office of Scientific Research (AFOSR); US Army Research Office (ARO); USDOE
Grant/Contract Number:
AC05-00OR22725
OSTI ID:
1869104
Journal Information:
Scientific Reports, Journal Name: Scientific Reports Journal Issue: 1 Vol. 12; ISSN 2045-2322
Publisher:
Nature Publishing GroupCopyright Statement
Country of Publication:
United States
Language:
English

References (41)

Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer journal April 2019
A scheme for direct detection of qubit–environment entanglement generated during qubit pure dephasing journal December 2020
Lower bounds on circuit depth of the quantum approximate optimization algorithm journal February 2021
Impact of graph structures for QAOA on MaxCut journal September 2021
Empirical performance bounds for quantum approximate optimization journal November 2021
Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer journal July 2020
Anomalous collapses of Nares Strait ice arches leads to enhanced export of Arctic sea ice journal January 2021
Noise-induced barren plateaus in variational quantum algorithms journal November 2021
Emergence and control of complex behaviors in driven systems of interacting qubits with dissipation journal January 2021
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor journal February 2021
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up journal May 2019
Scaling quantum approximate optimization on near-term hardware journal July 2022
Experimental comparison of two quantum computing architectures journal March 2017
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator journal October 2020
Effects of Quantum Noise on Quantum Approximate Optimization Algorithm journal March 2021
The dominant eigenvector of a noisy quantum state journal December 2021
Characterizing local noise in QAOA circuits journal August 2020
X Y mixers: Analytical and numerical results for the quantum alternating operator ansatz journal January 2020
Quantum algorithms with local particle-number conservation: Noise effects and error correction journal April 2021
MaxCut quantum approximate optimization algorithm performance guarantees for p > 1 journal April 2021
Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs journal November 2021
Quantum approximate optimization algorithm for MaxCut: A fermionic view journal February 2018
Mitigating Realistic Noise in Practical Noisy Intermediate-Scale Quantum Devices journal March 2021
Quantum Walk on a Line for a Trapped Ion journal October 2009
Operating Quantum States in Single Magnetic Molecules: Implementation of Grover’s Quantum Algorithm journal November 2017
Efficient Implementation of a Quantum Algorithm in a Single Nitrogen-Vacancy Center of Diamond journal July 2020
Reinforcement-learning-assisted quantum optimization journal September 2020
Design-Space Exploration of Quantum Approximate Optimization Algorithm under Noise conference March 2020
Evaluating Quantum Approximate Optimization Algorithm: A Case Study conference October 2019
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation conference October 2020
The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover conference October 2020
Threshold-Based Quantum Optimization conference October 2021
Classically Optimal Variational Quantum Algorithms journal January 2021
A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations journal January 2002
Max-independent set and the quantum alternating operator ansatz journal June 2020
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
  • Murali, Prakash; Baker, Jonathan M.; Javadi-Abhari, Ali
  • ASPLOS '19: Architectural Support for Programming Languages and Operating Systems, Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems https://doi.org/10.1145/3297858.3304075
conference April 2019
Quantum approximate optimization for hard problems in linear algebra journal January 2021
Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm journal June 2021
Warm-starting quantum optimization journal June 2021
Ising formulations of many NP problems journal January 2014
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz journal February 2019

Cited By (2)

Scaling quantum approximate optimization on near-term hardware journal July 2022
Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization text January 2022

Similar Records

Lower bounds on circuit depth of the quantum approximate optimization algorithm
Journal Article · Mon Feb 08 19:00:00 EST 2021 · Quantum Information Processing · OSTI ID:1769243

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
Journal Article · Mon Feb 17 19:00:00 EST 2025 · Quantum Information Processing (Online) · OSTI ID:2538494

Empirical performance bounds for quantum approximate optimization
Journal Article · Wed Nov 24 19:00:00 EST 2021 · Quantum Information Processing · OSTI ID:1833977