相关论文: Resumming the large-N approximation for time evolv…

This article presents a novel algorithmic methodology for performing automated diagrammatic deductions over combinatorial structures, using a combination of modified equational theorem-proving techniques and the extended Wolfram model…

A numerical method is presented for reproducing fermionic quantum gas microscope experiments in equilibrium. By employing nested componentwise direct sampling of fermion pseudo-density matrices, as they arise naturally in determinantal…

In a recently developed approximation technique for quantum field theory the standard one-loop result is used as a seed for a recursive formula that gives a sequence of improved Gaussian approximations for the generating functional. In this…

The thermodynamics of the O(N) linear and nonlinear sigma models in 3+1 dimensions is studied. We calculate the pressure to next-to-leading order in the 1/N expansion and show that at this order, temperature-independent renormalization is…

Numerical simulations of the quarkonium spin splittings are done in the framework of lattice nonrelativistic quantum chromodynamics (NRQCD). At leading order in the velocity expansion the spin splittings are of $O(M_Q v^4)$, where $M_Q$ is…

In the $k$-cut problem, we are given an edge-weighted graph $G$ and an integer $k$, and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connected components. The current best algorithms are an…

Low rank approximation has been extensively studied in the past. It is most suitable to reproduce rectangular like structures in the data. In this work we introduce a generalization using shifted rank-1 matrices to approximate…

The quantum transport through nanoscale junctions is governed by the charging energy $U$ of the device. We employ the recently developed scattering-states numerical renormalization group approach to open quantum systems to study…

We give new rounding schemes for SDP relaxations for the problems of maximizing cubic polynomials over the unit sphere and the $n$-dimensional hypercube. In both cases, the resulting algorithms yield a $O(\sqrt{n/k})$ multiplicative…

We develop an algorithm for estimating the values of a vector x in R^n over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we can recover x' with ||x' - x_S||_2 <= eps ||x - x_S||_2 with…

We check quantitatively the validity of some popular phenomenological approaches of QCD in simple models. Dispersion sum rules are considered within the ladder approximation of a field-theoretic model with OPE given by ordinary loop…

We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…

This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\log \log \log n)$ rounds and using this, we…

The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measures for the analysis of large small-world graphs $G = (V, E)$…

Langevin simulation provides an effective way to study collisional effects in beams by reducing the six-dimensional Fokker-Planck equation to a group of stochastic ordinary differential equations. These resulting equations usually have…

In this job, we will present a theory called Quantum Tomography that is the natural extension of the theory of detection of signals in classical telecommunications to Quantum Mechanics. This theory mainly consists in the reconstruction of a…

Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems.…

We adopt a two-dimensional tensor-network (TN) ansatz to simulate variational quantum algorithms on two-dimensional qubit architectures, demonstrating its capability to accurately simulate deep circuits through the Quantum Approximate…

In this paper the problem of tomographic reconstruction of states is investigated within the so-called Schwinger's picture of Quantum Mechanics in which a groupoid is associated with every quantum system. The attention is focused on spin…

We describe the first strongly subquadratic time algorithm with subexponential approximation ratio for approximately computing the Fr\'echet distance between two polygonal chains. Specifically, let $P$ and $Q$ be two polygonal chains with…