Related papers: Quantum Iterated Function Systems

This paper contains four main results associated with an attractor of a projective iterated function system (IFS). The first theorem characterizes when a projective IFS has an attractor which avoids a hyperplane. The second theorem…

Let $(b_k)_{k = 0}^\infty$ be strictly decreasing sequence of real numbers such that $b_0 = 1$ and $\{f_k:[b_k,b_{k-1}]\to [0,1]\}_{k\in\N}$ be decreasing functions such that $f_k(b_k) = 1$ and $f_k(b_{k-1}) = 0$, $k = 1, 2, \dots$. By…

We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…

Iterated Function Systems (IFSs) have been at the heart of fractal geometry almost from its origin, and several generalizations for the notion of IFS have been suggested. Subdivision schemes are widely used in computer graphics and attempts…

In phase space, we analytically obtain the characteristic functions (CFs) of a forced harmonic oscillator [Talkner et al., Phys. Rev. E, 75, 050102 (2007)], a time-dependent mass and frequency harmonic oscillator [Deffner and Lutz, Phys.…

A quadrature mirror filter (QMF) function can be considered as the transition function for a Markov process on the unit interval. The QMF functions that generate scaling functions for multiresolution analyses are then distinguished by…

This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…

We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…

We investigate the set of invariant idempotent probabilities for countable idempotent iterated function systems (IFS) defined in compact metric spaces. We demonstrate that, with constant weights, there exists a unique invariant idempotent…

The fast basin of an attractor of an iterated function system (IFS) is the set of points in the domain of the IFS whose orbits under the associated semigroup intersect the attractor. Fast basins can have non-integer dimension and comprise a…

This paper presents a description and analysis of a rational cubic spline FIF (RCSFIF) that has two shape parameters in each subinterval when it is defined implicitly. To be precise, we consider the iterated function system (IFS) with…

In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…

We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps. Our primary focus is on finite invariant sets exhibiting ``toss-and-catch'' dynamics, in which trajectories alternate…

Quantum machine learning (QML) seeks to exploit the intrinsic properties of quantum mechanical systems, including superposition, coherence, and quantum entanglement for classical data processing. However, due to the exponential growth of…

We describe new families of random fractals, referred to as "V-variable", which are intermediate between the notions of deterministic and of standard random fractals. The parameter V describes the degree of "variability" : at each…

We show that an idea, originating initially with a fundamental recursive iteration scheme (usually referred as "the" Kaczmarz algorithm), admits important applications in such infinite-dimensional, and non-commutative, settings as are…

For every $k \in \mathbb{N}$ let $f_k:[\frac{1}{k+1}, \frac{1}{k}] \to [0,1]$ be decreasing, linear functions such that $f_k(\frac{1}{k+1}) = 1$ and $f_k(\frac{1}{k}) = 0$, $k = 1, 2, \dots$. We define iterated function system (IFS) $S_n$…

In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…

Quantum control protocols are typically devised in the time domain, leaving their spectral behavior to emerge only a posteriori. Here, we invert this paradigm. Starting from a target frequency-domain filter, we employ the…

We study the minimality of almost every orbital branch of minimal iterated function systems (IFSs). We prove that this kind of minimality holds for forward and backward minimal IFSs generated by orientation-preserving homeomorphisms of the…