Benchmarking the Quantum Approximate Optimization Algorithm
Abstract
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation ratio. The set of problem instances studied consists of weighted MaxCut problems and 2-satisfiability problems. The Ising model representations of the latter possess unique ground states and highly-degenerate first excited states. The quantum approximate optimization algorithm is executed on quantum computer simulators and on the IBM Q Experience. Additionally, data obtained from the D-Wave 2000Q quantum annealer is used for comparison, and it is found that the D-Wave machine outperforms the quantum approximate optimization algorithm executed on a simulator. The overall performance of the quantum approximate optimization algorithm is found to strongly depend on the problem instance.
Read the paper
Related studies
- Chaos and quantum thermalization
- The Dalton quantum chemistry program system
- Cord Blood Leptin and Adiponectin as Predictors of Adiposity in Children at 3 Years of Age: A Prospective Cohort Study
- Quantitative metabolomics by H-NMR and LC-MS/MS confirms altered metabolic pathways in diabetes
- Stable adiabatic quantum batteries
- A novel self-lipid antigen targets human T cells against CD1c(+) leukemias
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.