期刊
JOURNAL OF CHEMICAL PHYSICS
卷 133, 期 19, 页码 -出版社
AMER INST PHYSICS
DOI: 10.1063/1.3503767
关键词
-
资金
- Grant Agency of the Czech Republic-GACR [203/08/0626]
- Grant Agency of the Charles University-GAUK [114310]
Quantum computers are appealing for their ability to solve some tasks much faster than their classical counterparts. It was shown in [Aspuru-Guzik et al., Science 309, 1704 (2005)] that they, if available, would be able to perform the full configuration interaction (FCI) energy calculations with a polynomial scaling. This is in contrast to conventional computers where FCI scales exponentially. We have developed a code for simulation of quantum computers and implemented our version of the quantum FCI algorithm. We provide a detailed description of this algorithm and the results of the assessment of its performance on the four lowest lying electronic states of CH2 molecule. This molecule was chosen as a benchmark, since its two lowest lying (1)A(1) states exhibit a multireference character at the equilibrium geometry. It has been shown that with a suitably chosen initial state of the quantum register, one is able to achieve the probability amplification regime of the iterative phase estimation algorithm even in this case. (C) 2010 American Institute of Physics. [doi:10.1063/1.3503767]
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据