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

Celý popis

Podrobná bibliografia

Vydané v:	Quantum information processing Ročník 18; číslo 3; s. 1 - 18
Hlavní autori:	Marsh, S., Wang, J. B.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!