A Python GPU-accelerated solver for the Gross-Pitaevskii equation and applications to many-body cavity QED

• URL: http://arxiv.org/abs/2404.14401v3
• Date: Sun, 1 Sep 2024 12:32:03 GMT
• Title: A Python GPU-accelerated solver for the Gross-Pitaevskii equation and applications to many-body cavity QED
• Authors: Lorenzo Fioroni, Luca Gravina, Justyna Stefaniak, Alexander Baumgärtner, Fabian Finger, Davide Dreon, Tobias Donner,
• Abstract summary: TorchGPE is a general-purpose Python package developed for solving the Gross-Pitaevskii equation (GPE) This solver is designed to integrate wave functions across a spectrum of linear and non-linear potentials.
• Score: 36.136619420474766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: TorchGPE is a general-purpose Python package developed for solving the Gross-Pitaevskii equation (GPE). This solver is designed to integrate wave functions across a spectrum of linear and non-linear potentials. A distinctive aspect of TorchGPE is its modular approach, which allows the incorporation of arbitrary self-consistent and time-dependent potentials, e.g., those relevant in many-body cavity QED models. The package employs a symmetric split-step Fourier propagation method, effective in both real and imaginary time. In our work, we demonstrate a significant improvement in computational efficiency by leveraging GPU computing capabilities. With the integration of the latter technology, TorchGPE achieves a substantial speed-up with respect to conventional CPU-based methods, greatly expanding the scope and potential of research in this field.

Related papers

• HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch [0.0]
  We introduce HOBOTAN, a new solver designed for Higher Order Binary Optimization (HOBO) HOBOTAN supports both CPU and GPU, with the GPU version developed based on PyTorch, offering a fast and scalable system. This paper details the design, implementation, performance evaluation, and scalability of HOBOTAN, demonstrating its effectiveness.
  arXiv  Detail & Related papers  (2024-07-29T13:20:11Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing [0.0]
  Hiperwalk is designed to facilitate the simulation of quantum walks using heterogeneous high-performance computing. This package enables the simulation of both the continuous-time and discrete-time quantum walk models.
  arXiv  Detail & Related papers  (2024-06-12T13:17:05Z)
• Enhancing GPU-acceleration in the Python-based Simulations of Chemistry Framework [6.4347138500286665]
  We describe our contribution as industrial stakeholders to the existing open-source GPU4PySCF project. We have integrated GPU acceleration into other PySCF functionality including Density Functional Theory (DFT) GPU4PySCF delivers 30 times speedup over a 32-core CPU node, resulting in approximately 90% cost savings for most DFT tasks.
  arXiv  Detail & Related papers  (2024-04-15T04:35:09Z)
• Light Schrödinger Bridge [72.88707358656869]
  We develop a lightweight, simulation-free and theoretically justified Schr"odinger Bridges solver. Our light solver resembles the Gaussian mixture model which is widely used for density estimation. Inspired by this similarity, we also prove an important theoretical result showing that our light solver is a universal approximator of SBs.
  arXiv  Detail & Related papers  (2023-10-02T13:06:45Z)
• Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond [6.1003703380200545]
  We propose a circuit approximation technique that enhances the arithmetic subroutines in the HHL. We show how these types of circuits can be reduced in depth by providing a simple and powerful approximation technique.
  arXiv  Detail & Related papers  (2023-06-08T08:22:41Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic [72.35307086274912]
  High-dimension parameter model and large-scale mathematical calculation restrict execution efficiency, especially for Internet of Things (IoT) devices. We propose a new Deep Reinforcement Learning (DRL)-Soft Actor Critic for discrete (SAC-d), which generates the emphexit point, emphexit point, and emphcompressing bits by soft policy iterations. Based on the latency and accuracy aware reward design, such an computation can well adapt to the complex environment like dynamic wireless channel and arbitrary processing, and is capable of supporting the 5G URL
  arXiv  Detail & Related papers  (2022-01-09T09:31:50Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Parallel time integration using Batched BLAS (Basic Linear Algebra Subprograms) routines [0.0]
  We present an approach for integrating the time evolution of quantum systems. We leverage the computation power of graphics processing units (GPUs) to perform the integration of all time steps in parallel.
  arXiv  Detail & Related papers  (2021-08-16T14:49:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.