Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

dc.contributor.authorRamoa, Mafaldaen
dc.contributor.authorSantos, Luis Pauloen
dc.contributor.authorMayhall, Nicholas J.en
dc.contributor.authorBarnes, Edwinen
dc.contributor.authorEconomou, Sophia E.en
dc.date.accessioned2025-02-18T13:18:12Zen
dc.date.available2025-02-18T13:18:12Zen
dc.date.issued2024-11-18en
dc.description.abstractAdaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.en
dc.description.versionAccepted versionen
dc.format.extent23 page(s)en
dc.format.mimetypeapplication/pdfen
dc.identifierARTN 015031 (Article number)en
dc.identifier.doihttps://doi.org/10.1088/2058-9565/ad904een
dc.identifier.eissn2058-9565en
dc.identifier.issn2058-9565en
dc.identifier.issue1en
dc.identifier.orcidMayhall, Nicholas [0000-0002-1312-9781]en
dc.identifier.urihttps://hdl.handle.net/10919/124631en
dc.identifier.volume10en
dc.language.isoenen
dc.publisherIOP Publishingen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectquantum computingen
dc.subjectquantum chemistryen
dc.subjectADAPT-VQEen
dc.subjectvariational quantum eigensolveren
dc.subjectNISQ algorithmsen
dc.titleReducing measurement costs by recycling the Hessian in adaptive variational quantum algorithmsen
dc.title.serialQuantum Science and Technologyen
dc.typeArticle - Refereeden
dc.type.dcmitypeTexten
dc.type.otherArticleen
dc.type.otherJournalen
pubs.organisational-groupVirginia Techen
pubs.organisational-groupVirginia Tech/Scienceen
pubs.organisational-groupVirginia Tech/Science/Chemistryen
pubs.organisational-groupVirginia Tech/Science/Physicsen
pubs.organisational-groupVirginia Tech/All T&R Facultyen
pubs.organisational-groupVirginia Tech/Science/COS T&R Facultyen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2401.05172v2.pdf
Size:
2.45 MB
Format:
Adobe Portable Document Format
Description:
Accepted version
License bundle
Now showing 1 - 1 of 1
Name:
license.txt
Size:
1.5 KB
Format:
Plain Text
Description: