Table 2 Comparison of the hardware demonstrations shown in this work with previous hardware demonstrations of QAOA on gate-based devices.
From: Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer
References | Year | Hardware | Connectivity | N | p | 2q-gate depth | Error Mit. | H.W.C. | |
|---|---|---|---|---|---|---|---|---|---|
Unconstrained | 2017 | Superconducting | Nearest neighbor | 19 | 1 | 6 | No | – | |
2020 | Superconducting | Nearest neighbor | 7 | 6 | 42 | No | – | ||
2021 | Superconducting | Nearest neighbor | 23 | 5 | \(40^1\) | Yes | – | ||
2021 | Superconducting | Nearest neighbor | 17 | 3 | 153 | Yes | – | ||
Hard constraint | 2022 | Superconducting | Nearest neighbor | 3 | 5 | – | No | 2 | |
2022 | Trapped ion | All-to-all | 3 | 4 | – | No | 2 | ||
This work | 2022 | Trapped ion | All-to-all | 14 | 1 | 114 | No | 8 | |
This work | 2022 | Trapped ion | All-to-all | 20 | 1 | \({159}\) | No | 14 |