Benchmarking the quantum approximate optimization algorithm

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

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 19; no. 7
Main Authors:	Willsch, Madita, Willsch, Dennis, Jin, Fengping, De Raedt, Hans, Michielsen, Kristel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2020 Springer Nature B.V
Subjects:	Algorithms Computer simulation Data Structures and Information Theory Ground state Ising model Mathematical Physics Optimization Optimization algorithms Physics Physics and Astronomy Quantum computers Quantum Computing Quantum Information Technology Quantum Physics Simulators Spintronics Quantum annealing Quantum computation Optimization problems QAOA
ISSN:	1570-0755, 1573-1332
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!