Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0311591 · Physical Review Letters

Density Matrix Perturbation Theory

Anders M. N. Niklasson, Matt Challacombe

Published May 14, 2004• 77 citations
arXivHTMLPDF

Abstract

An orbital-free quantum perturbation theory is proposed. It gives the response of the density matrix upon variation of the Hamiltonian by quadratically convergent recursions based on perturbed projections. The technique allows treatment of embedded quantum subsystems with a computational cost scaling linearly with the size of the perturbed region, O(N(pert.)), and as O(1) with the total system size. The method allows efficient high order perturbation expansions, as demonstrated with an example involving a 10th order expansion. Density matrix analogs of Wigner's 2n+1 rule are also presented.

DOI
10.1103/physrevlett.92.193001

Related papers

Susceptibility formulation of density matrix perturbation theory

Anders M. N. Niklasson, Adela Habib, Joshua Finkelstein +1 more

Density matrix perturbation theory based on recursive Fermi-operator expansions provides a computationally efficient framework for time-independent response calculations in quantum chemistry and materials science. From a perturbation in the Hamiltonian, we can calculate the first-order perturbation in the density matrix, which then gives us the linear response in the expectation values for some chosen set of observables. We present an alternative, dual formulation, where we instead calculate the static susceptibility of an observable, which then gives us the linear response in the expectation values for any number of different Hamiltonian perturbations. We show how the calculation of the susceptibility can be performed with the same expansion schemes used in recursive density matrix perturbation theory, including generalizations to fractional occupation numbers and self-consistent linear response calculations, i.e., similar to density functional perturbation theory. As with recursive density matrix perturbation theory, the dual susceptibility formulation is well suited for numerically thresholded sparse matrix algebra, which has linear scaling complexity for sufficiently large sparse systems. Similarly, the recursive computation of the susceptibility also seamlessly integrates with the computational framework of deep neural networks used in artificial intelligence (AI) applications. This integration enables the calculation of quantum response properties that can leverage cutting-edge AI-hardware, such as NVIDIA Tensor Cores or Google Tensor Processing Units. We demonstrate performance for recursive susceptibility calculations using NVIDIA Graphics Processing Units and Tensor Cores.

arXiv:2409.17033•The Journal of Chemical Physics•Dec 16, 2024•0 citations

Notes on density matrix perturbation theory

Lionel A. Truflandier, Rivo M. Dianzinga, David R. Bowler

Density matrix perturbation theory (DMPT) is known as a promising alternative to the Rayleigh-Schrödinger perturbation theory, in which the sum-over-states (SOS) is replaced by algorithms with perturbed density matrices as the input variables. In this article, we formulate and discuss three types of DMPT, with two of them based only on density matrices: the approach of Kussmann and Ochsenfeld [J. Chem. Phys. 127, 054103 (2007)] is reformulated via the Sylvester equation and the recursive DMPT of Niklasson and Challacombe [Phys. Rev. Lett. 92, 193001 (2004)] is extended to the hole-particle canonical purification (HPCP) from Truflandier et al. [J. Chem. Phys. 144, 091102 (2016)]. A comparison of the computational performances shows that the aforementioned methods outperform the standard SOS. The HPCP-DMPT demonstrates stable convergence profiles but at a higher computational cost when compared to the original recursive polynomial method.

arXiv:2007.04739•The Journal of Chemical Physics•Oct 23, 2020•6 citations

Quantum Perturbation Theory Using Tensor Cores and a Deep Neural Network

Joshua Finkelstein, Emanuel H. Rubensson, Susan M. Mniszewski +2 more

Time-independent quantum response calculations are performed using Tensor cores. This is achieved by mapping density matrix perturbation theory onto the computational structure of a deep neural network. The main computational cost of each deep layer is dominated by tensor contractions, i.e., dense matrix-matrix multiplications, in mixed-precision arithmetics, which achieves close to peak performance. Quantum response calculations are demonstrated and analyzed using self-consistent charge density-functional tight-binding theory as well as coupled-perturbed Hartree-Fock theory. For linear response calculations, a novel parameter-free convergence criterion is presented that is well-suited for numerically noisy low-precision floating point operations and we demonstrate a peak performance of almost 200 Tflops using the Tensor cores of two Nvidia A100 GPUs.

