Related papers: Resumming the large-N approximation for time evolv…
We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating…
We develop deterministic approximation algorithms for the minimum dominating set problem in the CONGEST model with an almost optimal approximation guarantee. For $\epsilon>1/{\text{{poly}}}\log \Delta$ we obtain two algorithms with…
In this paper, we propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKP). In particular, we study the solution structure of the problem without the knapsack constraint. We propose an $O(n\log n)$…
Knapsack is one of the most fundamental problems in theoretical computer science. In the $(1 - \epsilon)$-approximation setting, although there is a fine-grained lower bound of $(n + 1 / \epsilon) ^ {2 - o(1)}$ based on the $(\min,…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
The gaussian closure approximation previously used to study the growth kinetics of the non-conserved O(n) model is shown to be the zeroth-order approximation in a well-defined sequence of approximations composing a more elaborate theory.…
Generic quantum systems --as much as their classical counterparts-- pass arbitrarily close to their initial state after sufficiently long time. Here we provide an essentially exact computation of such recurrence times for generic…
We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…
Perturbative cross-sections in QCD are beset by logarithms of kinematic invariants, whose arguments vanish when heavy particles are produced near threshold. Contributions of this type often need to be summed to all orders in the coupling,…
Many applications of quantum simulation require to prepare and then characterize quantum states by performing an efficient partial tomography to estimate observables corresponding to $k$-body reduced density matrices ($k$-RDMs). For…
We solve the Balitsky-Kovchegov evolution equation at next-to-leading order accuracy including a resummation of large single and double transverse momentum logarithms to all orders. We numerically determine an optimal value for the constant…
Apparently convergent contributions of resummed perturbative series at the next-to-leading order of the 1/N expansion in the O(N) model are reanalyzed in terms of renormalizability. Compared to our earlier article [G. Fejos et al., Phys.…
This work considers the problem of approximating initial condition and time-dependent optimal control and trajectory surfaces using multivariable Fourier series. A modified Augmented Lagrangian algorithm for translating the optimal control…
This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b rectangles such that the sum of the weights of the points in P…
We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian $\boldsymbol{B}$, our algorithm…
Autonomous reconfiguration of agent-based systems is a key challenge in the study of programmable matter, distributed robotics, and molecular self-assembly. While substantial prior work has focused on size-preserving transformations, much…
In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum…
We globally quench the theory of two dimensional massless fermions (many flavours) with quartic interactions by making the quartic coupling a smooth function of time. Working in a derivative expansion we show that the discrete Z2 symmetry…
Here I present a new discrete model of quantum mechanics for relativistic 1-electron systems, in which particle movement is described by a directed space-time graph with attached 4-spinors, but without any continuous wave functions. These…