English
Related papers

Related papers: The complexity of approximating the complex-valued…

200 papers

While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analogue random-field Potts model corresponds to a multi-terminal…

Disordered Systems and Neural Networks · Physics 2018-05-23 Manoj Kumar , Ravinder Kumar , Martin Weigel , Varsha Banerjee , Wolfhard Janke , Sanjay Puri

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

We study multivariate integration and approximation for functions belonging to a weighted reproducing kernel Hilbert space based on half-period cosine functions in the worst-case setting. The weights in the norm of the function space depend…

Numerical Analysis · Mathematics 2015-11-23 Christian Irrgeher , Peter Kritzer , Friedrich Pillichshammer

We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifolds (PLoM). It involves solving the spectral problem of the high-dimensional Fokker-Planck (FKP) operator,…

Quantum Physics · Physics 2025-02-21 Christian Soize , Loïc Joubert-Doriol , Artur F. Izmaylov

Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and we will show that these are not always equivalent. Our…

Quantum Physics · Physics 2007-05-23 Arvid J. Bessen

Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…

Disordered Systems and Neural Networks · Physics 2013-05-29 S. N. Coppersmith

For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…

Statistical Mechanics · Physics 2024-06-11 Atsushi Iwaki , Chisa Hotta

The critical properties of the 2D Ising and 3-state Potts models are investigated using Monte Carlo simulations. Special interest is given to measurement of 3-point correlation functions and associated universal objects, i.e. structure…

High Energy Physics - Lattice · Physics 2009-10-28 Gerard Barkema , John McCabe

We study graphical representations for two related models. The first model is the transverse field quantum Ising model, an extension of the original Ising model which was introduced by Lieb, Schultz and Mattis in the 1960's. The second…

Probability · Mathematics 2010-11-12 Jakob E. Björnberg

The analysis of correlation function data obtained by Monte Carlo simulations of the two-dimensional 4-state Potts model, XY model, and self-dual disordered Ising model at criticality are presented. We study the logarithmic corrections to…

Statistical Mechanics · Physics 2009-11-10 Bertrand Berche , Lev Shchur

We study the approximability of computing the partition functions of two-state spin systems. The problem is parameterized by a $2\times 2$ symmetric matrix. Previous results on this problem were restricted either to the case where the…

Computational Complexity · Computer Science 2025-08-19 Yumou Fei , Leslie Ann Goldberg , Pinyan Lu

We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…

Quantum Physics · Physics 2017-09-13 Sergey Bravyi , David Gosset

We consider the Potts model in a magnetic field on an arbitrary graph $G$. Using a formula of F. Y. Wu for the partition function $Z$ of this model as a sum over spanning subgraphs of $G$, we prove some properties of $Z$ concerning…

Statistical Mechanics · Physics 2015-05-13 Shu-Chiuan Chang , Robert Shrock

The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field…

Quantum Physics · Physics 2007-05-23 Dorit Aharonov , Vaughan Jones , Zeph Landau

We develop an analytical technique to derive explicit forms of thermodynamical quantities within the asymptotic approach to non-extensive quantum distribution functions. Using it, we find an expression for the number of particles in a boson…

Statistical Mechanics · Physics 2009-10-31 Ugur Tirnakli , Diego F. Torres

Analytical complexity of quantum wavefunction whose argument is extended into the complex plane provides an important information about the potentiality of manifesting complex quantum dynamics such as time-irreversibility, dissipation and…

Statistical Mechanics · Physics 2015-06-17 Hiroaki S. Yamada , Kensuke S. Ikeda

A new duality relation is derived for the Potts model in one dimension. It is shown that the partition function is self-dual with the nearest-neighbor interaction and the external field appearing as dual parameters. Zeroes of the partition…

Statistical Mechanics · Physics 2007-05-23 F. Y. Wu

This note is a stripped down version of a published paper on the Potts partition function, where we concentrate solely on the linear coding aspect of our approach. It is meant as a resource for people interested in coding theory but who do…

Information Theory · Computer Science 2008-03-17 Joseph Geraci , Frank Van Bussel

We propose a matrix-model derivation of the scaling exponents of the critical and tricritical q-states Potts model coupled to gravity on a sphere. In close analogy with the $O(n)$ model, we reduce the determination of the one-loop-to-vacuum…

High Energy Physics - Theory · Physics 2016-09-06 Jean-Marc DAUL

The Pareto sum of two-dimensional point sets $P$ and $Q$ in $\mathbb{R}^2$ is defined as the skyline of the points in their Minkowski sum. The problem of efficiently computing the Pareto sum arises frequently in bi-criteria optimization…

Computational Geometry · Computer Science 2026-03-27 Geri Gokaj , Marvin Künnemann , Sabine Storandt , Carina Truschel
‹ Prev 1 4 5 6 7 8 10 Next ›