.png){kind=icon}
返回
Speedup in adiabatic evolution based quantum algorithms
.png){kind=icon}
PRE
AI
DOI：10.1007/s11433-012-4854-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this context, we study three different strategies to improve the time complexity of the widely used adiabatic evolution algorithms when solving a particular class of quantum search problems where both the initial and final Hamiltonians are one-dimensional projector Hamiltonians on the corresponding ground state. After some simple analysis, we find the time complexity improvement is always accompanied by the increase of some other complexities that should be considered. But this just gives the implication that more feasibilities can be achieved in adiabatic evolution based quantum algorithms over the circuit model, even though the equivalence between the two has been shown. In addition, we also give a rough comparison between these different models for the speedup of the problem.
Keyword:
adiabatic evolution
evolution paths
quantum computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
7.5
论文数:
3.9K
被引数:
7.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容