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

While the well-established $GW$ approximation corresponds to a resummation of the direct ring diagrams and is particularly well suited for weakly-correlated systems, the $T$-matrix approximation does sum ladder diagrams up to infinity and…

For a long time, the predictive limits of perturbative quantum field theory have been limited by our inability to carry out loop calculations to arbitrarily high order, which become increasingly complex as the order of perturbation theory…

We modify the path integral representation of exciton transport in open quantum systems such that an exact description of the quantum fluctuations around the classical evolution of the system is possible. As a consequence, the time…

We introduce and analyze a novel quantum machine learning model motivated by convolutional neural networks. Our quantum convolutional neural network (QCNN) makes use of only $O(\log(N))$ variational parameters for input sizes of $N$ qubits,…

In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming. We introduce the path in the hypercube problem that models many of these dynamic…

We consider the problem of reconstructing a rank-$k$ $n \times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it…

We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…

We show how to extract the scaling behavior of quantum walks using the renormalization group (RG). We introduce the method by efficiently reproducing well-known results on the one-dimensional lattice. As a nontrivial model, we apply this…

We present a randomized approximation algorithm for computing traveling salesperson tours in undirected regular graphs. Given an $n$-vertex, $k$-regular graph, the algorithm computes a tour of length at most $\left(1+\frac{7}{\ln…

The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…

We complete the leading-log renormalization group scaling of the NRQCD Lagrangian at $O(1/m^2)$. The next-to-next-to-leading-log renormalization group scaling of the potential NRQCD Lagrangian (as far as the singlet is concerned) is also…

Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for Max-k-Cut and the Max-Agree variant of correlation clustering…

We develop an efficient numerical method to study the quantum critical behavior of disordered systems with $\mathcal{O}(N)$ order-parameter symmetry in the large$-N$ limit. It is based on the iterative solution of the large$-N$ saddle-point…

We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…

Wilson's approximation scheme of RG recursion formula dropping momentum dependence of the propagators is applied to large-$N$ vector and matrix models in dimensions $2<d<4$ by making use of their exact solutions in zero dimension. In spite…

We consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred when the job is completed at a particular time. The…

We compute the corrections of next to leading order in the ${1 \over N}$ expansion to the effective potential of a system described by a Ginzburg-Landau model with $N$ components and quartic interaction, in the case of spontaneous symmetry…

We present a near-optimal polynomial-time approximation algorithm for the asymmetric traveling salesman problem for graphs of bounded orientable or non-orientable genus. Our algorithm achieves an approximation factor of O(f(g)) on graphs…

We compare two different approaches to the treatment of the Wheeler-DeWitt equation and the introduction of time in quantum cosmology. One approach is based on the gauge-fixing procedure in theories with first-class constraints, while the…

The simulation of quantum transport in nanodevices requires the solution of the Dyson and Keldysh equations, a task dominated by the inversion of massive, block-tridiagonal matrices. While the Recursive Green's Function (RGF) method has…