Journal Article

FZJ-2020-01888

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Benchmarking the quantum approximate optimization algorithm

Willsch, M. (Corresponding author)FZJ* ; Willsch, D.FZJ* ; Jin, F.FZJ* ; De Raedt, H.FZJ* ; Michielsen, K.FZJ*

2020
Springer Science + Business Media B.V. Dordrecht

This record in other databases:    

Please use a persistent id in citations: http://hdl.handle.net/2128/24990  doi:10.1007/s11128-020-02692-8

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 are 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.

---

Contributing Institute(s):

1. Jülich Supercomputing Center (JSC)

Research Program(s):

1. 511 - Computational Science and Mathematical Methods (POF3-511) (POF3-511)
2. PhD no Grant - Doktorand ohne besondere Förderung (PHD-NO-GRANT-20170405) (PHD-NO-GRANT-20170405)

Appears in the scientific report 2020

---

Database coverage:
; ; ; Clarivate Analytics Master Journal List ; Current Contents - Physical, Chemical and Earth Sciences ; Ebsco Academic Search ; IF < 5 ; JCR ; SCOPUS ; Science Citation Index Expanded ; Web of Science Core Collection

---