Related papers: Lanczos Boosted Numerical Linked-Cluster Expansion…
We reformulate the Lanczos algorithm for quantum wave function propagation in terms of variational principle. By including some basis states of previous time steps into the variational subspace, the resultant accuracy increases by several…
The linked cluster expansion has been shown to be highly efficient in calculating equilibrium and nonequilibrium properties of a variety of 1D and 2D classical and quantum lattice models. In this article, we extend the linked cluster method…
We analyze one-dimensional classical and quantum microscopic lattice-gas models governed by a lattice Boltzmann equation at the mesoscopic scale, achieved by ensemble averaging over microscopic realizations. The models are governed by the…
We study the phase structure of QCD at finite temperature and density by numerical simulations on a lattice. The most important point for the numerical study at finite density is treatment of the sign problem. We propose a method to avoid…
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art…
The linked-cluster expansion technique for the high-temperature expansion of spin model is reviewed. A new algorithm for the computation of three-point and higher Green's functions is presented. Series are computed for all components of…
We introduce a Monte Carlo method, as a modification of existing cluster algorithms, which allows simulations directly on systems of infinite size, and for quantum models also at beta=infinity. All two-point functions can be obtained,…
The classical formalism of the Moment Problem has been combined with a cumulant approach and applied to the extensive many-body problem. This has yielded many new exact results for many-body systems in the thermodynamic limit - for the…
Finite mixture models have become a popular tool for clustering. Amongst other uses, they have been applied for clustering longitudinal data and clustering high-dimensional data. In the latter case, a latent Gaussian mixture model is…
The theory of a novel bond-order potential, which is based on the block Lanczos algorithm, is presented within an orthogonal tight-binding representation. The block scheme handles automatically the very different character of sigma and pi…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
For the paradigmatic frustrated spin-half Heisenberg antiferromagnet on the kagome lattice we performed large-scale numerical investigation of thermodynamic functions by means of the finite-temperature Lanczos method for system sizes of up…
We present a quantum Monte Carlo investigation of the finite-temperature phase diagram of the quantum dimer model on the square lattice. We use the sweeping cluster algorithm, which allows to implement exactly the dimer constraint,…
The exact quantum dynamics of lattice models can be computationally intensive, especially when aiming for large system sizes and extended simulation times necessary to converge transport coefficients. By leveraging finite memory times to…
A method of cluster diagonalization in a systematically expanded Hilbert space is described. We discuss some applications of this procedure to models of high-T_c superconductors, like the t - J and one and three bands Hubbard models in two…
The unitary coupled cluster (UCC) approximation is one of the more promising wave-function ans\"atze for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems…
A method based on Rayleigh-Schroedinger perturbation theory is developed that allows to obtain high-order series expansions for ground-state properties of quantum lattice models. The approach is capable of treating both lattice geometries…
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an…
Frustrated quantum spin systems such as the Heisenberg and Kitaev models on various lattices, have been known to exhibit various exotic properties not only at zero temperature but also for finite temperatures. Inspired by the remarkable…
One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering…