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:hep-lat/0010095 · International Journal of Modern Physics A

THE ROLE OF DIAGONALIZATION WITHIN A DIAGONALIZATION/MONTE CARLO SCHEME

Dean Lee

Published Sep 1, 2001• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1142/s0217751x01009430

Related papers

TUTORIAL ON QUASI-SPARSE EIGENVECTOR DIAGONALIZATION

Dean Lee

We review several topics related to the diagonalization of quantum field Hamiltonians using the quasi-sparse eigenvector (QSE) method.

arXiv:hep-th/0007010•International Workshop on Non-Perturbative Methods and Lattice QCD•Apr 1, 2001•3 citations

MONTE CARLO DIAGONALIZATION OF VERY LARGE MATRICES: APPLICATION TO FERMION SYSTEMS

Hans A. De Raedt, Wolfgang von der Linden

All known Quantum-Monte-Carlo algorithms for fermions suffer from the so-called “minus-sign-problem” which is detrimental to the application of these simulation methods to fermion systems at very low temperatures and/or of very many lattice sites. We identify the origin of this fundamental problem, demonstrate that it is a very general feature, not necessarily related to the presence of fermionic degrees of freedom. We describe an novel algorithm which does not suffer from the minus-sign problem. Illustrative results for the two-dimensional Hubbard model are presented

International Journal of Modern Physics C•Feb 1, 1992•6 citations

Polynomial-time exact diagonalization via sparse guided eigenwalks

Zachary E. Chin, Mario Motta, Javier Robledo Moreno +3 more

Computing quantum ground states is generically difficult, but additional structure can sometimes allow diagonalization to be recast as a more feasible problem. For example, when the desired ground state is sparse in a given basis, diagonalization can be facilitated via graph search. We make this reformulation precise by introducing the eigenwalk problem, which seeks the support of a sparse eigenvector of a Hermitian matrix by exploring the graph induced by its nonzero entries. However, it is not obvious whether the relevant support vertices must always be efficiently reachable by a search on the graph. To resolve this question, we prove that for every sparse eigenvector, there exists a (possibly different) sparse eigenvector with the same eigenvalue whose support is tightly localized in the graph, with diameter scaling only linearly in the sparsity and independently of the total number of vertices. As a consequence, if a $2^n$-dimensional, ${\rm poly}(n)$-sparse Hamiltonian has an $\mathcal{O}(1)$-sparse extremal eigenvector and one support element is known, then an exact eigenvector with the same eigenvalue can be computed classically in ${\rm poly}(n)$ time. The same conclusion follows when the $\mathcal{O}(1)$-sparse eigenvector is non-extremal, provided that it is sparser than every eigenvector with a different eigenvalue. These results hold with no assumptions on the degeneracy, locality, spectral width, or spectral gap of the Hamiltonian, and the underlying support-localization principle also extends to problems beyond exact diagonalization, such as sparse principal component analysis.

quant-pharXiv:2606.23967•Jun 24, 2026•1 citation

Diagonalization of Hamiltonians for Many-Body Systems by Auxiliary Field Quantum Monte Carlo Technique

Michio Honma, T. Mizusaki, Takaharu Otsuka

We propose a Monte Carlo method for solving the quantum many-body interacting systems. Mean fields dominating the structure of low-lying states are selected by a Monte Carlo method, which generates optimum many-body basis states for diagonalizing the Hamiltonian consisting of one- and two-body terms. Not only the ground state but also low-lying excited states are obtained with their wave functions. Results are examined by comparison to exact values.

Physical Review Letters•Aug 14, 1995•160 citations

Non-perturbative Methods in Modal Field Theory

Nathan Salwen

Several issues in the modal approach to quantum field theory are discussed. Within the formalism of spherical field theory, differential renormalization is presented and shown to result in a finite number of renormalization parameters. Computations of the massless Thirring model in 1+1 dimensions are presented using this approach. Diagonalization techniques in periodic field theory are demonstrated. Issues of very large Hilbert spaces are considered and several approaches are presented. The quasi sparse eigenvector (QSE) approach takes advantage of the relatively small number of basis states that typically contribute significantly to any particular eigenvector. Stochastic correction methods use Monte Carlo calculations to calculate higher order corrections to the quasi sparse result. The quasi sparse eigenvector method and stochastic error correction are applied to the Hubbard model. With U/t=4, the shift in the ground energy below the U=0 value is found to within 1% for the 8x8 Hubbard model with 25/64 filling.

arXiv:hep-lat/0212035•Dec 19, 2002•6 citations

MONTE CARLO SHELL MODEL CALCULATIONS FOR ATOMIC NUCLEI

Takaharu Otsuka, T. Mizusaki, Y. Utsuno +2 more

The formulation and recent applications of the Quantum Monte Carlo diagonalization (QMCD) method are reported. The QMCD has been proposed for solving the quantum many-body inteacting systems, providing us with energy eigenvalues, transition matrix elements and wave functions. Its application to the nuclear shell model is referred to as the Monte Carlo Shell Model. By the Monte Carlo Shell Model calculations, the level structure of low-lying states can be studied with realistic interactions, providing a useful tool for nuclear spectroscopy. The Monte Carlo Shell Model has been applied to the study of a variety of nuclei, and can be characterized as the importance truncation scheme to the full diagonalization which is infeasible in many cases due to extremely large dimensions.

International Journal of Modern Physics B•May 10, 2001•0 citations
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.
All known Quantum-Monte-Carlo algorithms for fermions suffer from the so-called “minus-sign-problem” which is detrimental to the application of these simulation methods to fermion systems at very low temperatures and/or of very many lattice sites. We identify the origin of this fundamental problem, demonstrate that it is a very general feature, not necessarily related to the presence of fermionic degrees of freedom. We describe an novel algorithm which does not suffer from the minus-sign problem. Illustrative results for the two-dimensional Hubbard model are presented
Computing quantum ground states is generically difficult, but additional structure can sometimes allow diagonalization to be recast as a more feasible problem. For example, when the desired ground state is sparse in a given basis, diagonalization can be facilitated via graph search. We make this reformulation precise by introducing the eigenwalk problem, which seeks the support of a sparse eigenvector of a Hermitian matrix by exploring the graph induced by its nonzero entries. However, it is not obvious whether the relevant support vertices must always be efficiently reachable by a search on the graph. To resolve this question, we prove that for every sparse eigenvector, there exists a (possibly different) sparse eigenvector with the same eigenvalue whose support is tightly localized in the graph, with diameter scaling only linearly in the sparsity and independently of the total number of vertices. As a consequence, if a 2n2^n2n-dimensional, poly(n){\rm poly}(n)poly(n)-sparse Hamiltonian has an O(1)\mathcal{O}(1)O(1)-sparse extremal eigenvector and one support element is known, then an exact eigenvector with the same eigenvalue can be computed classically in poly(n){\rm poly}(n)poly(n) time. The same conclusion follows when the O(1)\mathcal{O}(1)O(1)-sparse eigenvector is non-extremal, provided that it is sparser than every eigenvector with a different eigenvalue. These results hold with no assumptions on the degeneracy, locality, spectral width, or spectral gap of the Hamiltonian, and the underlying support-localization principle also extends to problems beyond exact diagonalization, such as sparse principal component analysis.
Several issues in the modal approach to quantum field theory are discussed. Within the formalism of spherical field theory, differential renormalization is presented and shown to result in a finite number of renormalization parameters. Computations of the massless Thirring model in 1+1 dimensions are presented using this approach. Diagonalization techniques in periodic field theory are demonstrated. Issues of very large Hilbert spaces are considered and several approaches are presented. The quasi sparse eigenvector (QSE) approach takes advantage of the relatively small number of basis states that typically contribute significantly to any particular eigenvector. Stochastic correction methods use Monte Carlo calculations to calculate higher order corrections to the quasi sparse result. The quasi sparse eigenvector method and stochastic error correction are applied to the Hubbard model. With U/t=4, the shift in the ground energy below the U=0 value is found to within 1% for the 8x8 Hubbard model with 25/64 filling.
The formulation and recent applications of the Quantum Monte Carlo diagonalization (QMCD) method are reported. The QMCD has been proposed for solving the quantum many-body inteacting systems, providing us with energy eigenvalues, transition matrix elements and wave functions. Its application to the nuclear shell model is referred to as the Monte Carlo Shell Model. By the Monte Carlo Shell Model calculations, the level structure of low-lying states can be studied with realistic interactions, providing a useful tool for nuclear spectroscopy. The Monte Carlo Shell Model has been applied to the study of a variety of nuclei, and can be characterized as the importance truncation scheme to the full diagonalization which is infeasible in many cases due to extremely large dimensions.