Related papers: Direct algebraic mapping transformation for decora…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
We present a new technique for the design of transformation-optics devices based on large-scale optimization to achieve the optimal effective isotropic dielectric materials within prescribed index bounds, which is computationally cheap…
We revisit the Jordan-Wigner transformation, showing that --rather than a non-local isomorphism between different fermionic and spin Hamiltonian operators-- it can be viewed in terms of local identities relating different realizations of…
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous…
Stripe patterns are ubiquitous in nature and everyday life. While the synthesis of these patterns has been thoroughly studied in the literature, their potential to control the mechanics of structured materials remains largely unexplored. In…
We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…
From condensed matter to quantum chromodynamics, multidimensional spins are a fundamental paradigm, with a pivotal role in combinatorial optimization and machine learning. Machines formed by coupled parametric oscillators can simulate spin…
This work addresses models (e.g. potential models of directed orbital systems- the manganates) in which an effective reduction dimensionality occurs as a result of a new symmetry which is intermediate between that of global and local gauge…
In this work, we study theoretical models of \emph{programmable matter} systems. The systems under consideration consist of spherical modules, kept together by magnetic forces and able to perform two minimal mechanical operations (or…
A mixed Ising-Heisenberg spin system consisting of triangular XXZ-Heisenberg spin clusters assembled into a chain by alternating with Ising spins interacting to all three spins in the triangle is considered. The exact solution of the model…
The Ising model provides a natural mapping for many computationally hard combinatorial optimization problems (COPs). Consequently, dynamical system-inspired computing models and hardware platforms that minimize the Ising Hamiltonian, have…
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…
In the history of computer-aided design (CAD), feature-based parametric modeling and boundary representation-based direct modeling are two of the most important CAD paradigms, developed respectively in the late 1980s and the late 2000s.…
By applying a recently proposed mapping, we derive exactly the upper phase boundary of several Ising spin glass models defined over static graphs and random graphs, generalizing some known results and providing new ones.
I derive a dual description of lattice fermions, specifically focusing on the t-J and Hubbard models, that allow diagrammatic techniques to be employed efficiently in the strongly correlated regime, as well as for systems with a restricted…
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence…
We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…
Designing metamaterials that carry out advanced computations poses a significant challenge. A powerful design strategy splits the problem into two steps: First, encoding the desired functionality in a discrete or tight-binding model, and…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…