.png){kind=icon}
Return
Optimizing Variational Quantum Algorithms Using Pontryagin's Minimum Principle
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevX.7.021027.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We use Pontryagin's minimum principle to optimize variational quantum algorithms. We show that for a fixed computation time, the optimal evolution has a bang-bang (square pulse) form, both for closed and open quantum systems with Markovian decoherence. Our findings support the choice of evolution ansatz in the recently proposed quantum approximate optimization algorithm. Focusing on the Sherrington-Kirkpatrick spin glass as an example, we find a system-size independent distribution of the duration of pulses, with characteristic time scale set by the inverse of the coupling constants in the Hamiltonian. The optimality of the bang-bang protocols and the characteristic time scale of the pulses provide an efficient parametrization of the protocol and inform the search for effective hybrid (classical and quantum) schemes for tackling combinatorial optimization problems. Furthermore, we find that the success rates of our optimal bang-bang protocols remain high even in the presence of weak external noise and coupling to a thermal bath.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.7
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveHow Plants Benefit from Providing Food to Predators Even When It Is Also Edible to Herbivores.png)
EcologyOAAI
EcologyIF0
OAAIShareSaveShareSaveComputational multiqubit tunnelling in programmable quantum annealersNATURE COMMUNICATIONSOAAI
NATURE COMMUNICATIONSIF15.7
OAAIShareSave
View more