Related papers: Performance of a worm algorithm in $\phi^4$ theory…
We calculate the finite temperature effective potential of $\lambda\phi^4$ at the two loop order of the 2PPI expansion. This expansion contains all diagrams which remain connected when two lines meeting at the same point are cut and…
We study the conformal bootstrap for a 4-point function of fermions $\langle\psi\psi\psi\psi\rangle$ in 3D. We first introduce an embedding formalism for 3D spinors and compute the conformal blocks appearing in fermion 4-point functions.…
The dual form of the massless Schwinger model on the lattice overcomes the complex action problems from two sources: a topological term, as well as non-zero chemical potential, making these physically interesting cases accessible to Monte…
An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…
A new method to compute observables at many values of the parameters \lambda for a model with lattice action {\cal{S}}(\phi, \lambda) is described. After fixing a reference set \lambda^r of parameters, a single simulation is carried out by…
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and…
We study the problem of existence of static spherically symmetric wormholes supported by the kink-like configuration of a scalar field. With this aim we consider a self-consistent, real, nonlinear, nonminimally coupled scalar field $\phi$…
We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
We describe an adaptive multigrid algorithm for solving inverses of the domain-wall fermion operator. Our multigrid algorithm uses an adaptive projection of near-null vectors of the domain-wall operator onto coarser four-dimensional…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We report results of a Monte Carlo simulation of the $\phi^4$ quantum field theory using multigrid simulation techniques and a refined discretization scheme. The resulting accuracy of our data allows for a significant test of an analytical…
We describe a new method in lattice field theory to compute observables at various values of the parameters lambda_i in the action S[phi,lambda_i]. Firstly one performs a single simulation of a ``reference action'' S[phi^r, lambda_i^r] with…
We apply our previously developed approach to marginal quartic interactions in multiscalar QFTs, which shows that one-loop RG flows can be described in terms of a commutative algebra, to various models in 4d. We show how the algebra can be…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are…
In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…
We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…
We develop an efficient algorithm for evaluating divergent perturbation expansions of field theories in the bare coupling constant g_B for which we possess a finite number L of expansion coefficients plus two more informations: The…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…