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

Progress of Theoretical Physics

Solving the RPA Eigenvalue Equation in Real-Space

Atsushi Muta, Junichi Iwata, Yukio Hashimoto, Kazuhiro Yabana

Published Dec 1, 2002• 23 citations
Publisher

Abstract

We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an iterative method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system.

DOI
10.1143/ptp.108.1065

Related papers

実空間における RPA 方程式の解法(「有限量子多体系の励起構造と相関効果」-原子核・量子ドット・ボース凝縮・クラスターを中心として-,研究会報告)

Atsushi Muta, Jun-Ichi Iwata, Yukio Hashimoto +1 more

We present a computational method to solve R.PA eigenvalue equation employing a uniform grid representation in the three-dimensional Cartesian coordinate. The conjugate gradient method, an iterative method for a generalized eigenvalue problem, is used for this purpose. We apply the present method to Hartree-Fock +R.PA calculation with BKN-like interaction and Skyrrne interaction.

•Jun 20, 2002•0 citations

Efficient grid-based method in nonequilibrium Green’s function calculations: Application to model atoms and molecules

Karsten Balzer, S. Bauch, M. Bönitz

The finite-element discrete variable representation is proposed to express the nonequilibrium Green's function for strongly inhomogeneous quantum systems. This method is highly favorable against a general basis approach with regard to numerical complexity, memory resources, and computation time. Its flexibility also allows for an accurate representation of spatially extended Hamiltonians and thus opens the way toward a direct solution of the two-time Schwinger-Keldysh-Kadanoff-Baym equations on spatial grids, including, for example, the description of highly excited states in atoms. As benchmarks, we compute and characterize, in Hartree-Fock and second Born approximations, the ground states of the He atom, the ${\mathrm{H}}_{2}$ molecule, and the LiH molecule in one spatial dimension. Thereby, the ground-state and binding energies, densities, and bond lengths are compared with the direct solution of the time-dependent Schr\"odinger equation.

arXiv:0910.5458•Physical Review A•Feb 25, 2010•72 citations

Three-dimensional Lie algebras and some of their realizations in quantum mechanics

Francisco Marcelo Fernández, Eduardo A. Castro

The number of exactly solvable eigenvalue problems has been rapidly increasing since the advent of quantum mechanics and there are many efficient ways to treat them. As a general rule, it is possible to write exactly solvable abstract eigenvalue equations in terms of the generators of finite-dimensional Lie algebras and solve them by means of purely algebraic methods. Matrix elements are commonly necessary for the application of perturbation theory and variational principles, among other approximate methods. The chapter discusses examples of three-dimensional Lie algebras with well-known quantum-mechanical realizations. Typically, exactly solvable quantum-mechanical problems are either onedimensional models or lead to separable equations in many dimensions. In the coordinate representation both cases reduce to ordinary differential equations of second order that determine the eigenvalues and separation constants compatible with the physical boundary conditions. In its purest form, a Lie algebraic method is representation-independent. Extensive application of algebraic methods to selected physical problems is already available elsewhere.

CRC Press eBooks•Jan 16, 2020•0 citations

Efficient basis expansion for describing linear and nonlinear electron dynamics in crystalline solids

Shunsuke A. Sato, Kazuhiro Yabana

We propose an efficient basis expansion for electron orbitals to describe real-time electron dynamics in crystalline solids. Although a conventional grid representation in the three-dimensional Cartesian coordinates works robustly, it requires a large amount of computational resources. To reduce computational costs, we consider basis expansion methods employing eigenstates of the ground state Hamiltonian with a truncation. We have found that adding occupied eigenstates of nearby $k$ points to the truncated basis functions composed of eigenstates of the original $k$ point is crucially important. We demonstrate the usefulness of the method for linear and nonlinear electron dynamics calculations in crystalline ${\mathrm{SiO}}_{2}$.

