GPU-accelerated algorithms for many-particle continuous-time quantum walks
From MaRDI portal
Publication:1739618
Abstract: 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.
Recommendations
- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- Quantum Monte Carlo on graphical processing units
- GPU: Accelerated Computation Routines for Quantum Trajectories Method
- Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU
- Fast quantum Monte Carlo on a GPU
Cites work
- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- A classical approach to the graph isomorphism problem using quantum walks
- A comparison of different propagation schemes for the time dependent Schrödinger equation
- Accelerating numerical solution of stochastic differential equations with CUDA
- Fast quantum Monte Carlo on a GPU
- General purpose molecular dynamics simulations fully implemented on graphics processing units
- GPU accelerated Monte Carlo simulation of Brownian motors dynamics with CUDA
- GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
- Numerical Methods for Ordinary Differential Equations
- Quantum correlations of identical particles subject to classical environmental noise
- Quantum Monte Carlo on graphical processing units
- Sailfish: a flexible multi-GPU implementation of the lattice Boltzmann method
- Solution of the Schrödinger equation by a spectral method
- TeraFLOP computing on a desktop PC with GPUs for 3D CFD
- The cold atom Hubbard toolbox
- Towards a generalised GPU/CPU shallow-flow modelling tool
- Universal computation by multiparticle quantum walk
- Visualizing quantum scattering on the CM-2 supercomputer
Cited in
(5)- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- Back and forth from Fock space to Hilbert space: a guide for commuters
- GPU: Accelerated Computation Routines for Quantum Trajectories Method
- Parallel time integration using batched BLAS (Basic Linear Algebra Subprograms) routines
- QWAK: quantum walk analysis kit
This page was built for publication: GPU-accelerated algorithms for many-particle continuous-time quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739618)
