Related papers: Wormhole Traversability via Quantum Random Walks
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
We show that discrete-time quantum walks on the line, $\mathbb{Z}$, behave as "the quantum tunneling". In particular, quantum walkers can tunnel through a double-well with the transmission probability $1$ under a mild condition. This is a…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
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 review, we present the ongoing developments in bridging the gap between holography and experiments. To this end, we discuss information scrambling and models of quantum teleportation via Gao-Jafferis-Wall wormhole teleportation. We…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of…
Biomolecular networks, such as protein-protein interactions, gene-gene associations, and cell-cell interactions, offer valuable insights into the complex organization of biological systems. These networks are key to understanding cellular…
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum…
We study a tunneling geometry defined by a single point-contact constriction that brings to close vicinity two points sitting at the same edge of a quantum Hall liquid, shortening the trip between the otherwise spatially separated points…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking…
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…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
Randomness plays a key role in the design of attacks on cryptographic systems and cyber security algorithms in general. Random walks and quantum walks are powerful tools for mastering random phenomena. In this article, I propose a…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
Quantum random walks (QRWs) are random processes in which the resulting probability density of the "walker" state, whose movement is governed by a "coin" state, is described in a non-classical manner. Previously, Q-plates have been used to…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…