DanceQ: High-performance library for number-conserving bases
Robin Sch\"afer, David J. Luitz

TL;DR
DanceQ introduces a scalable, efficient C++20 library for handling number-conserving bases in quantum many-body problems, enabling faster computations by mapping basis states without full Hamiltonian storage.
Contribution
It presents a novel multi-dimensional divide-and-conquer algorithm for indexing basis states in particle number sectors, generalizing previous methods for scalability.
Findings
Provides a scalable algorithm for basis state indexing
Delivers a flexible, open-source C++20 implementation
Enhances efficiency of quantum many-body computations
Abstract
The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the wave function, where one simply accepts the enormous Hilbert space dimensions and performs linear algebra operations, e.g., for finding the ground state of the Hamiltonian. If the system satisfies an underlying symmetry where an operator with degenerate spectrum commutes with the Hamiltonian, it can be block-diagonalized, thus reducing the complexity at the expense of additional bookkeeping. At the most basic level, required for Krylov space techniques (like the Lanczos algorithm) it is necessary to implement a matrix-vector product of a block of the Hamiltonian with arbitrary block-wavefunctions, potentially without holding the Hamiltonian block in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Digital Filter Design and Implementation · Computational Physics and Python Applications
