.png){kind=icon}
Return
Optimizing a polynomial function on a quantum processor
.png){kind=icon}
OA
AI
DOI：10.1038/s41534-020-00351-5.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The gradient descent method is central to numerical optimization and is the key ingredient in many machine learning algorithms. It promises to find a local minimum of a function by iteratively moving along the direction of the steepest descent. Since for high-dimensional problems the required computational resources can be prohibitive, it is desirable to investigate quantum versions of the gradient descent, such as the recently proposed (Rebentrost et al.(1)). Here, we develop this protocol and implement it on a quantum processor with limited resources. A prototypical experiment is shown with a four-qubit nuclear magnetic resonance quantum processor, which demonstrates the iterative optimization process. Experimentally, the final point converged to the local minimum with a fidelity >94%, quantified via full-state tomography. Moreover, our method can be employed to a multidimensional scaling problem, showing the potential to outperform its classical counterparts. Considering the ongoing efforts in quantum information and data science, our work may provide a faster approach to solving high-dimensional optimization problems and a subroutine for future practical quantum computers.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.4K
Citations:
8.1K
Organization
Cited Papers
Corrigendum to “An Areal Assessment of Subseafloor Carbon Cycling in Cold Seeps and Hydrate-Bearing Areas in the Northern South China Sea”.png)
GeofluidsOAAI
GeofluidsIF0
OAAIShareSavePolyamines as Mediators of Estrogen Action on the Growth of Experimental Breast Cancer in Rats2
PREAI
ShareSaveShareSave
View more