ﻻ يوجد ملخص باللغة العربية
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.
Impurities, defects, and other types of imperfections are ubiquitous in realistic quantum many-body systems and essentially unavoidable in solid state materials. Often, such random disorder is viewed purely negatively as it is believed to prevent int
A gapped many-body system is described by path integral on a space-time lattice $C^{d+1}$, which gives rise to a partition function $Z(C^{d+1})$ if $partial C^{d+1} =emptyset$, and gives rise to a vector $|Psirangle$ on the boundary of space-time if
Ab initio methods aim to solve the nuclear many-body problem with controlled approximations. Virtually exact numerical solutions for realistic interactions can only be obtained for certain special cases such as few-nucleon systems. Here we extend the
The computation of determinants plays a central role in diagrammatic Monte Carlo algorithms for strongly correlated systems. The evaluation of large numbers of determinants can often be the limiting computational factor determining the number of atta
Quantum coherence quantifies the amount of superposition a quantum state can have in a given basis. Since there is a difference in the structure of eigenstates of the ergodic and many-body localized systems, we expect them also to differ in terms of