Related papers: Order-to-chaos transition in the hardness of rando…
We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…
Alongside the effort underway to build quantum computers, it is important to better understand which classes of problems they will find easy and which others even they will find intractable. We study random ensembles of the QMA$_1$-complete…
In order to simulate observational and experimental situations, we consider a leak in the phase space of a chaotic dynamical system. We obtain an expression for the escape rate of the survival probability applying the theory of transient…
We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a class of random constraint satisfaction problems, a limited…
We consider Rayleigh particles in a periodically modulated optical trap formed by two counter-propagating Gaussian beams. It is shown that for certain values of parameters the system exhibits transient chaos which manifests itself in…
Stable chaos is a generalization of the chaotic behaviour exhibited by cellular automata to continuous-variable systems and it owes its name to an underlying irregular and yet linearly stable dynamics. In this review we discuss analogies…
Periodicity plays a significant role in the chaos theory from the beginning since the skeleton of chaos can consist of infinitely many unstable periodic motions. This is true for chaos in the sense of Devaney [1], Li-Yorke [2] and the one…
This paper studies how complicated and irregular behavior, known as chaos, can arise in a simple mathematical model that includes time delays. The model is a delay differential equation in which the present rate of change depends not only…
For several models of random constraint satisfaction problems, it was conjectured by physicists and later proved that a sharp satisfiability transition occurs. For random $k$-SAT and related models it happens at clause density $\alpha$…
Chaos transition, as an important topic, has become an active research subject in non-linear science. By considering a Dicke Hamiltonian coupled to a bath of harmonic oscillator, we have been able to introduce a logistic map with quantum…
Chaos sets a fundamental limit to quantum-information processing schemes. We study the onset of chaos in spatially extended quantum many-body systems that are relevant to quantum optical devices. We consider an extended version of the…
We propose a neural network model with transient chaos, or a transiently chaotic neural network (TCNN) as an approximation method for combinatorial optimization problem, by introducing transiently chaotic dynamics into neural networks.…
We report a dynamical phase transition from integrability to non-integrability in a simple oval-like billiard with boundary $R(\theta)=1+\epsilon\cos(p\theta)$. For $\epsilon=0$, the phase space is {\it foliated} by invariant curves…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…
Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely…
$Circuit~ Complexity$, a well known computational technique has recently become the backbone of the physics community to probe the chaotic behaviour and random quantum fluctuations of quantum fields. This paper is devoted to the study of…
Optimization problems such as the NP-complete 3-SAT provide an important benchmark for the difficult task of finding ground-states in strongly correlated many-body systems with rugged energy landscapes. The study of random 3-SAT problems as…
We study the long time behaviour of the transient before the collapse on the periodic attractors of a discrete deterministic asymmetric neural networks model. The system has a finite number of possible states so it is not possible to use…
Out-of-time-order correlators (OTOCs) have been proposed as a probe of chaos in quantum mechanics, on the basis of their short-time exponential growth found in some particular set-ups. However, it has been seen that this behavior is not…
Natural systems often exhibit chaotic behavior in their space-time evolution. Systems transiting between chaos and order manifest a potential to compute, as shown with cellular automata and artificial neural networks. We demonstrate that…