Related papers: Quantum Iterated Function Systems
Basic concepts of quantum integrable systems (QIS) are presented stressing on the unifying structures underlying such diverse models. Variety of ultralocal and nonultralocal models is shown to be described by a few basic relations defining…
Classical simulation of quantum computers will continue to play an essential role in the progress of quantum information science, both for numerical studies of quantum algorithms and for modeling noise and errors. Here we introduce the…
We study new relations between countable iterated function systems (IFS) with overlaps, Smale endomorphisms and random systems with complete connections. We prove that stationary measures for countable conformal IFS with overlaps and…
This paper is the first paper of three papers in a series, which intend to provide a systematic treatment for the space-filling curves of self-similar sets. In the present paper, we introduce a notion of \emph{linear graph-directed IFS}…
The fractal character of some quantum properties has been shown for systems described by continuous variables. Here, a definition of quantum fractal states is given that suits the discrete systems used in quantum information processing,…
We derive the form of the quantum filter equation describing the continuous observation of the phase of a quantum system in an arm of an interferometer via non-demolition measurements when the statistics of an input field used for the…
In this paper, we investigate the Hausdorff dimension of the invariant measures of the iterated function system (IFS) $\{\alpha x, \beta x, \gamma x+(1-\gamma)\}$. We provide an "almost every" type result by a direct application of the…
To date, quantum computational algorithms have operated on a superposition of all basis states of a quantum system. Typically, this is because it is assumed that some function f is known and implementable as a unitary evolution. However,…
Quantum field theory (QFT) on fractal spacetimes is a program aiming at quantizing the gravitational interaction consistently at all energy scales thanks to an intrinsically or dynamically induced multiscale or multifractal-like spacetime…
This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant…
Every quasi-attractor of an iterated function system (IFS) of continuous functions on a first-countable Hausdorff topological space is renderable by the probabilistic chaos game. By contrast, we prove that the backward minimality is a…
Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity of the functions in the IFS has been central to the theory of iterated functions systems.…
We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is…
We consider the quantum computational process as viewed by an insider observer: this is equivalent to an isomorphism between the quantum computer and a quantum space, namely the fuzzy sphere. The result is the formulation of a reversible…
In a previous work we have introduced the concept of quasi-integrable quantum system. In the present one we determine sufficient conditions under which, given an integrable classical system, it is possible to construct a quasi-integrable…
Khintchine's theorem is a classical result from metric number theory which relates the Lebesgue measure of certain limsup sets with the convergence/divergence of naturally occurring volume sums. In this paper we ask whether an analogous…
Quantum linear system algorithms (QLSA) have the potential to speed up Interior Point Methods (IPM). However, a major challenge is that QLSAs are inexact and sensitive to the condition number of the coefficient matrices of linear systems.…
We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are…
We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the…
A discrete quantum process is defined as a sequence of local states $\rho_t$, $t=0,1,2,...$, satisfying certain conditions on an $L_2$ Hilbert space $H$. If $\rho =\lim\rho_t$ exists, then $\rho$ is called a global state for the system. In…