ﻻ يوجد ملخص باللغة العربية
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 attainable diagrammatic expansion orders. In this work we build upon the algorithm presented in [emph{Linear Algebra and its applications} 419.1 (2006), 107-124] which computes all principal minors of a matrix in $O(2^n)$ operations. We present multiple generalizations of the algorithm to the efficient evaluation of certain subsets of all principal minors with immediate applications to Connected Determinant Diagrammatic Monte Carlo within the normal and symmetry-broken phases as well as Continuous-time Quantum Monte Carlo. Additionally, we improve the asymptotic scaling of diagrammatic Monte Carlo formulated in real-time to $O(2^n)$ and report speedups of up to a factor $25$ at computationally realistic expansion orders. We further show that all permanent-principal-minors, corresponding to sums of bosonic Feynman diagrams, can be computed in $O(3^n)$, making diagrammatic Monte Carlo for bosonic and mixed systems a viable path worth exploring.
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
We present an approximative simulation method for quantum many-body systems based on coarse graining the space of the momentum transferred between interacting particles, which leads to effective Hamiltonians of reduced size with the flavor-twisted bo
Modeling many-body quantum systems with strong interactions is one of the core challenges of modern physics. A range of methods has been developed to approach this task, each with its own idiosyncrasies, approximations, and realm of applicability. Pe
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
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