.png){kind=icon}
返回
Benchmarking hybrid digitized-counterdiabatic quantum optimization
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.6.013147.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hybrid digitized-counterdiabatic quantum computing (DCQC) is a promising approach for leveraging the capabilities of nearterm quantum computers, utilizing parameterized quantum circuits designed with counterdiabatic protocols. However, the classical aspect of this approach has received limited attention. In this study, we systematically analyze the convergence behavior and solution quality of various classical optimizers when used in conjunction with the digitized-counterdiabatic approach. We demonstrate the effectiveness of this hybrid algorithm by comparing its performance to the traditional QAOA on systems containing up to 28 qubits. Furthermore, we employ principal component analysis to investigate the cost landscape and explore the crucial influence of parametrization on the performance of the counterdiabatic ansatz. Our findings indicate that fewer iterations are required when local cost landscape minima are present, and the SPSA-based BFGS optimizer emerges as a standout choice for the hybrid DCQC paradigm.
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving.png)
PHYSICAL REVIEW XOAAI
PHYSICAL REVIEW XIF15.7
OAAI分享收藏分享收藏Analyzing the performance of variational quantum factoring on a superconducting quantum processorOAAI
OAAI分享收藏分享收藏An adaptive variational algorithm for exact molecular simulations on a quantum computerNATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏
查看更多内容