Related papers: On Quantum Random Walks in Biomolecular Networks
Rydberg atoms provide a highly promising platform for quantum computation, leveraging their strong tunable interactions to encode and manipulate information in the electronic states of individual atoms. Key advantages of Rydberg atoms…
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…
We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to…
We predict disease-genes relations on the Human Interactome network using a methodology that jointly learns functional and connectivity patterns surrounding proteins. Contrary to other data structures, the Interactome is characterized by…
Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study…
We study the transport properties of continuous-time quantum walks (CTQW) over finite two-dimensional structures with a given number of randomly placed bonds and with different aspect ratios (AR). Here, we focus on the transport from, say,…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…
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…
Control and characterization of networks is a paramount step for the development of many quantum technologies. Even for moderate-sized networks, this amounts to explore an extremely vast parameters space in search for the couplings defining…
Branching processes are widely used to model the viral epidemic evolution. For more adequate investigation of viral epidemic modelling, we suggest to apply branching processes with transport of particles usually called branching random…
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Quantum walks are a promising framework that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with…
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum…
Scientific and technological advances in medicine and systems biology have unequivocally shown that health and disease must be viewed in the context of the interplay among multiple molecular and environmental factors. Understanding the…
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…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
This paper proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic…
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum…