Related papers: Discrete-time Quantum Walk on Multilayer Networks
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random…
A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315)…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph…
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…
We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…
We study the differences between the process of decoherence induced by chaotic and regular environments. For this we analyze a family of simple models wich contain both regular and chaotic environments. In all cases the system of interest…
Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent…
For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…
Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker…
This manuscript gathers and subsumes a long series of works on using QW to simulate transport phenomena. Quantum Walks (QWs) consist of single and isolated quantum systems, evolving in discrete or continuous time steps according to a…
We introduce the driven discrete time quantum walk, where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original quantum…
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time…