English
Related papers

Related papers: Linear-scaling and parallelizable algorithms for s…

200 papers

Mathematical modeling and simulation is a promising approach to personalized cancer medicine. Yet, the complexity, heterogeneity and multi-scale nature of cancer pose significant computational challenges. Coupling discrete cell-based models…

Quantitative Methods · Quantitative Biology 2021-11-23 Xiaoran Lai , Håkon A. Taskén , Torgeir Mo , Simon W. Funke , Arnoldo Frigessi , Marie E. Rognes , Alvaro Köhn-Luque

We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…

Quantum Physics · Physics 2020-09-09 Zhiyong Zhang

Finding the ground state of a fermionic Hamiltonian using quantum Monte Carlo is a very difficult problem, due to the Fermi sign problem. While still scaling exponentially, full configuration-interaction Monte Carlo (FCI-QMC) mitigates some…

Computational Physics · Physics 2013-12-17 Michael H. Kolodrubetz , Bryan K. Clark

An efficient parallelization approach to simulate optical properties of ensembles of quantum emitters in realistic electromagnetic environments is considered. It relies on balancing computing load of utilized processors and is built into…

Computational Physics · Physics 2023-02-01 Maxim Sukharev

Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schr\"odinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making…

Chemical Physics · Physics 2025-08-19 Kousuke Nakano , Sandro Sorella , Michele Casula

Nonlinear non-Gaussian state-space models arise in numerous applications in statistics and signal processing. In this context, one of the most successful and popular approximation techniques is the Sequential Monte Carlo (SMC) algorithm,…

Computation · Statistics 2016-04-20 Francois Septier , Gareth W. Peters

Massively parallel desktop computing capabilities now well within the reach of individual academics modify the environment for posterior simulation in fundamental and potentially quite advantageous ways. But to fully exploit these benefits…

Computation · Statistics 2013-04-17 Garland Durham , John Geweke

An adaptation of the full configuration interaction quantum Monte Carlo (FCIQMC) method is presented, for correlated electron problems containing heavy elements and the presence of significant relativistic effects. The modified algorithm…

Chemical Physics · Physics 2020-10-26 Robert J. Anderson , George H. Booth

We propose a hybrid deterministic and stochastic approach to achieve extended time scales in atomistic simulations that combines the strengths of molecular dynamics (MD) and Monte Carlo (MC) simulations in an easy-to-implement way. The…

Materials Science · Physics 2011-10-18 Pratyush Tiwary , Axel van de Walle

We develop a novel parallel resampling algorithm for fully parallelized particle filters, which is designed with GPUs (graphics processing units) or similar parallel computing devices in mind. With our new algorithm, a full cycle of…

Computation · Statistics 2016-08-17 Kenichiro McAlinn , Teruo Nakatsuma

Applying quantum chemistry algorithms to large-scale systems requires substantial computational resources scaled with the system size and the desired accuracy. To address this, ByteQC, a fully-functional and efficient package for…

Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion…

Other Condensed Matter · Physics 2010-08-16 Michal Bajdich , Lubos Mitas

Comprehensive simulations of the entire biochemistry of cells have great potential to help physicians treat disease and help engineers design biological machines. But such simulations must model networks of millions of molecular species and…

Molecular Networks · Quantitative Biology 2020-05-22 Arthur P. Goldberg , David R. Jefferson , John A. P. Sekar , Jonathan R. Karr

Significant progress in the development of efficient and fast algorithms for quantum chemical calculations has been made in the past two decades. The main focus has always been the desire to be able to treat ever larger molecules or…

Chemical Physics · Physics 2012-12-18 Moritz P. Haag , Markus Reiher

Solving quantum molecular systems presents a significant challenge for classical computation. The advent of early fault-tolerant quantum computing (EFTQC) devices offers a promising avenue to address these challenges, leveraging advanced…

Quantum Physics · Physics 2025-11-10 Yukun Zhang , Xiaoming Zhang , Jinzhao Sun , Heng Lin , Yifei Huang , Dingshun Lv , Xiao Yuan

Quantum Monte Carlo (QMC) methods deliver highly accurate electronic structure calculations but are computationally intensive. The quantum Monte Carlo kernel library (QMCkl) provides a modular, portable collection of high-performance…

We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation…

AI infrastructures, predominantly GPUs, have delivered remarkable performance gains for deep learning. Conversely, scientific computing, exemplified by quantum chemistry systems, suffers from dynamic diversity, where computational patterns…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-24 Tuowei Wang , Kun Li , Donglin Bai , Fusong Ju , Leo Xia , Ting Cao , Ju Ren , Yaoxue Zhang , Mao Yang

The auxiliary-field quantum Monte Carlo (AFQMC) method is a general numerical method for correlated many-electron systems, which is being increasingly applied in lattice models, atoms, molecules, and solids. Here we introduce the theory and…

Computational Physics · Physics 2021-02-24 Hao Shi , Shiwei Zhang

Sequential Monte Carlo algorithms (also known as particle filters) are popular methods to approximate filtering (and related) distributions of state-space models. However, they converge at the slow $1/\sqrt{N}$ rate, which may be an issue…

Computation · Statistics 2015-03-06 Nicolas Chopin , Mathieu Gerber
‹ Prev 1 4 5 6 7 8 10 Next ›