Multi-angle quantum approximate optimization algorithm
Abstract 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...
Main Authors: | Rebekah Herrman, Phillip C. Lotshaw, James Ostrowski, Travis S. Humble, George Siopsis |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2022-04-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-022-10555-8 |
Similar Items
-
Scaling quantum approximate optimization on near-term hardware
by: Phillip C. Lotshaw, et al.
Published: (2022-07-01) -
Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems
by: Rebekah Herrman, et al.
Published: (2021-10-01) -
Numerical simulations of noisy quantum circuits for computational chemistry
by: Jerimiah Wright, et al.
Published: (2022-09-01) -
Scattering in the Ising model with the quantum Lanczos algorithm
by: Kübra Yeter-Aydeniz, et al.
Published: (2021-01-01) -
Progress towards Analytically Optimal Angles in Quantum Approximate Optimisation
by: Daniil Rabinovich, et al.
Published: (2022-07-01)