.png){kind=icon}
返回
Quantum-enhanced greedy combinatorial optimization solver
.png){kind=icon}
OA
AI
DOI：10.1126/sciadv.adi0487.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required to bolster their performance. Here, we introduce an iterative quantum heuristic optimization algorithm to solve combinatorial optimization problems. The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise. We implement the quantum algorithm on a programmable superconducting quantum system using up to 72 qubits for solving paradigmatic Sherrington-Kirkpatrick Ising spin glass problems. We find the quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement. Moreover, we observe an absolute performance comparable with a state-of-the-art semidefinite programming method. Classical simulations of the algorithm illustrate that a key challenge to reaching quantum advantage remains improving the quantum device characteristics.
Keyword:
APPROXIMATE OPTIMIZATION
ALGORITHM
MODEL
ENTANGLEMENT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.5
论文数:
2.1W
被引数:
18.1W
机构
引用论文
.png){kind=icon}
The Variational Quantum Eigensolver: A review of methods and best practices变分量子本征求解器: 方法和最佳实践的回顾OAAI
OAAI分享收藏
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator使用陷阱离子量子模拟器对远程Ising模型进行量子近似优化OAAI
OAAI分享收藏
查看更多内容