Author
Listed:
- Xinwei Lee
(Faculty of Engineering, Information and Systems, University of Tsukuba, Ibaraki 305-8577, Japan)
- Ningyi Xie
(Faculty of Engineering, Information and Systems, University of Tsukuba, Ibaraki 305-8577, Japan)
- Dongsheng Cai
(Faculty of Engineering, Information and Systems, University of Tsukuba, Ibaraki 305-8577, Japan)
- Yoshiyuki Saito
(School of Computer Science and Engineering, University of Aizu, Fukushima 965-0006, Japan)
- Nobuyoshi Asai
(School of Computer Science and Engineering, University of Aizu, Fukushima 965-0006, Japan)
Abstract
The quantum approximate optimization algorithm (QAOA) is known for its capability and universality in solving combinatorial optimization problems on near-term quantum devices. The results yielded by QAOA depend strongly on its initial variational parameters. Hence, parameter selection for QAOA becomes an active area of research, as bad initialization might deteriorate the quality of the results, especially at great circuit depths. We first discuss the patterns of optimal parameters in QAOA in two directions: the angle index and the circuit depth. Then, we discuss the symmetries and periodicity of the expectation that is used to determine the bounds of the search space. Based on the patterns in optimal parameters and the bounds restriction, we propose a strategy that predicts the new initial parameters by taking the difference between the previous optimal parameters. Unlike most other strategies, the strategy we propose does not require multiple trials to ensure success. It only requires one prediction when progressing to the next depth. We compare this strategy with our previously proposed strategy and the layerwise strategy for solving the Max-cut problem in terms of the approximation ratio and the optimization cost. We also address the non-optimality in previous parameters, which is seldom discussed in other works despite its importance in explaining the behavior of variational quantum algorithms.
Suggested Citation
Xinwei Lee & Ningyi Xie & Dongsheng Cai & Yoshiyuki Saito & Nobuyoshi Asai, 2023.
"A Depth-Progressive Initialization Strategy for Quantum Approximate Optimization Algorithm,"
Mathematics, MDPI, vol. 11(9), pages 1-14, May.
Handle:
RePEc:gam:jmathe:v:11:y:2023:i:9:p:2176-:d:1139926
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:9:p:2176-:d:1139926. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.