Related papers: QSearchNet: A Quantum Walk Search Framework for Li…
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this…
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…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
Various quantum-walk based algorithms have been proposed to analyse and rank the centrality of graph vertices. However, issues arise when working with directed graphs --- the resulting non-Hermitian Hamiltonian leads to non-unitary…
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…
We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified…
Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an…
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We employ Quantum Fisher Information, as a figure of merit, to quantify extractable information about an unknown parameter…
This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historical background of CTQW. After a short outline of the…
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…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Message-passing graph neural networks (GNNs) excel at capturing local relationships but struggle with long-range dependencies in graphs. In contrast, graph transformers (GTs) enable global information exchange but often oversimplify the…
Kronecker graphs, obtained by repeatedly performing the Kronecker product of the adjacency matrix of an "initiator" graph with itself, have risen in popularity in network science due to their ability to generate complex networks with…
The quantum-walk-based spatial search problem aims to find a marked vertex using a quantum walk on a graph with marked vertices. We describe a framework for determining the computational complexity of spatial search by continuous-time…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
Graph embedding based on random-walks supports effective solutions for many graph-related downstream tasks. However, the abundance of embedding literature has made it increasingly difficult to compare existing methods and to identify…
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a…
Network modeling is a fundamental tool in network research, design, and operation. Arguably the most popular method for modeling is Queuing Theory (QT). Its main limitation is that it imposes strong assumptions on the packet arrival…
Reconstructing protein-protein interaction networks is a central challenge in network medicine, often addressed using link prediction algorithms. Recent studies suggest that quantum walk-based approaches hold promise for this task. In this…
In this paper, we analyze the dynamics of quantum walks on a graph structure resulting from the integration of a main connected graph $G$ and a secondary connected graph $G'$. This composite graph is formed by a disjoint union of $G$ and…