GPU-accelerated algorithms for many-particle continuous-time quantum walks
arXiv:1612.00746 · doi:10.1016/j.cpc.2017.02.014
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.
26 pages, 7 figures, 43 references
References in corpus (18)
- Universal computation by quantum walk
- Spatial search by quantum walk
- Strong scaling of general-purpose molecular dynamics simulations on GPUs
- Repulsively bound atom pairs in an optical lattice
- Universal computation by multi-particle quantum walk
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Quantum Correlations in Two-Particle Anderson Localization
- Quantum Walk on a Line with Two Entangled Particles
- Two-particle states in the Hubbard model
- Classical approach to the graph isomorphism problem using quantum walks
- GPU accelerated Monte Carlo simulation of Brownian motors dynamics with CUDA
- Statistics-dependent quantum co-walking of two particles in one-dimensional lattices with nearest-neighbor interactions
- Non-Markovian continuous-time quantum walks on lattices with dynamical noise
- Quantum correlations in continuos-time quantum walks of two indistinguishable particles
- Noisy quantum walks of two indistinguishable interacting particles
- GPU-based acceleration of free energy calculations in solid state physics
- Quantum correlations of identical particles subject to classical environmental noise
- Quantum walks on embedded hypercubes: Nonsymmetric and nonlocal cases
Cited by in corpus (7)
- Quantum spatial search on graphs subject to dynamical noise
- Lattice quantum magnetometry
- Continuous-time quantum walks on dynamical percolation graphs
- Two bosonic quantum walkers in one-dimensional optical lattices
- Back and forth from Fock space to Hilbert space: a guide for commuters
- Two-level Quantum Walkers on Directed Graphs I: Universal Quantum Computing
- Two-particle quantum correlations in stochastically-coupled networks