Related papers: Spin Systems and Computational Complexity
The dynamics of supercooled liquid and glassy systems are usually studied within the Lagrangian representation, in which the positions and velocities of distinguishable interacting particles are followed. Within this representation,…
We consider the basic features of complex dynamical and control systems. Special attention is paid to the problems of synthesis of dynamical models of complex systems, construction of efficient control models, and to the development of…
A point visibility graph is a graph induced by a set of points in the plane where the vertices of the graph represent the points in the point set and two vertices are adjacent if and only if no other point from the point set lies on the…
Economies are complex man-made systems where organisms and markets interact according to motivations and principles not entirely understood yet. The increasing dissatisfaction with the postulates of traditional economics i.e. perfectly…
We prove a correlation type inequality for spin systems with quenched symmetric random interactions. This gives monotonicity of the pressure with respect to the strength of the interaction for a class of spin glass models. Consequences…
We discuss the metastate, a probability measure on thermodynamic states, and its usefulness in addressing difficult questions pertaining to the statistical mechanics of systems with quenched disorder, in particular short-range spin glasses.…
Complex systems and their underlying convoluted networks are ubiquitous, all we need is an eye for them. They pose problems of organized complexity which cannot be approached with a reductionist method. Complexity science and its emergent…
This paper explores the issues around the construction of large-scale complex systems which are built as 'systems of systems' and suggests that there are fundamental reasons, derived from the inherent complexity in these systems, why our…
Systems engineering has developed a mature knowledge on how to design, integrate and manage complex industrial systems, whereas disciplines studying complex systems in nature or society also propose numerous tools for their understanding.…
We discuss the connection between computational social choice (comsoc) and computational complexity. We stress the work so far on, and urge continued focus on, two less-recognized aspects of this connection. Firstly, this is very much a…
Building software-driven systems that are easily understood becomes a challenge, with their ever-increasing complexity and autonomy. Accordingly, recent research efforts strive to aid in designing explainable systems. Nevertheless, a common…
The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints. It could be viewed as a special case of synchronization of a discrete event system under…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
In this work we study numerically a short range p-spin glass model in three dimensions. The behaviour of the model appears to be remarkably different from mean field predictions. In fact it shares some features typical of models with full…
Spin Glasses (SG) are paradigmatic models for physical, computer science, biological and social systems. The problem of studying the dynamics for SG models is NP hard, i.e., no algorithm solves it in polynomial time. Here we implement the…
In recent years inelastic spin-flip spectroscopy using a lowtemperature scanning tunneling microscope has been a very successful tool for studying not only individual spins but also complex coupled systems. When these systems interact with…
Experimental and theoretical progress toward quantum computation with spins in quantum dots (QDs) is reviewed, with particular focus on QDs formed in GaAs heterostructures, on nanowire-based QDs, and on self-assembled QDs. We report on a…
I shortly describe semi-classical models of spinning electron and list a number of theoretical issues where these models turn out to be useful, see arXiv:1710.07135 for details. Then I discuss the possibility to extend the range of…
A short review of the recent results and models of complex networks.
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…