.png){kind=icon}
返回
Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer
.png){kind=icon}
PRE
AI
DOI：10.1103/PhysRevApplied.23.014045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting quantum computer, we experimentally investigate the performance of a hybrid quantum-classical algorithm inspired by semidefinite programming approaches for solving the maximum-cut problem on 3-regular graphs up to several thousand variables. We leverage the structure of the input problems to address sizes beyond what current quantum machines can naively handle. We attain an average approximation ratio of 99% over a random ensemble of thousands of problem instances. We benchmark the quantum solver against similarly high-performing classical heuristics, including the GUROBI optimizer, simulated annealing, and the Burer-Monteiro algorithm. A run-time analysis shows that the quantum solver on large-scale problems is competitive against GUROBI but short of others on a projected 100-qubit quantum computer. We explore multiple leads to close the gap and discuss prospects for a practical quantum speedup.
Keyword:
MAX-CUT
EIGENVALUES
HEURISTICS
ALGORITHM
期刊
IF:
4.4
论文数:
7.1K
被引数:
2.8W
机构
引用论文
A Preoperative and Postoperative Study of the Accuracy and Value of Electrodiagnosis in Patients with Lumbosacral Disc Herniation.png)
Spine
SpineIF0
PREAI
分享收藏Using TRIS-Buffered Plasma-Activated Water to Reduce Pathogenic Microorganisms on Poultry Carcasses with Evaluation of Physicochemical and Sensory ParametersFoods
OAAI
FoodsIF0
OAAI分享收藏
查看更多内容