期刊文献+

On Models of Nonlinear Evolution Paths in Adiabatic Quantum Algorithms

On Models of Nonlinear Evolution Paths in Adiabatic Quantum Algorithms
原文传递
导出
摘要 In this paper,we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector Hamiltonians on the corresponding ground state.If the overlap between the initial state and final state of the quantum system is not equal to zero,both of these models can provide a constant time speedup over the usual adiabatic algorithms by increasing some another corresponding "complexity".But when the initial state has a zero overlap with the solution state in the problem,the second model leads to an infinite time complexity of the algorithm for whatever interpolating functions being applied while the first one can still provide a constant running time.However,inspired by a related reference,a variant of the first model can be constructed which also fails for the problem when the overlap is exactly equal to zero if we want to make up the "intrinsic" fault of the second model - an increase in energy.Two concrete theorems are given to serve as explanations why neither of these two models can improve the usual adiabatic evolution algorithms for the phenomenon above.These just tell us what should be noted when using certain nonlinear evolution paths in adiabatic quantum algorithms for some special kind of problems.
出处 《Communications in Theoretical Physics》 SCIE CAS CSCD 2013年第1期22-26,共5页 理论物理通讯(英文版)
基金 Supported by the National Natural Science Foundation of China under Grant No. 61173050
关键词 adiabatic evolution nonlinear evolution paths quantum computing 非线性插值 量子系统 绝热 路径 模型 时间复杂度 演化算法 初始状态
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部