Related papers: Double Precision Computation of the Logistic Map D…
Pairs of numerically computed trajectories of a chaotic system may coalesce because of finite arithmetic precision. We analyse an example of this phenomenon, showing that it occurs surprisingly frequently. We argue that our model belongs to…
$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…
We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation…
We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a…
A key operational challenge for call centers is to decide, in real time, which waiting customer should be served by which available agent. This is known as skill-based routing, and the decision becomes especially difficult in large systems…
We consider a family of singular maps as an example of a simple model of dynamical systems exhibiting the property of robust chaos on a well defined range of parameters. Critical boundaries separating the region of robust chaos from the…
Initially, the logistic map became popular as a simplified model for population growth. In spite of its apparent simplicity, as the population growth-rate is increased the map exhibits a broad range of dynamics, which include bifurcation…
In this paper a new concept, namely the critical predictable time $T_c$, is introduced to give a more precise description of computed chaotic solutions of nonlinear differential equations: it is suggested that computed chaotic solutions are…
Using the predictor-corrector scheme, the fractional order diffusionless Lorenz system is investigated numerically. The effective chaotic range of the fractional order diffusionless system for variation of the single control parameter is…
Designing chaotic maps with complex dynamics is a challenging topic. This paper introduces the nonlinear chaotic processing (NCP) model, which contains six basic nonlinear operations. Each operation is a general framework that can use…
We predict that continuously monitored quantum dynamics can be chaotic. The optimal paths between past and future boundary conditions can diverge exponentially in time when there is time-dependent evolution and continuous weak monitoring.…
Apparently random financial fluctuations often exhibit varying levels of complexity, chaos. Given limited data, predictability of such time series becomes hard to infer. While efficient methods of Lyapunov exponent computation are devised,…
The phase ordering dynamics of coupled chaotic maps on fractal networks are investigated. The statistical properties of the systems are characterized by means of the persistence probability of equivalent spin variables that define the…
Dual control denotes a class of control problems where the parameters governing the system are imperfectly known. The challenge is to find the optimal balance between probing, i.e. exciting the system to understand it more, and caution,…
Scrambling in interacting quantum systems out of equilibrium is particularly effective in the chaotic regime. Under time evolution, initially localized information is said to be scrambled as it spreads throughout the entire system. This…
We analyze the fate of dynamical systems that consist of two kind of processes. The first type is supposed to perform a certain function by processing information at a required high accuracy, which is, however, limited to less than 100…
Numerical bifurcation analysis, and in particular two-parameter continuation, is used in consort with numerical simulation to reveal complicated dynamics in the Mackey-Glass equation for moderate values of the delay close to the onset of…
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…
Statistical mechanics determines the abundance of different arrangements of matter depending on cost-benefit balances. Its formalism and phenomenology percolate throughout biological processes and set limits to effective computation. Under…
Quantum computers have recently made great strides and are on a long-term path towards useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum computation is the production of high-fidelity encoded qubits, called…