Skip to content

Performance Benchmarking: Software for the Density Matrix Renormalization Group

Jul 2026 · arXiv.org · Vol abs/2607.28369 · 0 citations · 84 references
Computer Science Physics

TL;DR

This work presents a performance-oriented benchmarking framework to facilitate meaningful comparisons of DMRG implementations, and applies it to quantify the performance of eight implementations, highlighting similarities and differences among them.

Abstract

The performance of scientific software often determines the scale of problems that can be solved in practice. As multiple implementations of the same algorithm emerge, systematic evaluation is needed to compare their strengths and limitations. The density matrix renormalization group (DMRG) algorithm, widely used to study quantum systems, has over 50 software implementations. These implementations vary in multiple aspects that can strongly affect performance. However, despite the need, performance evaluations of these implementations are scarce and lack a consistent standard; many existing evaluations are either too incomplete to enable meaningful comparisons or focus on objectives other than direct performance comparisons, thereby limiting understanding of how the implementations compare. Here, we present a performance-oriented benchmarking framework to facilitate meaningful comparisons of DMRG implementations, and we apply it to quantify the performance of eight implementations, highlighting similarities and differences among them. Furthermore, we examine multiple parameter settings, optimization strategies, and implementation-specific features to demonstrate how parameter configuration can affect performance and how systematic evaluation can reveal non-obvious trade-offs. The results show significant performance differences, up to two orders of magnitude in some cases, not only between different implementations when aligning parameters, but also within the same implementation when comparing different parameter configurations. Hence, our results demonstrate the significant value and insight that can be gained from conducting rigorous performance evaluations. Using our results and framework as a starting point, more rigorous benchmarking will ultimately help users and developers make informed decisions and support future development efforts to build better, more efficient software.

View source

Similar papers

Preprint Oct 2026

Lifting Multiplicity in Randomized Benchmarking

Randomized benchmarking comprises a suite of standard techniques for assessing the operational fidelity of quantum processors. These techniques can be reliably applied to groups with process matrix representations that are free of multiplicity. However, many groups that are naturally formed from native gates do have mu...

Ya-Le Fan, J. Marceaux · 0 citations
Open access Apr 2026

Improving the accuracy of fixed-node diffusion Monte Carlo for non-covalent interactions.

Diffusion quantum Monte Carlo (DMC) and coupled cluster theory [CCSD(T)] are widely used benchmark methods for noncovalent interactions (NCIs). However, recent studies have reported notable discrepancies for several hydrogen-bonded and dispersion-dominated systems, raising questions about the accuracy of the approximat...

Kousuke Nakano, B. X. Shi, D. Alfé et al. · 1 citation
Open access Aug 2026

PyFock: A Just-In-Time Compiled Gaussian Basis DFT Python Code for CPU and GPU Architectures.

Despite the robust ecosystem, ease of use, and flexibility offered by Python, most of the current popular quantum chemistry codes are still developed in Fortran, C, or C++, due to their speed advantage over Python. Furthermore, the tedious compilation process acts as a barrier for many aspiring beginners. PySCF and Psi...

Manas Sharma, Marek Sierka · 1 citation
Preprint Sep 2026

Performance of a minimally empirical local-hybrid density functional for molecular chemistry

Delocalisation error has been argued to be the greatest outstanding challenge in density-functional theory (DFT). One of the most promising routes to minimise this error is development of local hybrid functionals, in which the fraction of exact-exchange mixing is position dependent. However, existing local hybrids capa...

Erin R. Johnson, K. R. Bryenton · 0 citations
Preprint Sep 2026

Recent benchmarks in the Analysis Grand Challenge and integration with Combine (and HS3)

The Analysis Grand Challenge (AGC) showcases an example of HEP analysis. Its reference implementation uses modern Python packages to realize the main steps, from data access to statistical model building and fitting. The packages used for data handling and processing (coffea, uproot, awkward-array) have recently underg...

P. Fackeldey, Massimiliano Galli, Hannah Havel et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.