.png){kind=icon}
.png){kind=icon}
Return
Quantum approximate optimization algorithm applied to the binary perceptron
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevB.107.094202.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We apply digitized quantum annealing (QA) and quantum approximate optimization algorithm (QAOA) to a paradigmatic task of supervised learning in artificial neural networks: the optimization of synaptic weights for the binary perceptron. At variance with the usual QAOA applications to MaxCut, or to quantum spin-chains ground -state preparation, here the classical cost function is characterized by highly nonlocal multispin interactions. Yet, we provide evidence for the existence of optimal smooth solutions for the QAOA parameters, which are transferable among typical instances of the same problem, and we prove numerically an enhanced performance of QAOA over traditional QA. We also investigate on the role of the classical cost-function landscape geometry in this problem. By artificially breaking this geometrical structure, we show that the detrimental effect of a gap -closing transition, encountered in QA, is also negatively affecting the performance of our QAOA implementation.
Journal
IF:
3.7
Papers:
15.4W
Citations:
41.0W