Related papers: Partial decidability protocol for the Wang tiling …
Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
The study of zeros of partition functions, initiated by Yang and Lee, provides an important qualitative and quantitative tool in the study of critical phenomena. This has frequently been used for periodic as well as hierarchical lattices.…
The problem of the insensitivity of the macroscopic behavior of any thermodynamical system to partitioning generates a bias between the reproducibility of its macroscopic behavior viewed as the simplest form of causality and its long-term…
Concepts like `typicality' and the `eigenstate thermalization hypothesis' aim at explaining the apparent equilibration of quantum systems, possibly after a very long time. However, these concepts are not concerned with the specific way in…
Consider a two-class classification problem where we observe samples $(X_i, Y_i)$ for i = 1, ..., n, $X_i \in R^p$ and $Y_i$ in {0, 1}. Given $Y_i = k$, $X_i$ is assumed to follow a multivariate normal distribution with mean $\mu_k \in R^k$…
We study the chaos of travelling waves (TW) in unidirectional chains of bistable maps. Previous numerical results suggested that this property is selective, {\sl viz.}\ given the parameters, there is at most a single (non-trivial) velocity…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
A systematically improvable wave function is proposed for the numerical solution of strongly correlated systems. With a stochastic optimization method, based on the auxiliary field quantum Monte Carlo technique, an effective temperature…
A nonextensive thermostatic approach to chaotic dynamical systems is developed by expressing generalized Tsallis distribution as escort distribution. We explicitly show the thermodynamic limit and also derive the Legendre Transform…
Estimating partition functions of Ising spin glasses is a cornerstone of statistical physics and computational science, yet it remains classically challenging due to its $\#$P-hard complexity. While Jarzynski's equality offers a theoretical…
Despite its putative robustness, the realization of and control over topological quantum matter is an ongoing grand challenge. Looking forward, robust characterization protocols are needed to first certify topological substrates before they…
We suggest a combinatorial method of encoding continuous symbolic dynamical systems. A~continuous phase space, the infinite-dimensional cube, turns into the path space of a tree, and the shift is mapped to a transformation which was called…
Today, hardware constraints are an important limitation on quantum adiabatic optimization algorithms. Firstly, computational problems must be formulated as quadratic unconstrained binary optimization (QUBO) in the presence of noisy coupling…
A large class of technically non-chaotic systems, involving scatterings of light particles by flat surfaces with sharp boundaries, is nonetheless characterized by complex random looking motion in phase space. For these systems one may…
We study topological order in a toric code in three spatial dimensions, or a 3+1D Z_2 gauge theory, at finite temperature. We compute exactly the topological entropy of the system, and show that it drops, for any infinitesimal temperature,…
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
The purpose of this paper is to present a universal approach to the study of controllability/observability problems for infinite dimensional systems governed by some stochastic/deterministic partial differential equations. The crucial…