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:1202.2817 · Physical Review A

Approximate diagonalization method for large-scale Hamiltonians

M. H. S. Amin, Anatoly Yu. Smirnov, Neil G. Dickson, Marshall Drew-Brook

Published Nov 12, 2012• 4 citations
arXivHTMLPDF

Abstract

An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low-energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian for each eigenvalue to be calculated, using perturbation expansion, and extracting the eigenvalue from the diagonalization of the effective Hamiltonian. The size of the effective Hamiltonian can be significantly smaller than that of the original Hamiltonian, hence the diagonalization can be done much faster. We compare our approximate diagonalization results with those obtained using exact diagonalization and quantum Monte Carlo calculation for random problem instances with up to 128 qubits.

DOI
10.1103/physreva.86.052314

Related papers

Applications of Cluster Perturbation Theory Using Quantum Monte Carlo Data

Fei Lin, Erik Schwartz Sørensen, Catherine Kallin +1 more

We study cluster perturbation theory [Phys. Rev. Lett. 84, 522 (2000)] when auxiliary field quantum Monte Carlo method is used for solving the cluster hamiltonian. As a case study, we calculate the spectral functions of the Hubbard model in one and two dimensions and compare our results for the spectral functions to results obtained using exact diagonalization to solve the cluster hamiltonian. The main advantage of using quantum Monte Carlo results as a starting point is that the initial cluster size can be taken to be considerably larger and hence potentially capture more of the relevant physics. The drawback is that quantum Monte Carlo methods yield results at imaginary times with stochastic errors.

arXiv:cond-mat/0512406•International Symposium on High Performance Computing Systems and Applications (HPCS)•Jan 1, 2006•0 citations

Quantum Mechanics Approximate Methods

Lukong Cornelius Fai

In quantum mechanics, there exist a lot of problems from the domain of atomic, molecular, solid-state physics, physics of magnetic phenomena, nuclear physics, etc. The number of problems which may be solved exactly are few such as some one-dimensional problems, problems in the rectangular well (barrier), the oscillator, problems of motion in a central field such as motion in a Coulomb field. These methods are well formulated and are used in evaluations to a greater approximation. However, in some cases, these may create problems that are very difficult, if not impossible, to be solved exactly. In such problems, the Hamiltonian cannot be exactly diagonalized in a simple manner. For such problems, we resort to approximate methods for finding the eigenvalues and eigenfunctions of the Hamiltonian. Besides, these approximate methods yield results closer to experimental ones. Amongst the approximate methods, we examine the variational method.

CRC Press eBooks•Apr 19, 2022•0 citations

Numerical solution of larges=1/2 ands=1 Heisenberg antiferromagnetic spin chains using a truncated basis expansion

Mitchel D. Kovarik

A new method of determining the spectra of simple quantum-mechanical spin Hamiltonians by direct Hamiltonian-matrix diagonalization is presented. The method is illustrated by applying it to the isotropic one-dimensional Heisenberg antiferromagnet, for which calculations were performed for longer spin chains than by previous direct Hamiltonian-matrix diagonalizations. For spin s=1/2 it was possible to accurately determine the ground- and first-excited-state energies for chains of length N=32 and 64. For s=1 the longest chain for which a similar computation was performed was N=32; the singlet-triplet Haldane gap is found to be 0.421\ifmmode\pm\else\textpm\fi{}0.005 which is consistent with earlier Monte Carlo results. Long-spin-chain calculations are performed iteratively by solving smaller-chain problems, and constructing from their eigenvalues, and eigenstates, the longer-spin-chain basis and Hamiltonian matrices. The computations were performed on a small computer, which suggests that much larger problems could be handled with a parallel-processing supercomputer.

Physical review. B, Condensed matter•Apr 1, 1990•14 citations

An Attempt to Calculate Energy Eigenvalues in Quantum Systems of Large Sizes

Tomo Munehisa, Yasuko Munehisa

We report an attempt to calculate energy eigenvalues of large quantum systems by the diagonalization of an effectively truncated Hamiltonian matrix. For this purpose we employ a specific way to systematically make a set of orthogonal states from a trial wavefunction and the Hamiltonian. In comparison with the Lanczos method, which is quite powerful if the size of the system is within the memory capacity of computers, our method requires much less memory resources at the cost of the extreme accuracy. In this paper we demonstrate that our method works well in the systems of one-dimensional frustrated spins up to 48 sites, of bosons on a chain up to 32 sites and of fermions on a ladder up to 28 sites. We will see this method enables us to study eigenvalues of these quantum systems within reasonable accuracy.

arXiv:cond-mat/9912295•Journal of the Physical Society of Japan•Jul 15, 2000•4 citations

Numerical integration of the time-independent Schrödinger equation

Francisco Marcelo Fernández, Eduardo Alberto Castro

This chapter focuses on widely used approximate method: the numerical integration of the Schrodinger equation, restricting ourselves to one dimension for simplicity. There is a plethora of approaches that yield highly accurate numerical eigenvalues and eigenfunctions. In quantum mechanics one sometimes seeks after bound stationary states that satisfy given physical boundary conditions. Boundary conditions at infinity play a relevant role in quantum mechanics, in which case one looks for bound states that vanish asymptotically at the end points of coordinate interval. Solving the propagation matrix equation exactly for every coordinate pair in the physical interval is as difficult as solving the original differential equation. However, sometimes the former is preferable to develop approximate numerical algorithms for the accurate calculation of eigenvalues and eigenfunctions. The perturbation method based on the Taylor expansion only requires derivatives of the potential energy function, which one obtains easily in most cases and appears to be preferable for the systematic improvement of the approximate propagation matrix.

