Related papers: Ultimate Limits to Computation: Anharmonic Oscilla…
The upper limit on what is computable in our universe is unknown, but widely believed to be set by the Turing machine -- with a function being physically computable if and only if it is Turing-computable. I show how this apparently mild…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
We devise a hierarchy of computational algorithms to enumerate the microstates of a system comprising N independent, distinguishable particles. An important challenge is to cope with integers that increase exponentially with system size,…
We study the time evolution of an ideal system composed of two harmonic oscillators coupled through a quadratic Hamiltonian with arbitrary interaction strength. We solve its dynamics analytically by employing tools from symplectic geometry.…
It is shown that a spin system is equivalent to a set of constrained harmonic oscillators. For finite, but large, systems, a continuous approximation to the density of states can be used, and the oscillator frequencies can be exactly…
The out-of-time-order correlator (OTOC) of simple harmonic oscillator with extra anharmonic (quartic) interaction are calculated by the second quantization method. We obtain the analytic formulas of spectrum, Fock space states and matrix…
We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations:…
In recent decades, several mathematical models describing the pacemaker activity of the rabbit sinoatrial node have been developed. We demonstrate that it is not possible to establish the existence, uniqueness, and stability of a limit…
We develop a numerical approach to reconstruct the phase dynamics of driven or coupled self-sustained oscillators. Employing a simple algorithm for computation of the phase of a perturbed system, we construct numerically the equation for…
For control systems that either have a fast explicit periodic dependence on time and bounded controls or have periodic solutions and small controls, we define an average control system that takes into account all possible variations of the…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
In this paper, we study some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. Time optimal control helps to minimize relaxation losses. The ability…
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…
We study stochastic convex optimization under infinite noise variance. Specifically, when the stochastic gradient is unbiased and has uniformly bounded $(1+\kappa)$-th moment, for some $\kappa \in (0,1]$, we quantify the convergence rate of…
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite…
The quantum speed limit indicates the maximal evolution speed of the quantum system. In this work, we determine speed limits on the informational measures, namely the von Neumann entropy, maximal information, and coherence of quantum…
Nonlinear dynamical systems such as coupled oscillators are being actively investigated as Ising machines for solving computationally hard problems in combinatorial optimization. Prior works have established the equivalence between the…
The precision of synchronization algorithms based on the theory of pulse-coupled oscillators is evaluated on FPGA-based radios for the first time. Measurements show that such algorithms can reach precision in the low microsecond range when…