arXiv:2203.09621•Journal of Chemical Theory and Computation•Jun 7, 2022•17 citations

Infinite-Order Perturbation Theory for Finite Systems

C. Alton Coulter

A perturbation theory is described which leads to two alternative methods for calculating the eigenvalues and normalized eigenstates of a perturbed Hamiltonian, the results being given to all orders in the perturbation. The expansions obtained are formulated in terms of two sets of partial sums which have simple, easily characterized forms, and they combine some of the advantages of both the Rayleigh-Schr\"odinger and Brillouin-Wigner perturbation methods while avoiding some of the difficulties of each. In particular, one form of the perturbation expansions given here will in most cases of interest have a larger radius of convergence than the Rayleigh-Schr\"odinger series. As is usual for infinite-order treatments, the explicit form of the final result applies only to nondegenerate levels. However, some of the intermediate relations obtained in the derivation are of general validity. Since certain classes of unlinked diagrams appear in the expansions, the method described here is not suitable for application to systems containing a large number of particles.

Physical Review•May 25, 1967•0 citations

New Developments in Time-Independent Quantum-Mechanical Perturbation Theory

Gerald I. Kerley

This report discusses two new ideas for using perturbation methods to solve the time-independent Schrödinger equation. The first concept begins with rewriting the perturbation equations in a form that is closely related to matrix diagonalization methods. That allows a simple, compact derivation of the standard (Rayleigh-Schrödinger) equations. But it also leads to a new iterative solution method that is not based on the usual power series expansion. The iterative method can also be used when the unperturbed system is two-fold degenerate. The second concept is quite different from the first but compatible with it. It is based on the fact that one can replace the true Hamiltonian with a synthetic Hamiltonian having the same eigenvalues. This approach allows one to cancel part of the perturbation and to reduce the size of the off-diagonal matrix elements, giving better convergence of the series. These methods are illustrated by application to three perturbed harmonic oscillator problems--a 1-D oscillator with a linear perturbation, a 1-D oscillator with a quartic perturbation, and a perturbed 2-D oscillator, which involves degenerate states. The iterative method and the synthetic Hamiltonian method are shown to give significantly better results than the standard method.

arXiv:1306.6912•Jun 24, 2013•0 citations

Toward a QUBO-Based Density Matrix Electronic Structure Method

Christian F. A. Negre, Alejandro López‐Bezanilla, Yu Zhang +4 more

Density matrix electronic structure theory is used in many quantum chemistry methods to "alleviate" the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree-Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave's new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. We also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.

