Related papers: Enhanced quantum transport in chiral quantum walks
We study the effect of noise on the transport of a quantum state from a closed loop of $n-$sites with one of the sites as a sink. Using a discrete-time quantum walk dynamics, we demonstrate that the transport efficiency can be enhanced with…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
Some of the recent developments concerning the propagation of quantum correlations across spin channels are reviewed. In particular, we focus on the improvement of the transport efficiency obtained by the manipulation of few energy…
Quantum mechanics still provides new unexpected effects when considering the transport of energy and information. Models of continuous time quantum walks, which implicitly use time-reversal symmetric Hamiltonians, have been intensely used…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
Coherent transport of excitations along chains of coupled quantum systems represents an interesting problem with a number of applications ranging from quantum optics to solar cell technology. A convenient tool for studying such processes…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
Quantized transport is a prominent feature in topological physics, with canonical examples being the quantum Hall effect and adiabatic Thouless pump, which are based on the Chern number, a topological invariant of 2D systems. Going beyond…
In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum…
Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…
Routing classical and quantum information is a fundamental task for quantum information technologies and processes. Here, we consider information encoded in the position of a quantum walker on a graph, and design an optimal structure to…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
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…