Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.00077 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917571444342784 |
|---|---|
| author | Wu, Mingyou Chen, Hanwu |
| author_facet | Wu, Mingyou Chen, Hanwu |
| contents | The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of circuit runs associated with parameter optimization. Existing methods for parameter setting generally incur at least a superlinear cost concerning the depth p of QAOA. In this study, we propose a novel adiabatic-passage-based parameter setting method that remarkably reduces the optimization cost, specifically when applied to the 3-SAT problem, to a sublinear level. Beginning with an analysis of the random model of the specific problem, this method applies a problem-dependent preprocessing on the problem Hamiltonian analytically, effectively segregating the magnitude of parameters from the scale of the problem. Consequently, a problem-independent initialization is achieved without incurring any optimization cost or pre-computation. Furthermore, the parameter space is adjusted based on the continuity of the optimal adiabatic passage, resulting in a reduction in the disparity of parameters between adjacent layers of QAOA. By leveraging this continuity, the cost to find quasi-optimal parameters is significantly reduced to a sublinear level. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_00077 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Adiabatic-Passage-Based Parameter Setting for Quantum Approximate Optimization Algorithm Wu, Mingyou Chen, Hanwu Quantum Physics The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of circuit runs associated with parameter optimization. Existing methods for parameter setting generally incur at least a superlinear cost concerning the depth p of QAOA. In this study, we propose a novel adiabatic-passage-based parameter setting method that remarkably reduces the optimization cost, specifically when applied to the 3-SAT problem, to a sublinear level. Beginning with an analysis of the random model of the specific problem, this method applies a problem-dependent preprocessing on the problem Hamiltonian analytically, effectively segregating the magnitude of parameters from the scale of the problem. Consequently, a problem-independent initialization is achieved without incurring any optimization cost or pre-computation. Furthermore, the parameter space is adjusted based on the continuity of the optimal adiabatic passage, resulting in a reduction in the disparity of parameters between adjacent layers of QAOA. By leveraging this continuity, the cost to find quasi-optimal parameters is significantly reduced to a sublinear level. |
| title | Adiabatic-Passage-Based Parameter Setting for Quantum Approximate Optimization Algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2312.00077 |