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

Springer eBooks

Exact Diagonalization Method to Solve the K—S Hamiltonian

Published Oct 24, 2005• 0 citations
Publisher
DOI
10.1007/3-540-27632-7_9

Related papers

Mean-Field Approximation for the K—S Hamiltonian

Springer eBooks•Oct 24, 2005•0 citations

Exact diagonalization on spin-1/2 pyrochlore cluster with spin configuration and entanglement discussion

Wei, Chen

In quantum physics, if we can find the eigenstates |Φᵢ⟩ of a Hamiltonian 𝐻, and the respective eigenergies 𝐸ᵢ, we can calculate many aspects such as time evolution, or its thermal properties. Exact diagonalization is a method which can solve the Hamiltonian numerically. For a small Hamiltonian system, we can find the eigenvalues by solving the characteristic polynomial equation of the matrix. However, as the system grows larger, the calculation will grow exponentially. Instead of calculating the eigenstates directly, we will use the unitary transformation matrix to block diagonalize the Hamiltonian first. As a consequence, instead of solving the Hamiltonian directly, we will solve each block. In order to find the unitary transformation matrix U, we will use the symmetry of the Hamiltonian, and with the help of group theory, we can construct 𝑈 matrix and do the block diagonalization. In Chapter 3 we do the block diagonaliztion on a 16-site cluster of pyrochlore magnet. We use the full space group No. 227 to block diagonalize the Hamiltonian matrix into 14 blocks with different degeneracy. In Chapter 4, we analyze the spin states by varying the exchange constants. In Chapter 5, we use the ground state to discuss the quantum entanglement between different sites in the ground state. We also evaluate the ~I~ concurrence of the ground states.

•Oct 1, 2025•0 citations

Approximate methods

So far, we have studied quantum mechanical systems that can be exactly solved. Most often, however, we are confronted with systems which are very difficult (if not impossible) to solve exactly. That is, the Hamiltonians for such systems cannot be diagonalized exactly in a simple way. In such a case, we look for approximate methods for finding the eigenvalues and eigenstates of the Hamiltonian. And sometimes, these approximate methods give results which are amazingly close to the true experimental values. There are various approximate methods which one can apply to different physical problems. We will discuss all these methods systematically starting with the variational method.

Co-Published with Hindustan Book Agency, India. WSPC Distribute for All Markets Except in India•Jan 1, 2012•0 citations

Diagonalization of hamiltonian

L. M. Garrido, P. Pascual

Il Nuovo Cimento•May 1, 1959•16 citations

PairDiag: An exact diagonalization program for solving general pairing Hamiltonians

Xiaoyu Liu, Chong Qi

We present a program for solving exactly the general pairing Hamiltonian based on diagonalization. The program generates the seniority-zero shell-model-like basis vectors via the ‘01’ inversion algorithm. The Hamiltonian matrix is constructed in this seniority-zero space. The program evaluates all non-zero elements of the Hamiltonian matrix “on the fly” using the scattering operator and a search algorithm. The matrix is diagonalized by using the iterative Lanczos algorithm. The OpenMP parallel program thus developed, PairDiag, can efficiently calculate the ground-state eigenvalue and eigenvector of the general pairing Hamiltonian for both the even-mass and the odd-mass system. The program is packaged in a Fortran module, which makes it easy to use the program to replace the BCS approximation in standard self-consistent mean field calculations. For systems with dimension around 108, the calculation can be done within hours on standard desktop computers. Program Title: PairDiag. Program Files doi: https://doi.org/10.17632/dzzspfszsh.1 Licensing provisions: CC by NC 3.0. Programming language: Fortran 95. Nature of problem: The numerically exact solution of general pairing Hamiltonian can be solved by diagonalization in configuration spaces of fixed seniority. Solution method: The program constructs the seniority-zero space by the ‘01’ inversion algorithm, and diagonalizes the general pairing Hamiltonian by the Lanczos plus QR algorithm. Restrictions: The total number of orbits involved must be less than 63, and the dimension that can be calculated is restricted by the local RAM condition.

arXiv:2001.01978•Computer Physics Communications•Apr 28, 2020•11 citations

Exact Diagonalization Methods for Quantum Systems

Huey-Wen Lin, James E. Gubernatis, Harvey Gould +1 more

Computers in Physics•Jul 1, 1993•233 citations
In quantum physics, if we can find the eigenstates |Φᵢ⟩ of a Hamiltonian 𝐻, and the respective eigenergies 𝐸ᵢ, we can calculate many aspects such as time evolution, or its thermal properties. Exact diagonalization is a method which can solve the Hamiltonian numerically. For a small Hamiltonian system, we can find the eigenvalues by solving the characteristic polynomial equation of the matrix. However, as the system grows larger, the calculation will grow exponentially. Instead of calculating the eigenstates directly, we will use the unitary transformation matrix to block diagonalize the Hamiltonian first. As a consequence, instead of solving the Hamiltonian directly, we will solve each block. In order to find the unitary transformation matrix U, we will use the symmetry of the Hamiltonian, and with the help of group theory, we can construct 𝑈 matrix and do the block diagonalization. In Chapter 3 we do the block diagonaliztion on a 16-site cluster of pyrochlore magnet. We use the full space group No. 227 to block diagonalize the Hamiltonian matrix into 14 blocks with different degeneracy. In Chapter 4, we analyze the spin states by varying the exchange constants. In Chapter 5, we use the ground state to discuss the quantum entanglement between different sites in the ground state. We also evaluate the ~I~ concurrence of the ground states.
So far, we have studied quantum mechanical systems that can be exactly solved. Most often, however, we are confronted with systems which are very difficult (if not impossible) to solve exactly. That is, the Hamiltonians for such systems cannot be diagonalized exactly in a simple way. In such a case, we look for approximate methods for finding the eigenvalues and eigenstates of the Hamiltonian. And sometimes, these approximate methods give results which are amazingly close to the true experimental values. There are various approximate methods which one can apply to different physical problems. We will discuss all these methods systematically starting with the variational method.
We present a program for solving exactly the general pairing Hamiltonian based on diagonalization. The program generates the seniority-zero shell-model-like basis vectors via the ‘01’ inversion algorithm. The Hamiltonian matrix is constructed in this seniority-zero space. The program evaluates all non-zero elements of the Hamiltonian matrix “on the fly” using the scattering operator and a search algorithm. The matrix is diagonalized by using the iterative Lanczos algorithm. The OpenMP parallel program thus developed, PairDiag, can efficiently calculate the ground-state eigenvalue and eigenvector of the general pairing Hamiltonian for both the even-mass and the odd-mass system. The program is packaged in a Fortran module, which makes it easy to use the program to replace the BCS approximation in standard self-consistent mean field calculations. For systems with dimension around 108, the calculation can be done within hours on standard desktop computers. Program Title: PairDiag. Program Files doi: https://doi.org/10.17632/dzzspfszsh.1 Licensing provisions: CC by NC 3.0. Programming language: Fortran 95. Nature of problem: The numerically exact solution of general pairing Hamiltonian can be solved by diagonalization in configuration spaces of fixed seniority. Solution method: The program constructs the seniority-zero space by the ‘01’ inversion algorithm, and diagonalizes the general pairing Hamiltonian by the Lanczos plus QR algorithm. Restrictions: The total number of orbits involved must be less than 63, and the dimension that can be calculated is restricted by the local RAM condition.