CRC Press eBooks•Jan 16, 2020•0 citations

THE ROLE OF DIAGONALIZATION WITHIN A DIAGONALIZATION/MONTE CARLO SCHEME

Dean Lee

We discuss a method called quasi-sparse eigenvector diagonalization which finds the most important basis vectors of the low energy eigenstates of a quantum Hamiltonian. It can operate using any basis, either orthogonal or non-orthogonal, and any sparse Hamiltonian, either Hermitian, non-Hermitian, finite-dimensional, or infinite-dimensional. The method is part of a new computational approach which combines both diagonalization and Monte Carlo techniques.

arXiv:hep-lat/0010095•International Journal of Modern Physics A•Sep 1, 2001•1 citation
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low-energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian for each eigenvalue to be calculated, using perturbation expansion, and extracting the eigenvalue from the diagonalization of the effective Hamiltonian. The size of the effective Hamiltonian can be significantly smaller than that of the original Hamiltonian, hence the diagonalization can be done much faster. We compare our approximate diagonalization results with those obtained using exact diagonalization and quantum Monte Carlo calculation for random problem instances with up to 128 qubits.
We study cluster perturbation theory [Phys. Rev. Lett. 84, 522 (2000)] when auxiliary field quantum Monte Carlo method is used for solving the cluster hamiltonian. As a case study, we calculate the spectral functions of the Hubbard model in one and two dimensions and compare our results for the spectral functions to results obtained using exact diagonalization to solve the cluster hamiltonian. The main advantage of using quantum Monte Carlo results as a starting point is that the initial cluster size can be taken to be considerably larger and hence potentially capture more of the relevant physics. The drawback is that quantum Monte Carlo methods yield results at imaginary times with stochastic errors.
In quantum mechanics, there exist a lot of problems from the domain of atomic, molecular, solid-state physics, physics of magnetic phenomena, nuclear physics, etc. The number of problems which may be solved exactly are few such as some one-dimensional problems, problems in the rectangular well (barrier), the oscillator, problems of motion in a central field such as motion in a Coulomb field. These methods are well formulated and are used in evaluations to a greater approximation. However, in some cases, these may create problems that are very difficult, if not impossible, to be solved exactly. In such problems, the Hamiltonian cannot be exactly diagonalized in a simple manner. For such problems, we resort to approximate methods for finding the eigenvalues and eigenfunctions of the Hamiltonian. Besides, these approximate methods yield results closer to experimental ones. Amongst the approximate methods, we examine the variational method.
A new method of determining the spectra of simple quantum-mechanical spin Hamiltonians by direct Hamiltonian-matrix diagonalization is presented. The method is illustrated by applying it to the isotropic one-dimensional Heisenberg antiferromagnet, for which calculations were performed for longer spin chains than by previous direct Hamiltonian-matrix diagonalizations. For spin s=1/2 it was possible to accurately determine the ground- and first-excited-state energies for chains of length N=32 and 64. For s=1 the longest chain for which a similar computation was performed was N=32; the singlet-triplet Haldane gap is found to be 0.421\ifmmode\pm\else\textpm\fi{}0.005 which is consistent with earlier Monte Carlo results. Long-spin-chain calculations are performed iteratively by solving smaller-chain problems, and constructing from their eigenvalues, and eigenstates, the longer-spin-chain basis and Hamiltonian matrices. The computations were performed on a small computer, which suggests that much larger problems could be handled with a parallel-processing supercomputer.
We report an attempt to calculate energy eigenvalues of large quantum systems by the diagonalization of an effectively truncated Hamiltonian matrix. For this purpose we employ a specific way to systematically make a set of orthogonal states from a trial wavefunction and the Hamiltonian. In comparison with the Lanczos method, which is quite powerful if the size of the system is within the memory capacity of computers, our method requires much less memory resources at the cost of the extreme accuracy. In this paper we demonstrate that our method works well in the systems of one-dimensional frustrated spins up to 48 sites, of bosons on a chain up to 32 sites and of fermions on a ladder up to 28 sites. We will see this method enables us to study eigenvalues of these quantum systems within reasonable accuracy.
This chapter focuses on widely used approximate method: the numerical integration of the Schrodinger equation, restricting ourselves to one dimension for simplicity. There is a plethora of approaches that yield highly accurate numerical eigenvalues and eigenfunctions. In quantum mechanics one sometimes seeks after bound stationary states that satisfy given physical boundary conditions. Boundary conditions at infinity play a relevant role in quantum mechanics, in which case one looks for bound states that vanish asymptotically at the end points of coordinate interval. Solving the propagation matrix equation exactly for every coordinate pair in the physical interval is as difficult as solving the original differential equation. However, sometimes the former is preferable to develop approximate numerical algorithms for the accurate calculation of eigenvalues and eigenfunctions. The perturbation method based on the Taylor expansion only requires derivatives of the potential energy function, which one obtains easily in most cases and appears to be preferable for the systematic improvement of the approximate propagation matrix.