ElVibRot-MPI: parallel quantum dynamics with Smolyak algorithm for general molecular simulation

• URL: http://arxiv.org/abs/2111.13655v2
• Date: Fri, 3 Dec 2021 16:05:42 GMT
• Title: ElVibRot-MPI: parallel quantum dynamics with Smolyak algorithm for general molecular simulation
• Authors: Ahai Chen, Andr\'e Nauts, David Lauvergnat
• Abstract summary: A parallelized quantum dynamics package using the Smolyak algorithm for general molecular simulation is introduced. The program has no limitation of the Hamiltonian form and provides high flexibility on the simulation setup to adapt to different problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A parallelized quantum dynamics package using the Smolyak algorithm for general molecular simulation is introduced in this work. The program has no limitation of the Hamiltonian form and provides high flexibility on the simulation setup to adapt to different problems. Taking advantage of the Smolyak sparse grids formula, the simulation could be performed with high accuracy, and in the meantime, impressive parallel efficiency. The capability of the simulation could be up to tens of degrees of freedom. The implementation of the algorithm and the package usage are introduced, followed by typical examples and code test results.

Related papers

• GauSim: Registering Elastic Objects into Digital World by Gaussian Simulator [55.02281855589641]
  GauSim is a novel neural network-based simulator designed to capture the dynamic behaviors of real-world elastic objects represented through Gaussian kernels. We leverage continuum mechanics, modeling each kernel as a continuous piece of matter to account for realistic deformations without idealized assumptions. GauSim incorporates explicit physics constraints, such as mass and momentum conservation, ensuring interpretable results and robust, physically plausible simulations.
  arXiv  Detail & Related papers  (2024-12-23T18:58:17Z)
• Parallel simulation for sampling under isoperimetry and score-based diffusion models [56.39904484784127]
  As data size grows, reducing the iteration cost becomes an important goal. Inspired by the success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Our work highlights the potential advantages of simulation methods in scientific computation for dynamics-based sampling and diffusion models.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Efficient Quantum Lattice Gas Automata [0.0]
  The algorithm is composed of three main steps: collision, mapping, and propagation. Despite the impact of noise, our findings indicate that accurate simulations could be achieved already on current noisy devices.
  arXiv  Detail & Related papers  (2024-02-26T11:12:35Z)
• Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost [8.181184006712785]
  We propose a simple method for simulating a general class of non-unitary dynamics as a linear combination of Hamiltonian simulation problems. We also demonstrate an application for open quantum dynamics simulation using the complex absorbing potential method with near-optimal dependence on all parameters.
  arXiv  Detail & Related papers  (2023-03-02T07:37:54Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Simulating Hamiltonian dynamics in a programmable photonic quantum processor using linear combinations of unitary operations [4.353492002036882]
  We modify the multi-product Trotterization and combine it with the oblivious amplitude amplification to simultaneously reach a high simulation precision and high success probability. We experimentally implement the modified multi-product algorithm in an integrated-photonics programmable quantum simulator in silicon.
  arXiv  Detail & Related papers  (2022-11-12T18:49:41Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• Realistic simulation of quantum computation using unitary and measurement channels [1.406995367117218]
  We introduce a new simulation approach that relies on approximating the density matrix evolution by a sum of unitary and measurement channels. This model shows an improvement of at least one order of magnitude in terms of accuracy compared to the best known approaches.
  arXiv  Detail & Related papers  (2020-05-13T14:29:18Z)

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.