Related papers: Inapproximability for Antiferromagnetic Spin Syste…
Motivated by recent advancements in theoretical and experimental studies of the high-energy excitations on an antiferromagnetic trimer chain, we numerically investigate the quantum phase transition and composite dynamics in this system by…
We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these…
In the work, we study the averaged number of massive fermions above a low rapidity threshold $Y$, underlying the form-factor expansions of the spin-spin two-point correlators at an Euclidean distance $r$, in the 2D Ising QFT at the free…
We perform a systematic investigation on the ground state of an asymmetric two-leg spin ladder (where exchange couplings of the legs are unequal) with ferromagnetic (FM) nearest-neighbor interaction and diagonal anti-ferromagnetic…
The ferrimagnetic phase of the sawtooth chain with mixed ferromagnetic nearest-neighbour interactions $J$ and antiferromagnetic next-nearest-neighbour interactions $J'$ (within the isotropic Heisenberg model) was previously characterized as…
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by…
For any $\varepsilon > 0$, we give a polynomial-time $n^\varepsilon$-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an $O(1)$-sequence. This result is derived from the following time-approximation…
We study the fair k-set selection problem where we aim to select $k$ sets from a given set system such that the (weighted) occurrence times that each element appears in these $k$ selected sets are balanced, i.e., the maximum (weighted)…
Using results on topological band theory of phases of matter and discrete symmetries, we study topological properties of band structure of physical systems involving spin $\frac{1}{2}$ and $\frac{3}{2}$ fermions. We apply this approach to…
We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme…
The linear perturbation group transformation (LPRG) is used to study the thermodynamics of the axial next-nearest-neighbor Ising model with four spin interactions (extended ANNNI) in a field. The LPRG for weakly interacting Ising chains is…
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin…
A fundamental question in systems biology is what combinations of mean and variance of the species present in a stochastic biochemical reaction network are attainable by perturbing the system with an external signal. To address this…
Frustration is a ubiquitous phenomenon in many-body physics that influences the nature of the system in a profound way with exotic emergent behavior. Despite its long research history, the analytical or numerical investigations on…
We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlation and response functions (as for fully connected systems),…
We study the zero-temperature phase diagram of the 2D spin-imbalanced Fermi gas with short-ranged attractive interactions using the recently developed neural network variational Monte Carlo method with the AGPs FermiNet Ansatz. The…
Clock-spin models are attracting great interest, due to both their rich phase diagram and their connection to parafermions. In this context, we derive an exact local mapping from clock-spin to fermionic partition functions. Such mapping,…
Graph isomorphism, subgraph isomorphism, and maximum common subgraphs are classical well-investigated objects. Their (parameterized) complexity and efficiently tractable cases have been studied. In the present paper, for a given set of…
We study complex zeros of the partition function of 2-spin systems, viewed as a multivariate polynomial in terms of the edge interaction parameters and the uniform external field. We obtain new zero-free regions in which all these…
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a $(1+\epsilon)$…