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

Hybrid kernel polynomial method

Muhammad Irfan, Sathish R. Kuppuswamy, Dániel Varjas, Pablo M. Perez-Piskunow, Rafał Skolasiński, Michael Wimmer, Anton Akhmerov

Published Sep 20, 2019• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1909.09649

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

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

Calculating the many-body density of states on a digital quantum computer

Alessandro Summer, Cecilia Chiaracane, Mark T. Mitchison +1 more

Quantum statistical mechanics allows us to extract thermodynamic information from a microscopic description of a many-body system. A key step is the calculation of the density of states, from which the partition function and all finite-temperature equilibrium thermodynamic quantities can be calculated. In this work, we devise and implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer which is inspired by the kernel polynomial method. Classically, the kernel polynomial method allows us to sample spectral functions via a Chebyshev polynomial expansion. Our algorithm computes moments of the expansion on quantum hardware using a combination of random-state preparation for stochastic trace evaluation and a controlled unitary operator. We use our algorithm to estimate the density of states of a nonintegrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18 qubits. This not only represents a state-of-the-art calculation of thermal properties of a many-body system on quantum hardware, but also exploits the controlled unitary evolution of a many-qubit register on an unprecedented scale. Published by the American Physical Society 2024

arXiv:2303.13476•Physical Review Research•Jan 26, 2024•11 citations

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

Eunan J. McEniry, Ralf Drautz

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.

arXiv:1701.01568•Jan 6, 2017•0 citations

Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy

Richard N. Silver, Heinrich Röder

We present an efficient algorithm for calculating spectral properties of large sparse Hamiltonian matrices such as densities of states and spectral functions. The combination of Chebyshev recursion and maximum entropy achieves high-energy resolution without significant roundoff error, machine precision, or numerical instability limitations. If controlled statistical or systematic errors are acceptable, CPU and memory requirements scale linearly in the number of states. The inference of spectral properties from moments is much better conditioned for Chebyshev moments than for power moments. We adapt concepts from the kernel polynomial method, a linear Chebyshev approximation with optimized Gibbs damping, to control the accuracy of Fourier integrals of positive nonanalytic functions. We compare the performance of kernel polynomial and maximum entropy algorithms for an electronic structure example.

arXiv:cond-mat/9703229•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Oct 1, 1997•162 citations

The Kernel Polynomial Method applied to tight binding systems with time-dependence

R.S. ter Hoeven

The Kernel Polynomial Method (KPM) is a method to approximate any function as a polynomial of finite order. In this research the KPM will be used to approximate the density of states and expectation values of physical observables in a tight binding system. To be able to use the KPM a tight binding Hamiltonian is obtained by using the python package Kwant. A python implementation of KPM combined with a time propagator then results in time-dependent expectation values of any operator. This approach benefits from large system sizes, since KPM uses a statistical approximation that increases in accuracy with larger size. The statistical approximation always converges, but there is limited guarantee as to how fast it converges. In further research the KPM could be compared to other available approaches. Another possibility is to use the KPM to get a general overview of the system and combine it with more exact approaches to find specific results.

•Jan 1, 2016•0 citations
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.
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.
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.
Quantum statistical mechanics allows us to extract thermodynamic information from a microscopic description of a many-body system. A key step is the calculation of the density of states, from which the partition function and all finite-temperature equilibrium thermodynamic quantities can be calculated. In this work, we devise and implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer which is inspired by the kernel polynomial method. Classically, the kernel polynomial method allows us to sample spectral functions via a Chebyshev polynomial expansion. Our algorithm computes moments of the expansion on quantum hardware using a combination of random-state preparation for stochastic trace evaluation and a controlled unitary operator. We use our algorithm to estimate the density of states of a nonintegrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18 qubits. This not only represents a state-of-the-art calculation of thermal properties of a many-body system on quantum hardware, but also exploits the controlled unitary evolution of a many-qubit register on an unprecedented scale. Published by the American Physical Society 2024
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.
We present an efficient algorithm for calculating spectral properties of large sparse Hamiltonian matrices such as densities of states and spectral functions. The combination of Chebyshev recursion and maximum entropy achieves high-energy resolution without significant roundoff error, machine precision, or numerical instability limitations. If controlled statistical or systematic errors are acceptable, CPU and memory requirements scale linearly in the number of states. The inference of spectral properties from moments is much better conditioned for Chebyshev moments than for power moments. We adapt concepts from the kernel polynomial method, a linear Chebyshev approximation with optimized Gibbs damping, to control the accuracy of Fourier integrals of positive nonanalytic functions. We compare the performance of kernel polynomial and maximum entropy algorithms for an electronic structure example.
The Kernel Polynomial Method (KPM) is a method to approximate any function as a polynomial of finite order. In this research the KPM will be used to approximate the density of states and expectation values of physical observables in a tight binding system. To be able to use the KPM a tight binding Hamiltonian is obtained by using the python package Kwant. A python implementation of KPM combined with a time propagator then results in time-dependent expectation values of any operator. This approach benefits from large system sizes, since KPM uses a statistical approximation that increases in accuracy with larger size. The statistical approximation always converges, but there is limited guarantee as to how fast it converges. In further research the KPM could be compared to other available approaches. Another possibility is to use the KPM to get a general overview of the system and combine it with more exact approaches to find specific results.