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:1701.01568

Linear-scaling electronic structure theory: Electronic temperature in the Kernel Polynomial Method

Eunan J. McEniry, Ralf Drautz

Published Jan 6, 2017• 0 citations
arXivHTMLPDF

Abstract

Linear-scaling electronic structure methods based on the calculation of moments of the underlying electronic Hamiltonian offer a computationally efficient and numerically robust scheme to drive large-scale atomistic simulations, in which the quantum-mechanical nature of the electrons is explicitly taken into account. We compare the kernel polynomial method to the Fermi operator expansion method and establish a formal connection between the two approaches. We show that the convolution of the kernel polynomial method may be understood as an effective electron temperature. The results of a number of possible kernels are formally examined, and then applied to a representative tight-binding model.

DOI
10.48550/arxiv.1701.01568

Related papers

The kernel polynomial method

Alexander Weiße, Gerhard Wellein, Andreas Alvermann +1 more

Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed-matter physics. In this paper basic properties and recent developments of Chebyshev expansion based algorithms and the kernel polynomial method are reviewed. Characterized by a resource consumption that scales linearly with the problem dimension these methods enjoyed growing popularity over the last decade and found broad application not only in physics. Representative examples from the fields of disordered systems, strongly correlated electrons, electron-phonon interaction, and quantum spin systems are discussed in detail. In addition, an illustration on how the kernel polynomial method is successfully embedded into other numerical techniques, such as cluster perturbation theory or Monte Carlo simulation, is provided.

arXiv:cond-mat/0504627•Reviews of Modern Physics•Mar 24, 2006•1,038 citations

Hybrid kernel polynomial method

Muhammad Irfan, Sathish R. Kuppuswamy, Dániel Varjas +4 more

The kernel polynomial method allows to sample overall spectral properties of a quantum system, while sparse diagonalization provides accurate information about a few important states. We present a method combining these two approaches without loss of performance or accuracy. We apply this hybrid kernel polynomial method to improve the computation of thermodynamic quantities and the construction of perturbative effective models, in a regime where neither of the methods is sufficient on its own. To achieve this we develop a perturbative kernel polynomial method to compute arbitrary order series expansions of expectation values. We demonstrate the efficiency of our approach on three examples: the calculation of supercurrent and inductance in a Josephson junction, the interaction of spin qubits defined in a two dimensional electron gas, and the calculation of the effective band structure in a realistic model of a semiconductor nanowire.

arXiv:1909.09649•Sep 20, 2019•1 citation

Efficient maximum entropy algorithms for electronic structure

Richard N. Silver, H. Roeder, Arthur F. Voter +1 more

Two Chebyshev recursion methods are presented for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). If limited statistical accuracy and energy resolution are acceptable, they provide linear scaling methods for the calculation of physical properties involving large numbers of eigenstates such as densities of states, spectral functions, thermodynamics, total energies for Monte Carlo simulations and forces for molecular dynamics. KPM provides a uniform approximation to a DOS, with resolution inversely proportional to the number of Chebyshev moments, while MEM can achieve significantly higher, but non-uniform, resolution at the risk of possible artifacts. This paper emphasizes efficient algorithms.

IEEE International Conference on High Performance Computing, Data, and Analytics•Apr 1, 1996•0 citations

Implicit purification for temperature-dependent density matrices

Anders M. N. Niklasson

An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi-Dirac operator expansion in terms of the Hamiltonian. The computational complexity is shown to scale with the logarithm of the polynomial order of the expansion, or equivalently, with the logarithm of the inverse temperature. The system of linear equations that arise in each implicit purification iteration is solved efficiently by a conjugate gradient solver. The scheme is particularly useful in connection with linear scaling electronic structure theory based on sparse matrix algebra. The efficiency of the implicit temperature expansion technique is analyzed and compared to some explicit purification methods for the zero temperature density matrix.

arXiv:cond-mat/0311469•Physical review. B, Condensed matter•Dec 30, 2003•39 citations

Energy renormalization-group method for electronic structure of large systems

Roi Baer, Martin Head‐Gordon

A renormalization-group method for electronic structure of large systems within a tight-binding framework is presented. A telescopic series of nested Hilbert spaces is constructed, having exponentially decreasing dimensions and electrons. The Hamiltonian matrices have exponentially converging energy ranges focusing to the Fermi level. The computational effort scales near linearly with system size even when the density matrix is highly nonlocal. This is illustrated by calculations on a model metal and a metallic finite carbon nanotube, for which standard linear scaling methods are inapplicable.

Physical review. B, Condensed matter•Dec 15, 1998•29 citations

Kernel function based quantum algorithms for finite temperature quantum simulation

Hai Wang, Jue Nan, Tao Zhang +3 more

