arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.00817cond-mat.stat-mechcond-mat.dis-nn
收藏

数字化量子退火中的最佳工作点

Optimal working point in digitized quantum annealing

Glen Bigan Mbeng, Luca Arceci, Giuseppe E. Santoro

摘要:

我们提出了一个研究的数字化量子退火协议提出的R。Barends等人,Nature 534,222(2016).我们的分析,进行横向伊辛链问题的基准情况下,表明该算法有一个很好的定义的最佳工作点的退火时间$τ^{\mathrm{opt}}_\mathrm{P}$ -缩放为$τ^{\mathrm{opt}}_\mathrm{P}\sim \mathrm{P}$,其中$\mathrm{P}$是数字特罗特步骤的数量-超过这一点,剩余的能量误差射击对最大无序状态的值特性。我们提出了一个解析分析的conventionally不变的横向伊辛链的情况下,但我们的数值证据表明,这种情况是更普遍的,生存,例如,存在的障碍。

英文摘要:

We present a study of the digitized Quantum Annealing protocol proposed by R. Barends et al., Nature 534, 222 (2016). Our analysis, performed on the benchmark case of a transverse Ising chain problem, shows that the algorithm has a well defined optimal working point for the annealing time $τ^{\mathrm{opt}}_\mathrm{P}$ --- scaling as $τ^{\mathrm{opt}}_\mathrm{P}\sim \mathrm{P}$, where $\mathrm{P}$ is the number of digital Trotter steps --- beyond which, the residual energy error shoots-up towards the value characteristic of the maximally disordered state. We present an analytical analysis for the translationally invariant transverse Ising chain case, but our numerical evidence suggests that this scenario is more general, surviving, for instance, the presence of disorder.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