Related papers: Order-to-chaos transition in the hardness of rando…
The transition from arbitrary to chaotic fluctuation properties in quantum systems is studied in a random matrix model. It is assumed that the Hamiltonian can be written as the sum of an arbitrary and a chaos producing part. The Gaussian…
This paper is concerned with Devaney chaos in non-autonomous discrete systems. It is shown that in its definition, the two former conditions, i.e., transitivity and density of periodic points, in a set imply the last one, i.e., sensitivity,…
Random $K$-satisfiability ($K$-SAT) is a model system for studying typical-case complexity of combinatorial optimization. Recent theoretical and simulation work revealed that the solution space of a random $K$-SAT formula has very rich…
We investigate chaos in mixed-phase-space Hamiltonian systems using time series of the finite- time Lyapunov exponents. The methodology we propose uses the number of Lyapunov exponents close to zero to define regimes of ordered…
In quantum/wave systems with chaotic classical analogs, wavefunctions evolve in highly complex, yet deterministic ways. A slight perturbation of the system, though, will cause the evolution to diverge from its original behavior increasingly…
We undertake a systematic study of the dynamics of Boolean networks to determine the origin of chaos observed in recent experiments. Networks with nodes consisting of ideal logic gates are known to display either steady states, periodic…
This study examines second-order dynamical systems incorporating Tikhonov regularization. It focuses on how nonlinearities induce bifurcations and chaotic dynamics. By using Lyapunov functions, bifurcation theory, and numerical simulations,…
There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known…
The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated. 3-SAT is a representative example of hard computational tasks; it consists in knowing whether a set of alpha N randomly drawn logical…
We explore the quantum chaos of the coadjoint orbit action. We study quantum fluctuation around a saddle point to evaluate the soft mode contribution to the out-of-time-ordered correlator. We show that the stability condition of the…
In this paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random…
We use the H\'enon-Heiles system as a paradigmatic model for chaotic scattering to study the Lorentz factor effects on its transient chaotic dynamics. In particular, we focus on how time dilation occurs within the scattering region by…
We examine phase transitions between the easy, hard, and the unsolvable phases when attempting to identify structure in large complex networks (community detection) in the presence of disorder induced by network noise (spurious links that…
In maximally chaotic quantum systems, a class of out-of-time-order correlators (OTOCs) saturate the Maldacena-Shenker-Stanford (MSS) bound on chaos. Recently, it has been shown that the same OTOCs must also obey an infinite set of…
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type methods that cap the possible advantage at only quadratic…
External and internal factors may cause a system's parameter to vary with time before it stabilizes. This drift induces a regime shift when the parameter crosses a bifurcation. Here, we study the case of an infinite dimensional system: a…
Let $\Phi$ be a uniformly random $k$-SAT formula with $n$ variables and $m$ clauses. We study the algorithmic task of finding a satisfying assignment of $\Phi$. It is known that satisfying assignments exist with high probability up to…
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically…
We explore the transition from order to chaos for the Bohmian trajectories of a simple quantum system corresponding to the superposition of three stationary states in a 2D harmonic well with incommensurable frequencies. We study in…
Complexity is an important metric for appropriate characterization of different classes of irregular signals, observed in the laboratory or in nature. The literature is already rich in the description of such measures using a variety of…