Related Experiment Video
Updated: Feb 19, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Delayed Slater determinant update algorithms for high efficiency quantum Monte Carlo
T McDaniel1, E F D'Azevedo2, Y W Li3
1Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, Tennessee 37996, USA.
We developed a novel delayed update scheme for Quantum Monte Carlo simulations, significantly speeding up calculations for large systems. This method enhances computational efficiency without affecting statistical accuracy.
Area of Science:
- Computational Physics
- Quantum Chemistry
Background:
- Ab initio Quantum Monte Carlo (QMC) simulations are crucial for electronic structure calculations.
- The primary computational bottleneck in QMC for large systems is the repeated calculation of Slater determinants.
- Current methods often rely on iterative rank-1 updates, leading to cubic scaling.
Purpose of the Study:
- To introduce a more efficient numerical method for QMC simulations.
- To reduce the computational cost associated with determinant calculations in large quantum systems.
Main Methods:
- A novel multiple rank delayed update scheme is proposed.
- Accepted Monte Carlo moves are applied to matrices in batches after K steps.
- This enables the use of efficient matrix-matrix operations instead of matrix-vector operations.
Main Results:
- The new scheme significantly improves numerical efficiency, especially for large systems.
- Order of magnitude improvements in update time are achievable on CPUs and GPUs.
- The statistical efficiency of the Monte Carlo sampling remains unchanged.
Conclusions:
- The delayed update scheme offers a substantial speedup for QMC calculations.
- This method enhances computational performance without compromising simulation accuracy.
- It is particularly beneficial for diffusion Monte Carlo and high acceptance ratio algorithms.
Related Concept Videos
Fast Decoupled and DC Powerflow
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Ampere-Maxwell's Law: Problem-Solving
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of the...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
