Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1405.5078 · Physical Review E

Transport properties of continuous-time quantum walks on Sierpinski fractals

Z. Darázs, Anastasiia Anishchenko, T. Kiss, A. Blumen, Oliver Mülken

Published Sep 12, 2014• 42 citations
arXivHTMLPDF

Abstract

We model quantum transport, described by continuous-time quantum walks (CTQWs), 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 structures. The comparison of gaskets and carpets further implies that, distinct from the corresponding classical continuous-time random walk, the spectral dimension does not fully determine the evolution of the CTQW.

DOI
10.1103/physreve.90.032113

Related papers

Geometrical aspects of quantum walks on random two-dimensional structures

Anastasiia Anishchenko, A. Blumen, Oliver Mülken

We study the transport properties of continuous-time quantum walks (CTQWs) over finite two-dimensional structures with a given number of randomly placed bonds and with different aspect ratios (ARs). Here, we focus on the transport from, say, the left side to the right side of the structure where absorbing sites are placed. We do so by analyzing the long-time average of the survival probability of CTQWs. We compare the results to the classical continuous-time random walk case (CTRW). For small ARs (landscape configurations) we observe only small differences between the quantum and the classical transport properties, i.e., roughly the same number of bonds is needed to facilitate the transport. However, with increasing ARs (portrait configurations) a much larger number of bonds is needed in the CTQW case than in the CTRW case. While for CTRWs the number of bonds needed decreases when going from small ARs to large ARs, for CTQWs this number is large for small ARs, has a minimum for the square configuration, and increases again for increasing ARs. We explain our findings by analyzing the average eigenstates of the corresponding structures: The participation ratios allow us to distinguish between localized and nonlocalized (average) eigenstates. In particular, for large ARs we find for CTQWs that the eigenstates are localized for bond numbers exceeding the bond numbers needed to facilitate transport in the CTRW case. Thus, a rather large number of bonds is needed in order for quantum transport to be efficient for large ARs.

arXiv:1309.2827•Physical Review E•Dec 13, 2013•9 citations

The localization of quantum random walks on Sierpinski gaskets

Kai Zhao, Wei-Shih Yang

We consider discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of the fractal graph 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, on which the hitting probabilities and expectation of the first-passage time are calculated, and using the recursive formula with the aid of Monte Carlo integration, we evaluate their numerical values. We also show that when the level of the fractal graph goes to infinity, with probability 1, the quantum random walks will return to the origin, i.e., the quantum walks on a Sierpinski gasket are recurrent.

arXiv:2103.10575•Journal of Mathematical Physics•Jan 1, 2022•1 citation

Continuous-time quantum walks on multilayer dendrimer networks

Mircea Daniel Galiceanu, Walter T. Strunz

We consider continuous-time quantum walks (CTQWs) on multilayer dendrimer networks (MDs) and their application to quantum transport. A detailed study of properties of CTQWs is presented and transport efficiency is determined in terms of the exact and average return probabilities. The latter depends only on the eigenvalues of the connectivity matrix, which even for very large structures allows a complete analytical solution for this particular choice of network. In the case of MDs we observe an interplay between strong localization effects, due to the dendrimer topology, and good efficiency from the linear segments. We show that quantum transport is enhanced by interconnecting more layers of dendrimers.

Physical review. E•Aug 17, 2016•17 citations

QUANTUM WALKS ON SIERPINSKI GASKETS

PEDRO CARLOS S. LARA, Renato Portugal, Stefan Boettcher

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 diffusion scaling depends on the initial location. Averaged over all initial locations, our simulation obtain an exponent very similar to the classical diffusion.

arXiv:1209.2095•International Journal of Quantum Information•Dec 1, 2013•13 citations

SYMMETRY AND QUANTUM TRANSPORT ON NETWORKS

S. Salimi, Roya Radgohar, M. M. Soltanzadeh

We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.

arXiv:1104.0596•International Journal of Quantum Information•Dec 1, 2010•1 citation

CONTINUOUS-TIME QUANTUM WALKS AND TRAPPING

ELENA AGLIARI, OLIVER MÜLKEN, A. Blumen