Computing finite temperature properties of a quantum many-body system is key to describing a broad range of correlated quantum many-body physics from quantum chemistry and condensed matter to thermal quantum field theories. Quantum computing, which has seen rapid developments in recent years, has a huge potential to impact the computation of quantum thermodynamics. To fulfill these potential impacts, it is crucial to design quantum algorithms that utilize the computation power of quantum computing devices. Here, we present a quantum kernel function expansion (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. In this quantum algorithm, the many-body density of states is approximated by a kernel Fourier expansion, whose expansion moments are obtained by random state sampling and quantum interferometric measurements. Compared to its classical counterpart, namely, the kernel polynomial method (KPM), QKFE has an exponential advantage in the cost of both time and memory. In computing low temperature properties, QKFE becomes inefficient, similar to classical KPM. To resolve this difficulty, we further construct a thermal ensemble iteration (THEI) protocol which starts from the trivial limit of an infinite temperature ensemble and approaches the low temperature regime step by step. For quantum Hamiltonians, whose ground states are preparable with polynomial quantum circuits, THEI has an overall polynomial complexity. We demonstrate its efficiency with applications to one- and two-dimensional quantum spin models and a fermionic lattice. With our analysis of the realization with digital and analog quantum devices, we believe the quantum algorithm is accessible to current quantum technology.

arXiv:2202.01170•Physical review. B./Physical review. B•Aug 1, 2023•4 citations
Linear-scaling electronic structure methods based on the calculation of moments of the underlying electronic Hamiltonian offer a computationally efficient and numerically robust scheme to drive large-scale atomistic simulations, in which the quantum-mechanical nature of the electrons is explicitly taken into account. We compare the kernel polynomial method to the Fermi operator expansion method and establish a formal connection between the two approaches. We show that the convolution of the kernel polynomial method may be understood as an effective electron temperature. The results of a number of possible kernels are formally examined, and then applied to a representative tight-binding model.
Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed-matter physics. In this paper basic properties and recent developments of Chebyshev expansion based algorithms and the kernel polynomial method are reviewed. Characterized by a resource consumption that scales linearly with the problem dimension these methods enjoyed growing popularity over the last decade and found broad application not only in physics. Representative examples from the fields of disordered systems, strongly correlated electrons, electron-phonon interaction, and quantum spin systems are discussed in detail. In addition, an illustration on how the kernel polynomial method is successfully embedded into other numerical techniques, such as cluster perturbation theory or Monte Carlo simulation, is provided.
The kernel polynomial method allows to sample overall spectral properties of a quantum system, while sparse diagonalization provides accurate information about a few important states. We present a method combining these two approaches without loss of performance or accuracy. We apply this hybrid kernel polynomial method to improve the computation of thermodynamic quantities and the construction of perturbative effective models, in a regime where neither of the methods is sufficient on its own. To achieve this we develop a perturbative kernel polynomial method to compute arbitrary order series expansions of expectation values. We demonstrate the efficiency of our approach on three examples: the calculation of supercurrent and inductance in a Josephson junction, the interaction of spin qubits defined in a two dimensional electron gas, and the calculation of the effective band structure in a realistic model of a semiconductor nanowire.
Two Chebyshev recursion methods are presented for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). If limited statistical accuracy and energy resolution are acceptable, they provide linear scaling methods for the calculation of physical properties involving large numbers of eigenstates such as densities of states, spectral functions, thermodynamics, total energies for Monte Carlo simulations and forces for molecular dynamics. KPM provides a uniform approximation to a DOS, with resolution inversely proportional to the number of Chebyshev moments, while MEM can achieve significantly higher, but non-uniform, resolution at the risk of possible artifacts. This paper emphasizes efficient algorithms.
An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi-Dirac operator expansion in terms of the Hamiltonian. The computational complexity is shown to scale with the logarithm of the polynomial order of the expansion, or equivalently, with the logarithm of the inverse temperature. The system of linear equations that arise in each implicit purification iteration is solved efficiently by a conjugate gradient solver. The scheme is particularly useful in connection with linear scaling electronic structure theory based on sparse matrix algebra. The efficiency of the implicit temperature expansion technique is analyzed and compared to some explicit purification methods for the zero temperature density matrix.
A renormalization-group method for electronic structure of large systems within a tight-binding framework is presented. A telescopic series of nested Hilbert spaces is constructed, having exponentially decreasing dimensions and electrons. The Hamiltonian matrices have exponentially converging energy ranges focusing to the Fermi level. The computational effort scales near linearly with system size even when the density matrix is highly nonlocal. This is illustrated by calculations on a model metal and a metallic finite carbon nanotube, for which standard linear scaling methods are inapplicable.
Computing finite temperature properties of a quantum many-body system is key to describing a broad range of correlated quantum many-body physics from quantum chemistry and condensed matter to thermal quantum field theories. Quantum computing, which has seen rapid developments in recent years, has a huge potential to impact the computation of quantum thermodynamics. To fulfill these potential impacts, it is crucial to design quantum algorithms that utilize the computation power of quantum computing devices. Here, we present a quantum kernel function expansion (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. In this quantum algorithm, the many-body density of states is approximated by a kernel Fourier expansion, whose expansion moments are obtained by random state sampling and quantum interferometric measurements. Compared to its classical counterpart, namely, the kernel polynomial method (KPM), QKFE has an exponential advantage in the cost of both time and memory. In computing low temperature properties, QKFE becomes inefficient, similar to classical KPM. To resolve this difficulty, we further construct a thermal ensemble iteration (THEI) protocol which starts from the trivial limit of an infinite temperature ensemble and approaches the low temperature regime step by step. For quantum Hamiltonians, whose ground states are preparable with polynomial quantum circuits, THEI has an overall polynomial complexity. We demonstrate its efficiency with applications to one- and two-dimensional quantum spin models and a fermionic lattice. With our analysis of the realization with digital and analog quantum devices, we believe the quantum algorithm is accessible to current quantum technology.