Related papers: Resumming the large-N approximation for time evolv…
In this work, we have introduced two innovative quantum algorithms: the Direct Column Algorithm and the Quantum Backtracking Algorithm to solve N-Queens problem, which involves the arrangement of $N$ queens on an $N \times N$ chessboard…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
In this lecture I present some of the new developments concerning the use of Pade Approximants (PA's) for resumming perturbative series in QCD. It is shown that PA's tend to reduce the renormalization scale and scheme dependence as compared…
We review the solutions of O(N) and U(N) quantum field theories in the large $N$ limit and as 1/N expansions, in the case of vector representations. Since invariant composite fields have small fluctuations for large $N$, the method relies…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
In the search for accurate approximate solutions of the many-body Schr\"odinger equation, reduced density matrices play an important role, as they allow to formulate approximate methods with polynomial scaling in the number of particles.…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
Given a set $S$ of $n$ points in the plane, we study the two-line-center problem: finding two lines that minimize the maximum distance from each point in $S$ to its closest line. We present a $(1+\varepsilon)$-approximation algorithm for…
In this paper we use an O(N)-invariant scalar field of unbroken symmetry to investigate whether an interacting quantum field at the next-to-leading order Large $N$ approximation may show signs of thermalization. We develop the closed…
Within the framework of field-theoretical description of second-order phase transitions via the 3-dimensional O(N) vector model, accurate predictions for critical exponents can be obtained from (resummation of) the perturbative series of…
Formulated is a new systematic method for obtaining higher order corrections in numerical simulation of stochastic differential equations (SDEs), i.e., Langevin equations. Random walk step algorithms within a given order of finite $\Delta…
An effective action technique for the time evolution of a closed system consisting of one or more mean fields interacting with their quantum fluctuations is presented. By marrying large $N$ expansion methods to the Schwinger-Keldysh closed…
A four-fermion model in 2+1 dimensions describing N Dirac fermions interacting via SU(N) invariant N^2-1 four-fermion interactions is solved in the leading order of the 1/N expansion. The 1/N expansion corresponds to 't Hoofts topological…
We study QED corrections to operator matrix elements involving heavy composite particles (e.g., heavy-mesons, nuclei, and atoms). We define a new notion of reducible and irreducible graphs which is useful for systems with many discrete…
Out-of-equilibrium quantum many-body systems exhibit rapid correlation buildup that underlies many emerging phenomena. Exact wave-function methods to describe this scale exponentially with particle number; simpler mean-field approaches…
Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…
One of the nicest results in cosmological perturbation theory is the analytical resummaton of the leading corrections at large momentum, which was obtained by Crocce and Scoccimarro for the propagator. Using an exact evolution equation, we…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
We study the doubly nonnegative (DNN) relaxation of the standard quadratic optimization problem \[ \min\{x^\top Qx:\ x\in\Delta^{n-1}\},\qquad \Delta^{n-1}:=\{x\in\mathbb{R}_+^n:\ \mathbb{1}^\top x=1\}, \] for random symmetric matrices with…
In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…