Related papers: Degree Distribution in Quantum Walks on Complex Ne…
Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
The quantum walk is a quantum counterpart of the classical random walk that exhibits nonclassical behaviors and outperforms the classical random walk in various aspects. It has been known that a single particle can be propagated by a…
The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The…
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…
In this paper we extend the concept of persistence, well defined for classical stochastic dynamics, to the context of quantum dynamics. We demonstrate the idea via quantum random walk and a successive measurement scheme, where persistence…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC)…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution.…
We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centrality, we assume that…
Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
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…
In recent years, new algorithms and cryptographic protocols based on the laws of quantum physics have been designed to outperform classical communication and computation. We show that the quantum world also opens up new perspectives in the…
Topological data analysis is a rapidly developing area of data science where one tries to discover topological patterns in data sets to generate insight and knowledge discovery. In this project we use quantum walk algorithms to discover…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical…
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…