We investigate a quantum spatial search problem on fractal lattices, such as Sierpinski carpets and Menger sponges. In earlier numerical studies of the Sierpinski gasket, the Sierpinski tetrahedron, and the Sierpinski carpet, conjectures have been proposed for the scaling of a quantum spatial search problem finding a specific target, which is given in terms of the characteristic quantities of a fractal geometry. We find that our simulation results for extended Sierpinski carpets and Menger sponges support the conjecture for the ${\it optimal}$ number of the oracle calls, where the exponent is given by $1/2$ for $d_{\rm s} > 2$ and the inverse of the spectral dimension $d_{\rm s}$ for $d_{\rm s} < 2$. We also propose a scaling hypothesis for the ${\it effective}$ number of the oracle calls defined by the ratio of the ${\it optimal}$ number of oracle calls to a square root of the maximum finding probability. The form of the scaling hypothesis for extended Sierpinski carpets is very similar but slightly different from the earlier conjecture for the Sierpinski gasket, the Sierpinski tetrahedron, and the conventional Sierpinski carpet.
The spatial search problem on regular lattice structures in integer number of dimensions $d\geq2$ has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here we investigate the spatial search problem on fractals of non-integer dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (an…
We study continuous-time quantum walks mimicking the quantum search based on Grover's procedure. This allows us to consider structures, that is, databases, with arbitrary topological arrangements of their entries. We show that the topological structure of the database plays a crucial role by analyzing, both analytically and numerically, the transition from the ground to the first excited state of the Hamiltonian associated with different (fractal) structures. Additionally, we use the probability of successfully finding a specific target as another indicator of the importance of the topological…
Properties of one dimensional discrete-time quantum walks are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. This work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin $\rightarrow 0$ as the size of the chain is increased, it leaves peculiar properties in the wal…
We model quantum transport, described by continuous-time quantum walks (CTQW), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport efficiencies are defined in terms of the exact and the average return probabilities, as well as by the mean survival probability when absorbing traps are present. In the case of gaskets, localization can be identified already for small networks (generations). For carpets, our numerical results indicate a trend towards localization, but only for relatively large stru…
We investigate a quantum spatial search problem on a fractal lattice. A recent study for the Sierpinski gasket and tetrahedron made a conjecture that the dynamics of the search on a fractal lattice is determined by spectral dimension. We tackle this problem for the Sierpinski carpet, and our simulation result supports the conjecture. We also propose a scaling hypothesis of oracle calls for the quantum amplitude amplification.
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fractal known as the Sierpinski triangle appears. We first prove the appearance of more general fractals when Pascal's triangle is considered modulo prime powers. The numbers in Pascal's triangle can be obtained by scaling the probabilities of the simple symmetric random walk on the line. In this paper we consider a quantum version of Pascal's triangle by replacing the random walk by the quantum walk known as the Hadamard…
Chaotic walking of cold atoms in a tilted optical lattice, created by two counter propagating running waves with an additional external field, is demonstrated theoretically and numerically in the semiclassical and Hamiltonian approximations. The effect consists in random-like changing the direction of atomic motion in a rigid lattice under the influence of a constant force due to a specific behavior of the atomic dipole-moment component that changes abruptly in a random-like manner while atoms cross standing-wave nodes. Chaotic walking generates a fractal-like scattering of atoms that manifest…
We introduce and study a class of discrete-time quantum walks on a one-dimensional lattice. In contrast to the standard homogeneous quantum walks, coin operators are inhomogeneous and depend on their positions in this class of models. The models are shown to be self-dual with respect to the Fourier transform, which is analogous to the Aubry-André model describing the one-dimensional tight-binding model with a quasi-periodic potential. When the period of coin operators is incommensurate to the lattice spacing, we rigorously show that the limit distribution of the quantum walk is localized at th…
We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $β_w$ , total variation exponents $δ_w$ and relative entropy exponents $η_w$ . We define and solve the amplitude Green functions recursively when the level of the fractal graph goes to infinity. We obtain exact recursive formulas for the amplitude Green functions, based on which the hitting probabilities and expectation of the first-passage time are calculated. Using the recursive formula with the aid of Mo…
We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in general d_{f}\not=d_{s}, it suggests that d_{s} is the scaling exponent that determines the computational complexity of the search. Our results are consistent with those of Childs and Goldstone [Phys. Rev. A 70 (2004), 022314] for lattices of integer dimension, where d=d_{f}=d_{s}. For general fractals, we find that the Grover limit of quantum search can be obta…
Fractals are fascinating structures, not only for their aesthetic appeal, but also because they allow for the investigation of physical properties in non-integer dimensions. In these unconventional systems, a myriad of intrinsic features might come into play, such as the fractal dimension, the spectral dimension, or the fractal geometry. Despite abundant theoretical and numerical studies, experiments in fractal networks remain elusive. Here, we experimentally investigate quantum transport in fractal networks by performing continuous-time quantum walks in fractal photonic lattices with incremen…
We describe the action of the symplectic group on the homogeneous space of squeezed states (quantum blobs) and extend this action to the semigroup. We then extend the metaplectic representation to the metaplectic (or oscillator) semigroup and study the properties of such an extension using Bargmann-Fock space. The shape geometry of squeezing is analyzed and noncommuting elements from the symplectic semigroup are proposed to be used in simultaneous monitoring of noncommuting quantum variables - which should lead to fractal patterns on the manifold of squeezed states.
We analyze discrete-time quantum walks on Sierpinski gaskets using a flip-flop shift operator with the Grover coin. We obtain the scaling of two important physical quantities: the mean-square displacement and the mixing time as function of the number of points. The Sierpinski gasket is a fractal that lacks translational invariance and the results differ from those described in the literature for ordinary lattices. We find that the displacement varies with the initial location. Averaged over all initial locations, our simulation obtain an exponent very similar to classical diffusion.
Though classical random walks have been studied for many years, research concerning their quantum analogues, quantum random walks, has only come about recently. Numerous simulations of both types of walks have been run and analyzed, and are generally well-understood. Research pertaining to one of the more important properties of classical random walks, namely, their ability to build fractal structures in diffusion-limited aggregation, has been particularly noteworthy. However, only now has research begun in this area in regards to quantum random motion. The study of random walks and the struct…
We simulate dynamics of many-particle systems of bosons and fermions using discrete time quantum walks on lattices. We present a computational proof of a behavior of the simulated systems similar to the one observed in Hamiltonian dynamics during quantum thermalization. We record the time evolution of the entropy and the temperature of a specific particle configuration during the entire dynamics and observe how they relax to a state we call quantum walks thermal state. This observation is made on two types of lattices while simulating different numbers of particles walking on two grid graphs w…
We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential for attaining the Grover limit for quantum search algorithms in physically realizable, low-dimensional geometries. In particular, we analyze the exact real-space renormalization group (RG) procedure recently introduced to study the scaling of quantum walks on fractal networks. While this procedure, when implemented numerically, was able to provide some deep…
We introduce a new framework to analyze quantum algorithms with the renormalization group (RG). To this end, we present a detailed analysis of the real-space RG for discrete-time quantum walks on fractal networks and show how deep insights into the analytic structure as well as generic results about the long-time behavior can be extracted. The RG-flow for such a walk on a dual Sierpinski gasket and a Migdal-Kadanoff hierarchical network is obtained explicitly from elementary algebraic manipulations, after transforming the unitary evolution equation into Laplace space. Unlike for classical rand…