Recent findings suggest that processes such as the excitonic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy transfer one has to leave the classical, master-equation-type formalism and advance towards an increasingly quantum-mechanical picture, while still retaining a local description of the complex network of molecules involved in the transport, say through a tight-binding approach. Interestingly, the continuous time random walk (CTRW) picture, widely employed in describing transport in random environments, can be mathematically reformulated to yield a quantum-mechanical Hamiltonian of tight-binding type; the procedure uses the mathematical analogies between time-evolution operators in statistical and in quantum mechanics: The result are continuous-time quantum walks (CTQWs). However, beyond these formal analogies, CTRWs and CTQWs display vastly different physical properties. In particular, here we focus on trapping processes on a ring and show, both analytically and numerically, that distinct configurations of traps (ranging from periodical to random) yield strongly different behaviors for the quantal mean survival probability, while classically (under ordered conditions) we always find an exponential decay at long times.

arXiv:0903.3288•International Journal of Bifurcation and Chaos•Feb 1, 2010•29 citations
We model quantum transport, described by continuous-time quantum walks (CTQWs), 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 structures. The comparison of gaskets and carpets further implies that, distinct from the corresponding classical continuous-time random walk, the spectral dimension does not fully determine the evolution of the CTQW.
We study the transport properties of continuous-time quantum walks (CTQWs) over finite two-dimensional structures with a given number of randomly placed bonds and with different aspect ratios (ARs). Here, we focus on the transport from, say, the left side to the right side of the structure where absorbing sites are placed. We do so by analyzing the long-time average of the survival probability of CTQWs. We compare the results to the classical continuous-time random walk case (CTRW). For small ARs (landscape configurations) we observe only small differences between the quantum and the classical transport properties, i.e., roughly the same number of bonds is needed to facilitate the transport. However, with increasing ARs (portrait configurations) a much larger number of bonds is needed in the CTQW case than in the CTRW case. While for CTRWs the number of bonds needed decreases when going from small ARs to large ARs, for CTQWs this number is large for small ARs, has a minimum for the square configuration, and increases again for increasing ARs. We explain our findings by analyzing the average eigenstates of the corresponding structures: The participation ratios allow us to distinguish between localized and nonlocalized (average) eigenstates. In particular, for large ARs we find for CTQWs that the eigenstates are localized for bond numbers exceeding the bond numbers needed to facilitate transport in the CTRW case. Thus, a rather large number of bonds is needed in order for quantum transport to be efficient for large ARs.
We consider discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of the fractal graph 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, on which the hitting probabilities and expectation of the first-passage time are calculated, and using the recursive formula with the aid of Monte Carlo integration, we evaluate their numerical values. We also show that when the level of the fractal graph goes to infinity, with probability 1, the quantum random walks will return to the origin, i.e., the quantum walks on a Sierpinski gasket are recurrent.
We consider continuous-time quantum walks (CTQWs) on multilayer dendrimer networks (MDs) and their application to quantum transport. A detailed study of properties of CTQWs is presented and transport efficiency is determined in terms of the exact and average return probabilities. The latter depends only on the eigenvalues of the connectivity matrix, which even for very large structures allows a complete analytical solution for this particular choice of network. In the case of MDs we observe an interplay between strong localization effects, due to the dendrimer topology, and good efficiency from the linear segments. We show that quantum transport is enhanced by interconnecting more layers of dendrimers.
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 diffusion scaling depends on the initial location. Averaged over all initial locations, our simulation obtain an exponent very similar to the classical diffusion.
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.
Recent findings suggest that processes such as the excitonic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy transfer one has to leave the classical, master-equation-type formalism and advance towards an increasingly quantum-mechanical picture, while still retaining a local description of the complex network of molecules involved in the transport, say through a tight-binding approach. Interestingly, the continuous time random walk (CTRW) picture, widely employed in describing transport in random environments, can be mathematically reformulated to yield a quantum-mechanical Hamiltonian of tight-binding type; the procedure uses the mathematical analogies between time-evolution operators in statistical and in quantum mechanics: The result are continuous-time quantum walks (CTQWs). However, beyond these formal analogies, CTRWs and CTQWs display vastly different physical properties. In particular, here we focus on trapping processes on a ring and show, both analytically and numerically, that distinct configurations of traps (ranging from periodical to random) yield strongly different behaviors for the quantal mean survival probability, while classically (under ordered conditions) we always find an exponential decay at long times.