English
Related papers

Related papers: Uniqueness, Spatial Mixing, and Approximation for …

200 papers

A fractal approach to numerical analysis of electromagnetic space-time crystals, created by three standing plane harmonic waves with mutually orthogonal phase planes and the same frequency, is presented. Finite models of electromagnetic…

Quantum Physics · Physics 2014-10-21 G. N. Borzdov

We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…

Data Structures and Algorithms · Computer Science 2026-04-03 Xiaoyu Chen , Zongchen Chen , Kuikui Liu , Xinyuan Zhang

We apply several state-of-the-art techniques developed in recent advances of counting algorithms and statistical physics to study the spatial mixing property of the two-dimensional codes arising from local hard (independent set)…

Information Theory · Computer Science 2014-02-26 Yi-Kai Wang , Yitong Yin , Sheng Zhong

The spatially periodic 2D patterns at output mirror of solid state microchip laser with high Fresnel number (100-1000) are discussed in view of numerical modeling with split-step FFT code comprising nonlinear gain, relaxation of inversion…

Optics · Physics 2014-10-21 A. Yu. Okulov

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…

Computational Complexity · Computer Science 2016-06-21 Andreas Galanis , Leslie Ann Goldberg

Recently, spatial photonic Ising machines (SPIM) have been demonstrated to compute the minima of Hamiltonians for large-scale spin systems. Here we propose to implement an antiferromagnetic model through optoelectronic correlation computing…

Emerging Technologies · Computer Science 2021-11-15 Junyi Huang , Yisheng Fang , Zhichao Ruan

We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach…

Data Structures and Algorithms · Computer Science 2021-02-02 Ryan L. Mann , Tyler Helmuth

The equations of motion of a single particle subject to an arbitrary electric and a static magnetic field form a Poisson system. We present a second-order time integration method which preserves well the Poisson structure and compare it to…

Numerical Analysis · Mathematics 2016-01-06 Christian Knapp , Alexander Kendl , Antti Koskela , Alexander Ostermann

Spectral polynomial approximation of smooth functions allows real-time manipulation of and computation with them, as in the Chebfun system. Extension of the technique to two-dimensional and three-dimensional functions on hyperrectangles has…

Numerical Analysis · Mathematics 2019-01-21 Kevin W. Aiton , Tobin A. Driscoll

In recent years, a method for computing spin dynamics at infinite temperature (spinDMFT) was developed. It utilizes the ideas of dynamical mean-field theory for fermions: single-site approximation and a self-consistency condition to…

Strongly Correlated Electrons · Physics 2026-04-24 Przemysław Bieniek , Timo Gräßer , Götz S. Uhrig

We consider the Partition problem and propose a deterministic FPTAS (Fully Polynomial-Time Approximation Scheme) that runs in $\widetilde{O}(n + 1/\varepsilon)$-time. This is the best possible (up to a polylogarithmic factor) assuming the…

Data Structures and Algorithms · Computer Science 2025-01-23 Lin Chen , Jiayi Lian , Yuchen Mao , Guochuan Zhang

We introduce a pair of novel difference equations, whose solutions are expressed in terms of Racah or Wilson polynomials depending on the nature of the finite-difference step. A number of special cases and limit relations are also examined,…

Mathematical Physics · Physics 2016-04-25 E. I. Jafarov , N. I. Stoilova , J. Van der Jeugt

We study classic scheduling problems on uniformly related machines. Efficient polynomial time approximation schemes (EPTAS's) are fast and practical approximation schemes. New methods and techniques are essential in developing such improved…

Data Structures and Algorithms · Computer Science 2014-04-04 Leah Epstein , Asaf Levin

We describe a new algorithm for the integration of self-gravitating fluid systems using SPH method. We split the Hamiltonian of a self-gravitating fluid system to the gravitational potential and others (kinetic and internal energies) and…

Instrumentation and Methods for Astrophysics · Physics 2015-05-13 Takayuki R. Saitoh , Junichiro Makino

The fractionalization of microscopic degrees of freedom is a remarkable manifestation of strong interactions in quantum many-body systems. Analytical studies of this phenomenon are primarily based on two distinct frameworks: field theories…

Strongly Correlated Electrons · Physics 2021-01-06 Eyal Leviatan , David F. Mross

Toroidal classification and geometric duality in quantum spin systems is presented. Through our classification and duality, we reveal that various bipartite quantum features in magnon-systems can manifest equivalently in both bipartite…

We study the competition between ferromagnetic and spin glass phases using a system of coupled infinite-range Ising and Sherrington-Kirkpatrick models. We obtain the replica-symmetric solution for the free energy of this system in terms of…

Disordered Systems and Neural Networks · Physics 2023-06-28 Fateme Izadi , Reza Sepehrinia

The variational determination of the two-fermion reduced density matrix is described for harmonically trapped, ultracold few-fermion systems in one dimension with equal spin populations. This is accomplished by formulating the problem as a…

Quantum Gases · Physics 2022-11-11 Mitchell J. Knight , Harry M. Quiney , Andy M. Martin

We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…

Data Structures and Algorithms · Computer Science 2019-02-12 Srikrishnan Divakaran

We present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to…

Computational Engineering, Finance, and Science · Computer Science 2022-01-05 Ziliang Kang , Daniel A. Tortorelli , Kai A. James