A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm

The Quantum Approximate Optimization Algorithm (QAOA) was proposed as a way of finding good, approximate solutions to hard combinatorial optimization problems. QAOA uses a hybrid approach. A parametrized quantum state is repeatedly prepared and measured on a quantum computer to estimate its average...

Full description

Bibliographic Details

Published in:	Journal of computational and applied mathematics Vol. 404; p. 113388
Main Authors:	Fernández-Pendás, Mario, Combarro, Elías F., Vallecorsa, Sofia, Ranilla, José, Rúa, Ignacio F.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2022
Subjects:	Combinatorial optimization Function minimization Max-Cut Quantum Approximate Optimization Algorithm Combinatorial optimization Quantum Approximate Optimization Algorithm Function minimization Max-Cut
ISSN:	0377-0427, 1879-1778
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!