Related papers: Dynamical vertex approximation in its parquet impl…
Quantifying uncertainties in hyperbolic equations is a source of several challenges. First, the solution forms shocks leading to oscillatory behaviour in the numerical approximation of the solution. Second, the number of unknowns required…
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, $\gamma=M/N$. We introduce a…
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…
While key effects of the many-body problem---such as Kondo and Mott physics---can be understood in terms of on-site correlations, non-local fluctuations of charge, spin, and pairing amplitudes are at the heart of the most fascinating and…
We investigate a quasicontinuum method by means of analytical tools. More precisely, we compare a discrete-to-continuum analysis of an atomistic one-dimensional model problem with a corresponding quasicontinuum model. We consider next and…
We study the $\Gamma$-convergence of sequences of free-discontinuity functionals depending on vector-valued functions $u$ which can be discontinuous across hypersurfaces whose shape and location are not known a priori. The main novelty of…
Density matrix embedding theory (DMET) [Phys. Rev. Lett., 109, 186404 (2012)], introduced a new approach to quantum cluster embedding methods, whereby the mapping of strongly correlated bulk problems to an impurity with finite set of bath…
The indirect estimation of couplings in quantum dynamics relies on the measurement of the spectrum and the overlap of eigenvectors with some reference states. This data can be obtained by local measurements on some sites and eliminates the…
The Dynamical Cluster Approximation (DCA) is used to study non-local corrections to the dynamical mean field phase diagram of the two-dimensional Hubbard model. Regions of antiferromagnetic, d-wave superconducting, pseudo-gapped non-Fermi…
We examine a central approximation of the recently introduced Dynamical Cluster Approximation (DCA) by example of the Hubbard model. By both analytical and numerical means we study non-compact and compact contributions to the thermodynamic…
We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These…
We study the dynamical density matrix renormalization group (DDMRG) and time-dependent density matrix renormalization group (td-DMRG) algorithms in the ab initio context, to compute dynamical correlation functions of correlated systems. We…
The Dynamical Graph Grammar (DGG) formalism can describe complex system dynamics with graphs that are mapped into a master equation. An exact stochastic simulation algorithm may be used, but it is slow for large systems. To overcome this…
We employ the Dynamical Cluster Approximation (DCA) in conjunction with the Fluctuation Exchange Approximation (FLEX) to study the Hubbard model. The DCA is a technique to systematically restore the momentum conservation at the internal…
Large-$N$ galaxy surveys offer unprecedented opportunities to probe weak gravitation in galaxy dynamics that may contain correlations tracing background cosmology. Of particular interest is the potential of finite sensitivities to the…
We develop a supersymmetric field theoretical description of the Gaussian ensemble of the almost diagonal Hermitian Random Matrices. The matrices have independent random entries H_{ij} with parametrically small off-diagonal elements…
We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme, where its solution is encoded into certain set of suitable basis functions. We…
Fractal dimensions are tools for probing the structure of quantum states and identifying whether they are localized or delocalized in a given basis. These quantities are commonly extracted through finite-size scaling, which limits the…
The discrete-dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. In this paper we perform systematic study of various non-stationary iterative (conjugate gradient)…
We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Thus far, promising quantum algorithms have been proposed to simulate quantum dynamics in…