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

Bulletin of the American Physical Society

A Quantum Algorithm for Symmetry-Exploitation in Exact Diagonalization of Quantum Many-Body Systems

Albert T. Schmitz, Sonika Johri

Published Mar 6, 2019• 0 citations
OpenAlex

Related papers

Large-scale Exact Diagonalization of spin models with non-Abelian symmetries for the study of Many-Body Localization

Rajat Kumar Panda

•Dec 20, 2018•0 citations

Sublattice coding algorithm and distributed memory parallelization for large-scale exact diagonalizations of quantum many-body systems

Alexander Wietek, Andreas Martin Läuchli

We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-$1/2$ particles can be successfully determined.

arXiv:1804.05028•Physical review. E•Sep 26, 2018•60 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

Implementing scalable matrix-vector products for the exact diagonalization methods in quantum many-body physics

Tom Westerhout, Bradford L. Chamberlain

Exact diagonalization is a well-established method for simulating small quantum systems. Its applicability is limited by the exponential growth of the Hamiltonian matrix that needs to be diagonalized. Physical symmetries are usually utilized to reduce the matrix dimension, and distributed-memory parallelism is employed to explore larger systems. This paper focuses on an implementation of the core distributed algorithms, with a special emphasis on the matrix-vector product. Instead of the conventional MPI+X paradigm, Chapel is chosen as the language in this work.

arXiv:2308.16712•International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 10, 2023•3 citations

Dynamical symmetry approach to quantum many-body problems

Vasilios Alexiades, George Siopsis

AMS/IP studies in advanced mathematics•Jul 28, 1999•0 citations

A Many--Body Hamiltonian Approach to Quantum Computation

Mario Rasetti, Elena Tagliati, Paolo Zanardi +1 more

•Jan 1, 1996•0 citations
We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in exact diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of symmetry-adapted wave functions. Moreover, a parallelization scheme for the Hamiltonian-vector multiplication in the Lanczos procedure for distributed memory machines avoiding load-balancing problems is proposed. We demonstrate that using these methods low-energy properties of systems of up to 50 spin-1/21/21/2 particles can be successfully determined.
Exact diagonalization is a well-established method for simulating small quantum systems. Its applicability is limited by the exponential growth of the Hamiltonian matrix that needs to be diagonalized. Physical symmetries are usually utilized to reduce the matrix dimension, and distributed-memory parallelism is employed to explore larger systems. This paper focuses on an implementation of the core distributed algorithms, with a special emphasis on the matrix-vector product. Instead of the conventional MPI+X paradigm, Chapel is chosen as the language in this work.