多粒子连续时间量子行走的GPU加速算法
GPU-accelerated algorithms for many-particle continuous-time quantum walks
摘要:
多粒子连续时间量子漫步(CTQWs)代表了量子技术中几个任务的资源,包括量子搜索算法和通用量子计算。为了在现实的场景中设计和实现CTQW,人们需要有效的哈密顿模拟工具,考虑静态噪声和晶格中的波动,即包含随机项的哈密顿。为此,我们提出了一个并行算法的基础上的泰勒级数展开的演化算子,并比较其性能与算法的基础上的精确对角化的哈密顿量或4阶龙格库塔积分。我们证明了泰勒级数展开和龙格库塔算法都是可靠的,并具有较低的计算成本,泰勒级数展开显示出额外的优势,内存分配不依赖于计算的精度。这两种算法在SIMT范式中也是高度可并行的,因此适合于GPGPU计算。反过来,我们对4个NVIDIA GPU和3个四核Intel CPU进行了基准测试,用于增加维度的格子上的2粒子系统,表明GPU计算提供的加速比,相对于OPENMP并行化,取决于后处理的频率,在8倍和(超过)20倍之间。因此,GPU加速代码允许人们克服对执行时间的担忧,并使在大晶格上使用许多相互作用的粒子进行模拟成为可能,而设备上可用的内存只有一个限制。
英文摘要:
Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic scenario, one needs effective simulation tools for Hamiltonians that take into account static noise and fluctuations in the lattice, i.e. Hamiltonians containing stochastic terms. To this aim, we suggest a parallel algorithm based on the Taylor series expansion of the evolution operator, and compare its performances with those of algorithms based on the exact diagonalization of the Hamiltonian or a 4-th order Runge-Kutta integration. We prove that both Taylor-series expansion and Runge-Kutta algorithms are reliable and have a low computational cost, the Taylor-series expansion showing the additional advantage of a memory allocation not depending on the precision of calculation. Both algorithms are also highly parallelizable within the SIMT paradigm, and are thus suitable for GPGPU computing. In turn, we have benchmarked 4 NVIDIA GPUs and 3 quad-core Intel CPUs for a 2-particle system over lattices of increasing dimension, showing that the speedup providend by GPU computing, with respect to the OPENMP parallelization, lies in the range between 8x and (more than) 20x, depending on the frequency of post-processing. GPU-accelerated codes thus allow one to overcome concerns about the execution time, and make it possible simulations with many interacting particles on large lattices, with the only limit of the memory available on the device.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。