اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNon-trivial Lyapunov spectrum from fractal quantum cellular automata
167
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A generalized set of Clifford cellular automata, which includes all Clifford cellular automata, result from the quantization of a lattice system where on each site of the lattice one has a $2k$-dimensional torus phase space. The dynamics is a linear map in the torus variables and it is also local: the evolution depends only on variables in some region around the original lattice site. Moreover it preserves the symplectic structure. These are classified by $2ktimes 2k$ matrices with entries in Laurent polynomials with integer coefficients in a set of additional formal variables. These can lead to fractal behavior in the evolution of the generators of the quantum algebra. Fractal behavior leads to non-trivial Lyapunov exponents of the original linear dynamical system. The proof uses Fourier analysis on the characteristic polynomial of these matrices.
قيم البحث
اقرأ أيضاً
We numerically study the dynamics of elementary 1D cellular automata (CA), where the binary state $sigma_i(t) in {0,1}$ of a cell $i$ does not only depend on the states in its local neighborhood at time $t-1$, but also on the memory of its own past s
tates $sigma_i(t-2), sigma_i(t-3),...,sigma_i(t-tau),...$. We assume that the weight of this memory decays proportionally to $tau^{-alpha}$, with $alpha ge 0$ (the limit $alpha to infty$ corresponds to the usual CA). Since the memory function is summable for $alpha>1$ and nonsummable for $0le alpha le 1$, we expect pronounced %qualitative and quantitative changes of the dynamical behavior near $alpha=1$. This is precisely what our simulations exhibit, particularly for the time evolution of the Hamming distance $H$ of initially close trajectories. We typically expect the asymptotic behavior $H(t) propto t^{1/(1-q)}$, where $q$ is the entropic index associated with nonextensive statistical mechanics. In all cases, the function $q(alpha)$ exhibits a sensible change at $alpha simeq 1$. We focus on the class II rules 61, 99 and 111. For rule 61, $q = 0$ for $0 le alpha le alpha_c simeq 1.3$, and $q<0$ for $alpha> alpha_c$, whereas the opposite behavior is found for rule 111. For rule 99, the effect of the long-range memory on the spread of damage is quite dramatic. These facts point at a rich dynamics intimately linked to the interplay of local lookup rules and the range of the memory. Finite size scaling studies varying system size $N$ indicate that the range of the power-law regime for $H(t)$ typically diverges $propto N^z$ with $0 le z le 1$. Similar studies have been carried out for other rules, e.g., the famous universal computer rule 110.
It is shown how a Doubly-Special Relativity model can emerge from a quantum cellular automaton description of the evolution of countably many interacting quantum systems. We consider a one-dimensional automaton that spawns the Dirac evolution in the
relativistic limit of small wave-vectors and masses (in Planck units). The assumption of invariance of dispersion relations for boosted observers leads to a non-linear representation of the Lorentz group on the $(omega,k)$ space, with an additional invariant given by the wave-vector $k=pi /2$. The space-time reconstructed from the $(omega,k)$ space is intrinsically quantum, and exhibits the phenomenon of relative locality.
We construct models hosting classical fractal spin liquids on two realistic three-dimensional (3D) lattices of corner-sharing triangles: trillium and hyperhyperkagome (HHK). Both models involve the same form of three-spin Ising interactions on triang
ular plaquettes as the Newman-Moore (NM) model on the 2D triangular lattice. However, in contrast to the NM model and its 3D generalizations, their degenerate ground states and low-lying excitations cannot be described in terms of scalar cellular automata (CA), because the corresponding fractal structures lack a simplifying algebraic property, often termed the Freshmans dream. By identifying a link to matrix CAs -- that makes essential use of the crystallographic structure -- we show that both models exhibit fractal symmetries of a distinct class to the NM-type models. We devise a procedure to explicitly construct low-energy excitations consisting of finite sets of immobile defects or fractons, by flipping arbitrarily large self-similar subsets of spins, whose fractal dimensions we compute analytically. We show that these excitations are associated with energetic barriers which increase logarithmically with system size, leading to fragile glassy dynamics, whose existence we confirm via classical Monte Carlo simulations. We also discuss consequences for spontaneous fractal symmetry breaking when quantum fluctuations are introduced by a transverse magnetic field, and propose multi-spin correlation function diagnostics for such transitions. Our findings suggest that matrix CAs may provide a fruitful route to identifying fractal symmetries and fracton-like behaviour in lattice models, with possible implications for the study of fracton topological order.
We study matrix product unitary operators (MPUs) for fermionic one-dimensional (1D) chains. In stark contrast with the case of 1D qudit systems, we show that (i) fermionic MPUs do not necessarily feature a strict causal cone and (ii) not all fermioni
c Quantum Cellular Automata (QCA) can be represented as fermionic MPUs. We then introduce a natural generalization of the latter, obtained by allowing for an additional operator acting on their auxiliary space. We characterize a family of such generalized MPUs that are locality-preserving, and show that, up to appending inert ancillary fermionic degrees of freedom, any representative of this family is a fermionic QCA and viceversa. Finally, we prove an index theorem for generalized MPUs, recovering the recently derived classification of fermionic QCA in one dimension. As a technical tool for our analysis, we also introduce a graded canonical form for fermionic matrix product states, proving its uniqueness up to similarity transformations.
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the ability of autom
ata to emulate one another, and we use this notion to define such a set of naturally emerging tasks. We present the results for elementary cellular automata, although the core ideas can be extended to other computational systems. We compute a graph showing which elementary cellular automata can be emulated by which and show that certain chaotic automata are the only ones that cannot emulate any automata non-trivially. Finally, we use the emulation notion to suggest a novel definition of chaos that we believe is suitable for discrete computational systems. We believe our work can help design parallel computational systems that are Turing-complete and also computationally efficient.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