arXiv:2201.04720•Journal of Chemical Theory and Computation•Jun 3, 2022•8 citations
An orbital-free quantum perturbation theory is proposed. It gives the response of the density matrix upon variation of the Hamiltonian by quadratically convergent recursions based on perturbed projections. The technique allows treatment of embedded quantum subsystems with a computational cost scaling linearly with the size of the perturbed region, O(N(pert.)), and as O(1) with the total system size. The method allows efficient high order perturbation expansions, as demonstrated with an example involving a 10th order expansion. Density matrix analogs of Wigner's 2n+1 rule are also presented.
Density matrix perturbation theory based on recursive Fermi-operator expansions provides a computationally efficient framework for time-independent response calculations in quantum chemistry and materials science. From a perturbation in the Hamiltonian, we can calculate the first-order perturbation in the density matrix, which then gives us the linear response in the expectation values for some chosen set of observables. We present an alternative, dual formulation, where we instead calculate the static susceptibility of an observable, which then gives us the linear response in the expectation values for any number of different Hamiltonian perturbations. We show how the calculation of the susceptibility can be performed with the same expansion schemes used in recursive density matrix perturbation theory, including generalizations to fractional occupation numbers and self-consistent linear response calculations, i.e., similar to density functional perturbation theory. As with recursive density matrix perturbation theory, the dual susceptibility formulation is well suited for numerically thresholded sparse matrix algebra, which has linear scaling complexity for sufficiently large sparse systems. Similarly, the recursive computation of the susceptibility also seamlessly integrates with the computational framework of deep neural networks used in artificial intelligence (AI) applications. This integration enables the calculation of quantum response properties that can leverage cutting-edge AI-hardware, such as NVIDIA Tensor Cores or Google Tensor Processing Units. We demonstrate performance for recursive susceptibility calculations using NVIDIA Graphics Processing Units and Tensor Cores.
Density matrix perturbation theory (DMPT) is known as a promising alternative to the Rayleigh-Schrödinger perturbation theory, in which the sum-over-states (SOS) is replaced by algorithms with perturbed density matrices as the input variables. In this article, we formulate and discuss three types of DMPT, with two of them based only on density matrices: the approach of Kussmann and Ochsenfeld [J. Chem. Phys. 127, 054103 (2007)] is reformulated via the Sylvester equation and the recursive DMPT of Niklasson and Challacombe [Phys. Rev. Lett. 92, 193001 (2004)] is extended to the hole-particle canonical purification (HPCP) from Truflandier et al. [J. Chem. Phys. 144, 091102 (2016)]. A comparison of the computational performances shows that the aforementioned methods outperform the standard SOS. The HPCP-DMPT demonstrates stable convergence profiles but at a higher computational cost when compared to the original recursive polynomial method.
Time-independent quantum response calculations are performed using Tensor cores. This is achieved by mapping density matrix perturbation theory onto the computational structure of a deep neural network. The main computational cost of each deep layer is dominated by tensor contractions, i.e., dense matrix-matrix multiplications, in mixed-precision arithmetics, which achieves close to peak performance. Quantum response calculations are demonstrated and analyzed using self-consistent charge density-functional tight-binding theory as well as coupled-perturbed Hartree-Fock theory. For linear response calculations, a novel parameter-free convergence criterion is presented that is well-suited for numerically noisy low-precision floating point operations and we demonstrate a peak performance of almost 200 Tflops using the Tensor cores of two Nvidia A100 GPUs.
A perturbation theory is described which leads to two alternative methods for calculating the eigenvalues and normalized eigenstates of a perturbed Hamiltonian, the results being given to all orders in the perturbation. The expansions obtained are formulated in terms of two sets of partial sums which have simple, easily characterized forms, and they combine some of the advantages of both the Rayleigh-Schr\"odinger and Brillouin-Wigner perturbation methods while avoiding some of the difficulties of each. In particular, one form of the perturbation expansions given here will in most cases of interest have a larger radius of convergence than the Rayleigh-Schr\"odinger series. As is usual for infinite-order treatments, the explicit form of the final result applies only to nondegenerate levels. However, some of the intermediate relations obtained in the derivation are of general validity. Since certain classes of unlinked diagrams appear in the expansions, the method described here is not suitable for application to systems containing a large number of particles.
This report discusses two new ideas for using perturbation methods to solve the time-independent Schrödinger equation. The first concept begins with rewriting the perturbation equations in a form that is closely related to matrix diagonalization methods. That allows a simple, compact derivation of the standard (Rayleigh-Schrödinger) equations. But it also leads to a new iterative solution method that is not based on the usual power series expansion. The iterative method can also be used when the unperturbed system is two-fold degenerate. The second concept is quite different from the first but compatible with it. It is based on the fact that one can replace the true Hamiltonian with a synthetic Hamiltonian having the same eigenvalues. This approach allows one to cancel part of the perturbation and to reduce the size of the off-diagonal matrix elements, giving better convergence of the series. These methods are illustrated by application to three perturbed harmonic oscillator problems--a 1-D oscillator with a linear perturbation, a 1-D oscillator with a quartic perturbation, and a perturbed 2-D oscillator, which involves degenerate states. The iterative method and the synthetic Hamiltonian method are shown to give significantly better results than the standard method.
Density matrix electronic structure theory is used in many quantum chemistry methods to "alleviate" the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree-Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave's new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. We also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.