Journal
QUANTUM INFORMATION PROCESSING
Volume 19, Issue 7, Pages -Publisher
SPRINGER
DOI: 10.1007/s11128-020-02692-8
Keywords
Quantum computation; Quantum annealing; Optimization problems; QAOA
Funding
- Projekt DEAL
- Initiative and Networking Fund of the Helmholtz Association through the Strategic Future Field of Research project Scalable solid state quantum computing [ZT-0013]
- project OpenSuperQ of the EU Flagship Quantum Technologies [820363]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