arXiv:1404.5118•Physical Review B•Jun 30, 2014•17 citations

Validation of the GreenX library time-frequency component for efficient G W and RPA calculations

Maryam Azizi, Jan Wilhelm, Dorothea Golze +5 more

Electronic structure calculations based on many-body perturbation theory [e.g., GW or the random-phase approximation (RPA)] require function evaluations in the complex time and frequency domain, for example, inhomogeneous Fourier transforms or analytic continuation from the imaginary axis to the real axis. For inhomogeneous Fourier transforms, the time-frequency component of the GreenX library provides time-frequency grids that can be utilized in low-scaling RPA and GW implementations. In addition, the adoption of the compact frequency grids provided by our library also reduces the computational overhead in RPA implementations with conventional scaling. In this paper, we present low-scaling GW and conventional RPA benchmark calculations using the GreenX grids with different codes (FHI-aims, CP2K, and ABINIT) for molecules, two-dimensional materials and solids. Very small integration errors are observed when using 30 time-frequency points for our test cases, namely $<{10}^{\ensuremath{-}8}$ eV/electron for the RPA correlation energies, and $\ensuremath{\le}10$ meV for the $GW$ quasiparticle energies.

arXiv:2403.06709•Physical review. B./Physical review. B•Jun 3, 2024•17 citations

Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation

Grzegorz Rajchel-Mieldzioć, Szymon Pliś, E. J. Zak

Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size, posing an even harder problem than ground-state calculations. We present a quantum algorithm for estimating eigenvalues and singular values of parametrized matrix families, including solving generalized eigenvalue problems that frequently arise in quantum simulations. Our method uses quantum amplitude amplification and phase estimation to identify matrix eigenvalues by locating minima in the singular value spectrum. We demonstrate our algorithm by proposing a quantum computing formulation of the pseudospectral collocation method for the Schrödinger equation. We estimate fault-tolerant quantum resource requirements for the quantum collocation method, showing favorable scaling in the size of the problem N [up to O ̃ ( N ) ] compared to classical implementations with O ̃ ( N ) , for certain well-behaved potentials. Additionally, unlike the standard collocation method, which results in a generalized eigenvalue problem requiring matrix inversion, our algorithm circumvents the associated numerical instability by scanning a parametrized matrix family and detecting eigenvalues through singular value minimization. This approach is particularly effective when multiple eigenvalues are needed or when the generalized eigenvalue problem involves a high condition number. In the fault-tolerant era, our method may thus be useful for simulating high-dimensional molecular systems with dense spectra involving highly excited states, such as those encountered in molecular photodynamics or quasicontinuum regimes in many-body and solid-state systems.

