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

Il Nuovo Cimento

Diagonalization of hamiltonian

L. M. Garrido, P. Pascual

Published May 1, 1959• 16 citations
Publisher
DOI
10.1007/bf02745965

Related papers

The diagonalization of quantum field Hamiltonians

Dean Lee, Nathan Salwen, Daniel Lee

arXiv:hep-th/0002251•Physics Letters B•Mar 1, 2001•54 citations

Diagonalization of the quadratic boson hamiltonian

J.H.P. Colpa

Physica A Statistical Mechanics and its Applications•Sep 1, 1978•453 citations

1 Diagonalisation of Hamiltonian

進 大久保

素粒子論研究•Jun 1, 1954•0 citations

Approximate diagonalization method for large-scale Hamiltonians

M. H. S. Amin, Anatoly Yu. Smirnov, Neil G. Dickson +1 more

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.

arXiv:1202.2817•Physical Review A•Nov 12, 2012•4 citations

A variational quantum algorithm for Hamiltonian diagonalization

Jinfeng Zeng, Chenfeng Cao, Chao Zhang +2 more

Abstract Hamiltonian diagonalization is at the heart of understanding physical properties and practical applications of quantum systems. It is highly desired to design quantum algorithms that can speedup Hamiltonian diagonalization, especially those can be implemented on near-term quantum devices. In this work, we propose a variational quantum algorithm for Hamiltonian diagonalization (VQHD) of quantum systems, which explores the important physical properties, such as temperature, locality, and correlation, of the system. The key idea is that the thermal states of the system encode the information of eigenvalues and eigenstates of the system Hamiltonian. To obtain the full spectrum of the Hamiltonian, we use a quantum imaginary time evolution algorithm with high temperature, which prepares a thermal state with a small correlation length. With Trotterization, this then allows us to implement each step of imaginary time evolution by a local unitary transformation on only a small number of sites. Diagonalizing these thermal states hence leads to a full knowledge of the Hamiltonian eigensystem. We apply our algorithm to diagonalize local Hamiltonians and return results with high precision. Our VQHD algorithm sheds new light on the applications of near-term quantum computers.

arXiv:2008.09854•Quantum Science and Technology•Jul 6, 2021•20 citations

Transformation of the Hamiltonian

Stefan K. Kehrein

Springer tracts in modern physics•Jan 1, 2006•0 citations
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.
Abstract Hamiltonian diagonalization is at the heart of understanding physical properties and practical applications of quantum systems. It is highly desired to design quantum algorithms that can speedup Hamiltonian diagonalization, especially those can be implemented on near-term quantum devices. In this work, we propose a variational quantum algorithm for Hamiltonian diagonalization (VQHD) of quantum systems, which explores the important physical properties, such as temperature, locality, and correlation, of the system. The key idea is that the thermal states of the system encode the information of eigenvalues and eigenstates of the system Hamiltonian. To obtain the full spectrum of the Hamiltonian, we use a quantum imaginary time evolution algorithm with high temperature, which prepares a thermal state with a small correlation length. With Trotterization, this then allows us to implement each step of imaginary time evolution by a local unitary transformation on only a small number of sites. Diagonalizing these thermal states hence leads to a full knowledge of the Hamiltonian eigensystem. We apply our algorithm to diagonalize local Hamiltonians and return results with high precision. Our VQHD algorithm sheds new light on the applications of near-term quantum computers.