arXiv:2310.02722 · Entropy

Discrete-Time Quantum Walk on Multilayer Networks

Mahesh N. Jayakody, Priodyuti Pradhan, Dana Ben Porath, Eliahu Cohen

Published Nov 30, 2023• 4 citations

Abstract

A Multilayer network is a potent platform that paves the way for the study of the interactions among entities in various networks with multiple types of relationships. This study explores the dynamics of discrete-time quantum walks on a multilayer network. We derive a recurrence formula for the coefficients of the wave function of a quantum walker on an undirected graph with a finite number of nodes. By extending this formula to include extra layers, we develop a simulation model to describe the time evolution of the quantum walker on a multilayer network. The time-averaged probability and the return probability of the quantum walker are studied with Fourier, and Grover walks on multilayer networks. Furthermore, we analyze the impact of decoherence on quantum transport, shedding light on how environmental interactions may impact the behavior of quantum walkers on multilayer network structures.

DOI: 10.3390/e25121610

Related papers

Quantum transport on multilayer generalized scale-free networks

Mircea Daniel Galiceanu, Walter T. Strunz

Abstract We study single-particle quantum transport on multilayer generalized scale-free networks using the continuous-time quantum walk model. Our focus is directed at the average return probability and its long-time average value as measures for the transport efficiency. In the continuous-time model these quantities are completely determined by all the eigenvalues and eigenvectors of the connectivity matrix. For all multilayer networks a nontrivial interplay between good spreading and localization effects is observed. The spreading is enhanced by increasing the number of layers L or the power-law exponent γ of the degree distribution. For our choice of the parameters, namely L (1 ≤ L ≤ 50) or γ (1 ≤ γ ≤ 4), the quantum efficiency is increased by at least one order of magnitude. The topological transition between networks without loops, which corresponds to a single scale-free network layer (L = 1), and networks with loops (L = 2) is the most impactful. Another important change occurs when L gets higher than the average diameter d of the layers, namely a new scaling behavior for random walks and lower fluctuations around the long-time average value for quantum walks. The quantum transport is more sensitive to changes of the minimum allowed degree, K min, than to the maximum allowed degree, K max. The same quantum efficiency is found by varying at least one of the parameters: L, γ, K min, or K max, although the network’s topology is different. The quantum efficiency of all multilayer scale-free networks shows a universal behavior for any size of the layers, more precise, is inversely proportional to the number of layers.

Physica ScriptaFeb 15, 20243 citations

Proposal for implementing quantum walks on multidimensional networks

Qi-Ping Su, Rui-Qi Shen, Li Zhi Yu +6 more

Discrete-time quantum walks (DTQWs) have broad applications in quantum computation and simulation, particularly in universal quantum computing. Prior research in circuit quantum electrodynamics (QED) has focused on implementing DTQWs in one-dimensional chains. However, to achieve practical quantum tasks, it is crucial to extend DTQWs to multidimensional networks with diverse structures. Here, we propose a protocol for realizing DTQWs in multidimensional networks, which accommodate nodes with different numbers of neighbors. Using this protocol, we numerically simulate a Grover walk search algorithm in a cubic network with circuit QED. Our simulations, which consider decoherence, align well with theoretical predictions. Our universal protocol can be adapted for various quantum systems and paves the way for DTQWs in multidimensional networks, which has potential applications in quantum computing and simulation.

Physical Review AAug 15, 20250 citations

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. EAug 17, 201617 citations

Dynamics of continuous-time quantum walks in restricted geometries

Elena Agliari, A. Blumen, Oliver Mülken

Abstract. We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average displacement of the walker as a function of time. Indeed, a fast growth of the average displacement can be advantageously exploited to build up efficient search algorithms. By means of analytical and numerical investigations, we show that the finiteness and the inhomogeneity of the substrate jointly weaken the quantum walk performance. We further highlight the interplay between the quantum-walk dynamics and the underlying topology by studying the temporal evolution of the transfer probability distribution and the lower bound of long time averages. PACS numbers: 05.60Gg, 71.35.-y, 05.60CdDynamics of continuous-time quantum walks in restricted geometries 2 1.

Nov 20, 201237 citations

Unidirectional quantum walks: Evolution and exit times

Miquel Montero

In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.

arXiv:1306.1807Physical Review AJul 31, 201318 citations

Localization in quantum walks on a honeycomb network

Changyuan Lyu, Luyan Yu, Shengjun Wu

We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.

arXiv:1509.03919Physical Review ANov 5, 201520 citations