arXiv:2506.13534•Physical Review Research•Apr 11, 2026•6 citations
We present a computational method to solve the RPA eigenvalue equation employing a uniform grid representation in three-dimensional Cartesian coordinates. The conjugate gradient method is used for this purpose as an iterative method for a generalized eigenvalue problem. No construction of unoccupied orbitals is required in the procedure. We expect this method to be useful for systems lacking spatial symmetry to calculate accurate eigenvalues and transition matrix elements of a few low-lying excitations. Some applications are presented to demonstrate the feasibility of the method, considering the simplified mean-field model as an example of a nuclear physics system and the electronic excitations in molecules with time-dependent density functional theory as an example of an electronic system.
The finite-element discrete variable representation is proposed to express the nonequilibrium Green's function for strongly inhomogeneous quantum systems. This method is highly favorable against a general basis approach with regard to numerical complexity, memory resources, and computation time. Its flexibility also allows for an accurate representation of spatially extended Hamiltonians and thus opens the way toward a direct solution of the two-time Schwinger-Keldysh-Kadanoff-Baym equations on spatial grids, including, for example, the description of highly excited states in atoms. As benchmarks, we compute and characterize, in Hartree-Fock and second Born approximations, the ground states of the He atom, the H2{\mathrm{H}}_{2}H2​ molecule, and the LiH molecule in one spatial dimension. Thereby, the ground-state and binding energies, densities, and bond lengths are compared with the direct solution of the time-dependent Schr\"odinger equation.
The number of exactly solvable eigenvalue problems has been rapidly increasing since the advent of quantum mechanics and there are many efficient ways to treat them. As a general rule, it is possible to write exactly solvable abstract eigenvalue equations in terms of the generators of finite-dimensional Lie algebras and solve them by means of purely algebraic methods. Matrix elements are commonly necessary for the application of perturbation theory and variational principles, among other approximate methods. The chapter discusses examples of three-dimensional Lie algebras with well-known quantum-mechanical realizations. Typically, exactly solvable quantum-mechanical problems are either onedimensional models or lead to separable equations in many dimensions. In the coordinate representation both cases reduce to ordinary differential equations of second order that determine the eigenvalues and separation constants compatible with the physical boundary conditions. In its purest form, a Lie algebraic method is representation-independent. Extensive application of algebraic methods to selected physical problems is already available elsewhere.
We propose an efficient basis expansion for electron orbitals to describe real-time electron dynamics in crystalline solids. Although a conventional grid representation in the three-dimensional Cartesian coordinates works robustly, it requires a large amount of computational resources. To reduce computational costs, we consider basis expansion methods employing eigenstates of the ground state Hamiltonian with a truncation. We have found that adding occupied eigenstates of nearby kkk points to the truncated basis functions composed of eigenstates of the original kkk point is crucially important. We demonstrate the usefulness of the method for linear and nonlinear electron dynamics calculations in crystalline SiO2{\mathrm{SiO}}_{2}SiO2​.
Electronic structure calculations based on many-body perturbation theory [e.g., GW or the random-phase approximation (RPA)] require function evaluations in the complex time and frequency domain, for example, inhomogeneous Fourier transforms or analytic continuation from the imaginary axis to the real axis. For inhomogeneous Fourier transforms, the time-frequency component of the GreenX library provides time-frequency grids that can be utilized in low-scaling RPA and GW implementations. In addition, the adoption of the compact frequency grids provided by our library also reduces the computational overhead in RPA implementations with conventional scaling. In this paper, we present low-scaling GW and conventional RPA benchmark calculations using the GreenX grids with different codes (FHI-aims, CP2K, and ABINIT) for molecules, two-dimensional materials and solids. Very small integration errors are observed when using 30 time-frequency points for our test cases, namely $<{10}^{\ensuremath{-}8}$ eV/electron for the RPA correlation energies, and $\ensuremath{\le}10$ meV for the GWGWGW quasiparticle energies.
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size, posing an even harder problem than ground-state calculations. We present a quantum algorithm for estimating eigenvalues and singular values of parametrized matrix families, including solving generalized eigenvalue problems that frequently arise in quantum simulations. Our method uses quantum amplitude amplification and phase estimation to identify matrix eigenvalues by locating minima in the singular value spectrum. We demonstrate our algorithm by proposing a quantum computing formulation of the pseudospectral collocation method for the Schrödinger equation. We estimate fault-tolerant quantum resource requirements for the quantum collocation method, showing favorable scaling in the size of the problem N [up to O ̃ ( N ) ] compared to classical implementations with O ̃ ( N ) , for certain well-behaved potentials. Additionally, unlike the standard collocation method, which results in a generalized eigenvalue problem requiring matrix inversion, our algorithm circumvents the associated numerical instability by scanning a parametrized matrix family and detecting eigenvalues through singular value minimization. This approach is particularly effective when multiple eigenvalues are needed or when the generalized eigenvalue problem involves a high condition number. In the fault-tolerant era, our method may thus be useful for simulating high-dimensional molecular systems with dense spectra involving highly excited states, such as those encountered in molecular photodynamics or quasicontinuum regimes in many-body and solid-state systems.