相关论文: Loop Calculus and Bootstrap-Belief Propagation for…

Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields. BP is used to compute marginal distributions or maximum likelihood assignments and has…

This paper introduces weighted-BMP, a variant of the Bandwidth Minimization Problem (BMP), with a significant application in optimizing quantum emulation. Weighted-BMP optimizes particles ordering to reduce the emulation costs, by designing…

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a…

We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including…

We continue our study of the defect CFT on a Maldacena-Wilson line in N=4 Super-Yang-Mills theory using Bootstrability -- the conformal bootstrap supplemented with exact integrability data. In this paper, we extend this program to charged…

We study the constraints of crossing symmetry and unitarity for conformal field theories in the presence of a boundary, with a focus on the Ising model in various dimensions. We show that an analytic approach to the bootstrap is feasible…

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the…

Efficient and realistic error decoding is crucial for fault-tolerant quantum computation (FTQC) on near-term devices. While decoding is a classical post-processing task, its effectiveness depends on accurately modeling quantum noise, which…

We investigate the non-BPS realm of 3d ${\cal N} = 4$ superconformal field theory by uniting the non-perturbative methods of the conformal bootstrap and supersymmetric localization, and utilizing special features of 3d ${\cal N} = 4$…

We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…

The combination of integrability and crossing symmetry has proven to give tight non-perturbative bounds on some planar structure constants in $\mathcal{N}$=4 SYM, particularly in the setup of defect observables built on a Wilson-Maldacena…

We formulate the Alternating Current Optimal Power Flow Problem (ACOPF) as a Linear Constrained Quadratic Program (LCQP) with many negative eigenvalues ($r$) and linear constraints, making it NP-hard. We propose two algorithms, Feasible…

We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…

Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal value function by a set of basis functions and optimize…

A novel unconstrained optimization model named weighted trace-penalty minimization (WTPM) is proposed to address the extreme eigenvalue problem arising from the Full Configuration Interaction (FCI) method. Theoretical analysis shows that…

We study the approximate maximum weight matching (MWM) problem in a fully dynamic graph subject to edge insertions and deletions. We design meta-algorithms that reduce the problem to the unweighted approximate maximum cardinality matching…

Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general.…

Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…

This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…

In the Weighted Triangle-Free 2-Matching problem (WTF2M), we are given an undirected edge-weighted graph. Our goal is to compute a maximum-weight subgraph that is a 2-matching (i.e., no node has degree more than $2$) and triangle-free…