Related papers: Continuous-time quantum-walk centrality for protei…
Continuous-time quantum walks (CTQWs) provide a versatile framework for exploring quantum transport on graphs. In this work, we investigate how the introduction of edge-weight modulation at a single vertex can suppress its occupation…
We contribute to fulfil the long-lasting gap in the understanding of the spatial search with multiple marked vertices. The theoretical framework is that of discrete-time quantum walks (QW), \textit{i.e.} local unitary matrices that drive…
Multilayer network analysis is a useful approach for studying the structural properties of entities with diverse, multitudinous relations. Classifying the importance of nodes and node-layer tuples is an important aspect of the study of…
We study a quantum walk of a single particle that is subject to stroboscopic projective measurements on a graph with two sites. This two-level system is the minimal model of a measurement induced quantum walk. The mean first detected…
Self-avoiding random walks were performed on protein residue networks. Compared with protein residue networks with randomized links, the probability of a walk being successful is lower and the length of successful walks shorter in…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…
Quantum processes of inherent dynamical nature, such as quantum walks (QWs), defy a description in terms of an equilibrium statistical physics ensemble. Up to now, it has remained a key challenge to identify general principles behind the…
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…
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…
Coined Quantum Walks (QWs) are being used in many contexts with the goal of understanding quantum systems and building quantum algorithms for quantum computers. Alternative models such as Szegedy's and continuous-time QWs were proposed…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…
Predicting the 3D structure of proteins is one of the most important problems in current biochemical research. In this article, we explain how to combine recent deep learning advances with the well known technique of quantum walks applied…
A new family of discrete-time quantum walks (DTQWs) on the line with an exact discrete $U(N)$ gauge invariance is introduced. It is shown that the continuous limit of these DTQWs, when it exists, coincides with the dynamics of a Dirac…
The Szegedy quantum walk is a discrete time quantum walk model which defines a quantum analogue of any Markov chain. The long-term behavior of the quantum walk can be encoded in a matrix called the average mixing matrix, whose columns give…
Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we…
Financial markets are noisy yet contain a latent graph-theoretic structure that can be exploited for superior risk-adjusted returns. We propose a quantum stochastic walk (QSW) optimizer that embeds assets in a weighted graph: nodes…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
We investigate the chiral quantum walk (CQW) as a mechanism for an entanglement transfer on a triangular chain structure. We specifically consider two-site spatially entangled cases in short-time and long-time regimes. Using the concurrence…