Related papers: A practical solution to the sign problem in a matr…
We study simplified bootstrap problems for probability distributions on the infinite line and the circle. We show that the rapid convergence of the bootstrap method for problems on the infinite line is related to the fact that the smallest…
The Gaussian expansion has been developed since early 80s as a powerful analytical method, which enables nonperturbative studies of various systems using `perturbative' calculations. Recently the method has been used to suggest that 4d…
The emergence of (3+1)-dimensional expanding space-time in the Lorentzian type IIB matrix model is an intriguing phenomenon which was observed in Monte Carlo studies of this model. In particular, this may be taken as a support to the…
We discuss the adaptation of the Hybrid Monte Carlo algorithm to overlap fermions. We derive a method which can be used to account for the delta function in the fermionic force caused by the differential of the sign function. We discuss the…
Towards a solution to the sign problem in the simulations of systems having indefinite or complex-valued measures, we propose a new approach which yields statistical errors smaller than the crude Monte Carlo using absolute values of the…
Building on recent solutions of the fermion sign problem for specific models we present two continuous-time quantum Monte Carlo methods for efficient simulation of mass-imbalanced Hubbard models on bipartite lattices at half-filling. For…
We use string duality to describe instanton induced spontaneous supersymmetry breaking in string compactifications with additional background fields. Dynamical supersymmetry breaking by space-time instantons in the heterotic string theory…
We study supersymmetry breaking by Scherk-Schwarz compactifications in type I string theory. While in the gravitational sector all mass splittings are proportional to a (large) compactification radius, supersymmetry remains unbroken for the…
Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…
Current nonequilibrium Monte Carlo methods suffer from a dynamical sign problem that makes simulating real-time dynamics for long times exponentially hard. We propose a new `Inchworm Algorithm', based on iteratively reusing information…
Supersymmetry breaking and compactification of extra space-time dimensions may have a common dynamical origin if our universe is spontaneously generated in the form of a four-dimensional topological or non-topological defect in higher…
Higher-dimensional theories provide a promising framework for unified extensions of the supersymmetric standard model. Compactifications to four dimensions often lead to U(1) symmetries beyond the standard model gauge group, whose breaking…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
The self-healing diffusion Monte Carlo algorithm (SHDMC) [Phys. Rev. B {\bf 79}, 195117 (2009), {\it ibid.} {\bf 80}, 125110 (2009)] is shown to be an accurate and robust method for calculating the ground state of atoms and molecules. By…
We discuss the phenomenon of spontaneous symmetry breaking by means of a class of non-perturbative renormalization group flow equations which employ a regulating smearing function in the proper-time integration. We show, both analytically…
Coupling spin models to complex external fields can give rise to interesting phenomena like zeroes of the partition function (Lee-Yang zeroes, edge singularities) or oscillating propagators. Unfortunately, it usually also leads to a severe…
Matrix models are a promising candidate for a nonperturbative formulation of the superstring theory. It is possible to study how the standard model and other phenomenological models appear from the matrix model, and estimate the probability…
We investigate some issues relating to recently proposed fractional superstring theories with $D_{\rm critical}<10$. Using the factorization approach of Gepner and Qiu, we systematically rederive the partition functions of the $K=4,\, 8,$…
The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…
Sparse coding is a core building block in many data analysis and machine learning pipelines. Typically it is solved by relying on generic optimization techniques, that are optimal in the class of first-order methods for non-smooth, convex…