.png){kind=icon}
返回
Learning adiabatic quantum algorithms over optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s42484-020-00030-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem, and an evolution schedule such that the adiabatic condition is satisfied. A correct choice of these elements is crucial for an efficient adiabatic quantum computation. In this paper, we propose a hybrid quantum-classical algorithm that, by solving optimization problems with an adiabatic machine, determines a problem Hamiltonian assuming restrictions on the class of available problem Hamiltonians. The scheme is based on repeated calls to the quantum machine into a classical iterative structure. In particular, we suggest a technique to estimate the encoding of a given optimization problem into a problem Hamiltonian and we prove the convergence of the algorithm.
Keyword:
Adiabatic quantum computing
Hybrid quantum-classical algorithms
Tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
Q
IF:
4.4
论文数:
440
被引数:
796
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏v Machine learning & artificial intelligence in the quantum domain: a review of recent progressv量子领域的机器学习和人工智能: 最新进展综述OAAI
OAAI分享收藏
查看更多内容