.png){kind=icon}
返回
Quantum analytic descent
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.4.023017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Variational algorithms have particular relevance for near-term quantum computers but require nontrivial parameter optimizations. Here we propose analytic descent: Given that the energy landscape must have a certain simple form in the local region around any reference point, it can be efficiently approximated in its entirety by a classical model-we support these observations with rigorous, complexity-theoretic arguments. One can classically analyze this approximate function to directly jump to the (estimated) minimum before determining a more refined function, if necessary. We derive an optimal measurement strategy and generally prove that the asymptotic resource cost of a jump corresponds to only a single gradient vector evaluation.
Keyword:
SIMULATION
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
分享收藏A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏分享收藏Witnessing eigenstates for quantum simulation of Hamiltonian spectra哈密顿谱量子模拟的见证本征态SCIENCE ADVANCESOAAI
SCIENCE ADVANCESIF12.5
OAAI分享收藏
查看更多内容