Related papers: Constructing Dynamical Systems to Model Higher Ord…
Planning for multi-robot teams in complex environments is a challenging problem, especially when these teams must coordinate to accomplish a common objective. In general, optimal solutions to these planning problems are computationally…
Physical Ising machines rely on nature to guide a dynamical system towards an optimal state which can be read out as a heuristical solution to a combinatorial optimization problem. Such designs that use nature as a computing mechanism can…
A systematic study of both classical and quantum geometric frustrated Ising models with a competing ordering mechanism is reported in this paper. The ordering comes in the classical case from a coupling of 2D layers and in the quantum model…
Classical multi-scale methods involving two spatial scales face significant challenges when simulating heterogeneous structures with complicated three-scale spatial configurations. This study proposes an innovative higher-order three-scale…
This paper presents a new technique for the design of approximate reasoning based controllers for dynamic physical systems with interacting goals. In this approach, goals are achieved based on a hierarchy defined by a control knowledge base…
We introduce new fast canonical local algorithms for discrete and continuous spin systems. We show that for a broad selection of spin systems they compare favorably to the known ones except for the Ising +/-1 spins. The new procedures use…
We study the 2D Ising model on a square lattice with additional non-equal diagonal next-nearest neighbor interactions. The cases of classical and quantum (transverse) models are considered. Possible phases and their locations in the space…
We consider the problem of learning the underlying graph of an unknown Ising model on p spins from a collection of i.i.d. samples generated from the model. We suggest a new estimator that is computationally efficient and requires a number…
In this work, we consider a parameterized Ising model with long-range symmetric pairwise interactions on a network of spin $\frac{1}{2}$ particles. The system is designed with symmetric dynamics, allowing for the reduction of the state…
This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from geometric optimization and characterize their differentiable properties. We design and analyze a collection of…
We solve for the dynamics of a pair of spins, coupled to each other and also to an environmental sea of oscillators. The environment mediates an indirect interaction between the spins, causing both mutual coherence effects and dissipation.…
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad…
Simulation of contact and friction dynamics is an important basis for control- and learning-based algorithms. However, the numerical difficulties of contact interactions pose a challenge for robust and efficient simulators. A…
We study analytically the performance of a recently proposed algorithm for learning the couplings of a random asymmetric kinetic Ising model from finite length trajectories of the spin dynamics. Our analysis shows the importance of the…
Conventional computing architectures have no known efficient algorithms for combinatorial optimization tasks, which are encountered in fundamental areas and real-world practical problems including logistics, social networks, and…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
To investigate novel aspects of pattern formation in spin systems, we use a mapping between reactive concentrations in a reaction-diffusion system and spin orientations in a dynamic multiple-spin Ising model. While pattern formation in…
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 report our research on disordered complex systems using cold gases and trapped ions, and address the possibility of using complex systems for quantum information processing. Two simple paradigmatic models of disordered complex systems…
In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to…