Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer

Simple item page
dc.contributor.authorZhu, Linghuaen
dc.contributor.authorTang, Ho Lunen
dc.contributor.authorBarron, George S.en
dc.contributor.authorCalderon-Vargas, F. A.en
dc.contributor.authorMayhall, Nicholas J.en
dc.contributor.authorBarnes, Edwin Flemingen
dc.contributor.authorEconomou, Sophia E.en
dc.date.accessioned2022-11-01T15:08:51Zen
dc.date.available2022-11-01T15:08:51Zen
dc.date.issued2022-07-11en
dc.description.abstractThe quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA Ansatz is not optimal, there is no systematic approach for finding better Ansatze. We address this problem by developing an iterative version of QAOA that is problem tailored, and which can also be adapted to specific hardware constraints. We simulate the algorithm on a class of Max-Cut graph problems and show that it converges much faster than the standard QAOA, while simultaneously reducing the required number of CNOT gates and optimization parameters. We provide evidence that this speedup is connected to the concept of shortcuts to adiabaticity.en
dc.description.notesWe thank Bryan T. Gard and Ada Warren for helpful discussions. S.E.E. acknowledges support from the US Department of Energy (Award No. DE-SC0019318) . E.B. and N.J.M. acknowledge support from the US Department of En- ergy (Award No. DE-SC0019199) .en
dc.description.sponsorshipUS Department of Energy [DE-SC0019318]; US Department of En- ergy [DE-SC0019199]en
dc.description.versionPublished versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.doihttps://doi.org/10.1103/PhysRevResearch.4.033029en
dc.identifier.eissn2643-1564en
dc.identifier.issue3en
dc.identifier.other33029en
dc.identifier.urihttp://hdl.handle.net/10919/112327en
dc.identifier.volume4en
dc.language.isoenen
dc.publisherAmerican Physical Societyen
dc.rightsCreative Commons Attribution 4.0 Internationalen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en
dc.titleAdaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computeren
dc.title.serialPhysical Review Researchen
dc.typeArticle - Refereeden
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
PhysRevResearch.4.033029.pdf
Size:
554.71 KB
Format:
Adobe Portable Document Format
Description:
Published version
Download

Collections

Scholarly Works, Physics
Scholarly Works, Chemistry