Quantum approximate optimization algorithm with random and subgraph phase operators
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909372937928704 |
|---|---|
| author | Wilkie, Anthony Gaidai, Igor Ostrowski, James Herrman, Rebekah |
| author_facet | Wilkie, Anthony Gaidai, Igor Ostrowski, James Herrman, Rebekah |
| contents | The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and mixer Hamiltonians. In this work, we study how using Hamiltonians other than the usual cost Hamiltonian, dubbed custom phase operators, can affect the performance of QAOA. We derive an expected value formula for QAOA with custom phase operators at $p = 1$ and show numerically that some of these custom phase operators can achieve higher approximation ratio than the original algorithm implementation. Out of all the graphs tested at $p=1$, 0.036\% of the random custom phase operators, 75.9\% of the subgraph custom phase operators, 95.1\% of the triangle-removed custom phase operators, and 93.9\% of the maximal degree edge-removed custom phase operators have a higher approximation ratio than the original QAOA implementation. Furthermore, we numerically simulate these phase operators for $p=2$ and $p=3$ levels of QAOA and find that there exist a large number of subgraph, triangle-removed, and maximal degree edge-removed custom phase operators that have a higher approximation ratio than QAOA at the same depth. These findings open up the question of whether better phase operators can be designed to further improve the performance of QAOA. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18412 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum approximate optimization algorithm with random and subgraph phase operators Wilkie, Anthony Gaidai, Igor Ostrowski, James Herrman, Rebekah Quantum Physics Emerging Technologies The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and mixer Hamiltonians. In this work, we study how using Hamiltonians other than the usual cost Hamiltonian, dubbed custom phase operators, can affect the performance of QAOA. We derive an expected value formula for QAOA with custom phase operators at $p = 1$ and show numerically that some of these custom phase operators can achieve higher approximation ratio than the original algorithm implementation. Out of all the graphs tested at $p=1$, 0.036\% of the random custom phase operators, 75.9\% of the subgraph custom phase operators, 95.1\% of the triangle-removed custom phase operators, and 93.9\% of the maximal degree edge-removed custom phase operators have a higher approximation ratio than the original QAOA implementation. Furthermore, we numerically simulate these phase operators for $p=2$ and $p=3$ levels of QAOA and find that there exist a large number of subgraph, triangle-removed, and maximal degree edge-removed custom phase operators that have a higher approximation ratio than QAOA at the same depth. These findings open up the question of whether better phase operators can be designed to further improve the performance of QAOA. |
| title | Quantum approximate optimization algorithm with random and subgraph phase operators |
| topic | Quantum Physics Emerging Technologies |
| url | https://arxiv.org/abs/2402.18412 |