.png){kind=icon}
返回
Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1038/s41534-023-00718-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p & LE; 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.
Keyword:
SHORT CYCLES
MAX-CUT
期刊
IF:
8.3
论文数:
1.4K
被引数:
8.1K
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏The effect of fire-induced surface heterogeneity on rainfall-runoff-erosion relationships in an eastern Mediterranean ecosystem, IsraelCATENA
CATENAIF0
PREAI
分享收藏分享收藏
查看更多内容