arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.14680quant-phnucl-th
收藏

中子-核动力学模拟用于量子计算机

Neutron-nucleus dynamics simulations for quantum computers

Cornell University(康奈尔大学);Louisiana State University(路易斯安那州立大学)

Soorya Rethinasamy, Ethan Guo, Alexander Wei, Mark M. Wilde, Kristina D. Launey

AI总结:

本文提出一种新的量子算法,用于中子-核模拟,即使在噪声存在下也能获得稳定的束缚态能量,通过噪声容忍训练方法,适用于各种势能,并讨论了不同量子比特编码方案的效率及改进的算法性能。

摘要:

鉴于核结构和反应建模计算需求的指数增长,我们开发了一种新的量子算法,用于中子-核模拟,能够处理一般势能,并在噪声存在下提供可接受的束缚态能量,通过噪声容忍训练方法。特别是,该算法可以解决任何带状到完全的哈密顿矩阵,以适应一般中心势能。尽管我们展示了该方法用于指数高斯样势能和从头计算的簇间势能(光学势能),它也可以适应用于从头核计算的楚尔有效场论核-核势能的完整形式。在本研究中,我们对三种不同的量子比特编码方案(一热、二进制和格雷编码)的效率进行了全面分析,包括涉及的泡利字符串数量和交换集。我们还讨论了该算法对不同带状宽度的哈密顿量的优势,特别是对扰动性质的势能,导致量子模拟运行时间大幅减少。我们证明了格雷编码允许模型空间大小$N$的高效扩展,并且对于带状哈密顿量具有带宽高达$N$的情况更节省资源。我们引入了一种新的交换方案,称为距离分组交换(DGC),并将其性能与著名的量子比特交换(QC)方案进行比较。我们阐述了在DGC方案下的泡利字符串显式分组和对角化单位元,并证明其在成本更高的对角化单位元下优于QC方案。最后,我们提供了适合当前量子处理器的中子-α动力学的首次量子模拟解决方案。

英文摘要:

With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleus simulations with general potentials, which provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. In particular, the algorithm can now solve for any band-diagonal to full Hamiltonian matrices, as needed to accommodate a general central potential. While we illustrate the approach for exponential Gaussian-like potentials and ab initio inter-cluster potentials (optical potentials), it can also accommodate the complete form of the chiral effective-field-theory nucleon-nucleon potentials used in ab initio nuclear calculations. In this study, we provide a comprehensive analysis for the efficacy of this approach for three different qubit encodings, including the one-hot, binary, and Gray encodings, in terms of the number of Pauli strings and commuting sets involved. We also discuss the advantages of the algorithm for Hamiltonians of various band-diagonal widths, especially critical for potentials of perturbative nature, leading to a drastically reduced runtime of quantum simulations. We prove that the Gray encoding allows for an efficient scaling of the model-space size $N$ and is more resource efficient for band-diagonal Hamiltonians having bandwidth up to $N$. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity (QC) scheme. We lay out the explicit grouping of Pauli strings and the diagonalizing unitary under the DGC scheme, and we prove that it outperforms the QC scheme, at the cost of a more complex diagonalizing unitary. Lastly, we provide first solutions of the neutron-alpha dynamics from quantum simulations suitable for current quantum processors.

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

↑