期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Quantum Chemistry Based Computational Study on the Conformational Population of a Neodymium Neodecanoate Complex 被引量:2
1
作者 项曙光 王继叶 孙晓岩 《Chinese Journal of Structural Chemistry》 SCIE CAS CSCD 2016年第6期833-838,共6页
The title complex is widely used as an efficient key component of Ziegler-Natta catalyst for stereospecific polymerization of dienes to produce synthetic rubbers. However, the quantitative structure-activity relations... The title complex is widely used as an efficient key component of Ziegler-Natta catalyst for stereospecific polymerization of dienes to produce synthetic rubbers. However, the quantitative structure-activity relationship(QSAR) of this kind of complexes is still not clear mainly due to the difficulties to obtain their geometric molecular structures through laboratory experiments. An alternative solution is the quantum chemistry calculation in which the comformational population shall be determined. In this study, ten conformers of the title complex were obtained with the function of molecular dynamics conformational search in Gabedit 2.4.8, and their geometry optimization and thermodynamics calculation were made with a Sparkle/PM7 approach in MOPAC 2012. Their Gibbs free energies at 1 atm. and 298.15 K were calculated. Population of the conformers was further calculated out according to the theory of Boltzmann distribution, indicating that one of the ten conformers has a dominant population of 77.13%. 展开更多
关键词 conformational population neodymium neodecanoate complex quantum chemistry computation Boltzmann distribution
下载PDF
Distributed exact Grover’s algorithm
2
作者 Xu Zhou Daowen Qiu Le Luo 《Frontiers of physics》 SCIE CSCD 2023年第5期255-279,共25页
Distributed quantum computation has gained extensive attention.In this paper,we consider a search problem that includes only one target item in the unordered database.After that,we propose a distributed exact Grover’... Distributed quantum computation has gained extensive attention.In this paper,we consider a search problem that includes only one target item in the unordered database.After that,we propose a distributed exact Grover’s algorithm(DEGA),which decomposes the original search problem into■n/2■parts.Specifically,(i)our algorithm is as exact as the modified version of Grover’s algorithm by Long,which means the theoretical probability of finding the objective state is 100%;(ii)the actual depth of our circuit is 8(n mod 2)+9,which is less than the circuit depths of the original and modified Grover’s algorithms,1+8■π/4√2^(n)■and 9+8■π/4√2^(n)-1/2■,respectively.It only depends on the parity of n,and it is not deepened as n increases;(iii)we provide particular situations of the DEGA on MindQuantum(a quantum software)to demonstrate the practicality and validity of our method.Since our circuit is shallower,it will be more resistant to the depolarization channel noise. 展开更多
关键词 distributed quantum computation search problem distributed exact Grover’s algorithm(DEGA) Mindquantum the depolarization channel noise
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部