A quantum walk-assisted approximate algorithm for bounded NP optimisation problems

This paper describes an application of the quantum approximate optimisation algorithm (QAOA) to efficiently find approximate solutions for computational problems contained in the polynomially bounded NP optimisation complexity class (NPO PB). We consider a generalisation of the QAOA state evolution...

Full description

Bibliographic Details

Published in:	Quantum information processing Vol. 18; no. 3; pp. 1 - 18
Main Authors:	Marsh, S., Wang, J. B.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2019 Springer Nature B.V
Subjects:	Algorithms Computer simulation Data Structures and Information Theory Mathematical Physics Optimization Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Spintronics Minimum vertex cover Quantum walks Quantum optimisation QAOA
ISSN:	1570-0755, 1573-1332
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!