arrow
Return

Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation

delete2025-01-09
delete0
delete
OA
AI
D
D. Arai *
K
K. Okada *
Y
Yuichiro Nakano
M
Mitarai, Kosuke
K
Keisuke Fujii
DOI:10.1103/PhysRevResearch.7.013035delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. Recently, a feedback-based quantum optimization algorithm has been proposed by Magann et al., Phys. Rev. Lett. 129, 250502 (2022). The method explicitly determines quantum circuit parameters by feeding back measurement results thus avoids classical parameter optimization that is known to cause significant trouble in quantum approximate optimization algorithm, the wellstudied near-term algorithm. Meanwhile, a significant drawback of the feedback-based quantum optimization is that it requires deep circuits, rendering the method unsuitable to noisy quantum devices. In this study we propose a feedback law for parameter determination by introducing the second-order approximation with respect to time interval, a hyperparameter in the feedback-based quantum optimization. This allows one to take larger time interval, leading to acceleration of convergence to solutions. In numerical simulations on the maximum cut problem we demonstrate that our proposal significantly reduces circuit depth, with its linear scaling with the problem size smaller by more than an order of magnitude. We expect that the feedback law proposed in this work may pave the way for feedback-based quantum optimization with near-term noisy quantum computers.

Journal

Physical Review Research cover
Physical Review Research
IF:
4.2
Papers:
7.6K
Citations:
2.7W

Organization

T
the university of osaka
Scholars:
2.8W
Papers: 1.8W
Citations: 6