arrow
返回

Multi-angle quantum approximate optimization algorithm

delete2022-04-26
delete54
delete
OA
AI
R
Rebekah Herrman *
P
Phillip C. Lotshaw *
J
James Ostrowski
T
Travis S. Humble
G
George Siopsis
DOI:10.1038/s41598-022-10555-8delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.
Keyword:
NOISE
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Scientific Reports 封面图
Scientific Reports
IF:
3.9
论文数:
28.3W
被引数:
83.5W

机构

U
University of Tennessee Knoxville
学者数:
1.1W
论文数: 9.4K
被引数: 17
U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 246
University of Tennessee System 封面图
University of Tennessee System
学者数:
2.9W
论文数: 2.7W
被引数: 115
学者 查看更多机构
引用论文

引用论文

Noise-induced barren plateaus in variational quantum algorithms
err2021-11-29
err201
errOAAI
errWang, Samson; Fontana, Enrico; Cerezo, M.; Sharma, Kunal; Sone, Akira; Cincio, Lukasz; Coles, Patrick J.
err分享
err收藏
err分享
err收藏
Steroid hormone binding receptors in the rat kidney
err1980-01-01
err0
PREAI
errM. Davidoff; H. Caffier; T. H. Schiebler
err分享
err收藏
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator使用陷阱离子量子模拟器对远程Ising模型进行量子近似优化
err2020-10-06
err156
errOAAI
errPagano, Guido; Bapat, Aniruddha; Becker, Patrick; Collins, Katherine S.; De, Arinjoy; Hess, Paul W.; Kaplan, Harvey B.; Kyprianidis, Antonis; Tan, Wen Lin; Baldwin, Christopher; Brady, Lucas T.; Deshpande, Abhinav; Liu, Fangli; Jordan, Stephen; Gorshkov, Alexey, V; Monroe, Christopher
err分享
err收藏
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
err2019-05-06
err194
errOAAI
errGuerreschi, G. G.; Matsuura, A. Y.
err分享
err收藏
Reinforcement-learning-assisted quantum optimization
err2020-09-18
err58
errOAAI
errWauters, Matteo M.; Panizon, Emanuele; Mbeng, Glen B.; Santoro, Giuseppe E.
err分享
err收藏
Effects of Quantum Noise on Quantum Approximate Optimization Algorithm
err2021-03-01
err60
errOAAI
errXue, Cheng; Chen, Zhao-Yun; Wu, Yu-Chun; Guo, Guo-Ping
err分享
err收藏
学者 查看更多内容