Related papers: Pretty good state transfer between internal nodes …
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
Quantum state transfer between distant nodes is at the heart of quantum processing and quantum networking. Stimulated by this, we propose a scheme where one can highly achieve quantum state transfer between sites in a cavity quantum…
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
We investigate a space-inhomogeneous discrete-time quantum walk in one dimension. We show that the walk exhibits localization by a path counting method.
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
Many phenomena in solid-state physics can be understood in terms of their topological properties. Recently, controlled protocols of quantum walks are proving to be effective simulators of such phenomena. Here we report the realization of a…
We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a…
We show analytically that particle trapping appears in a quantum process called "quantum walk", in which the particle moves macroscopically correlating to the inner states. It has been well known that a particle in the ``Hadamard walk" with…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
In all existing quantum walk models, the assumption about a pre-existing fixed background causal structure is always made and has been taken for granted. Nevertheless, in this work we will get rid of this tacit assumption especially by…
Being able to reliably transfer the quantum state from one system to another is crucial to developing quantum networks. A standard way to accomplish this transfer of information is by making use of an intermediate information carrier (e.g.,…
We study a natural construction of a general class of inhomogeneous quantum walks (namely walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on…
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
We study the information transferring ability of a spin-1/2 XXZ Hamiltonian for two different modes of state transfer, namely, the well studied attaching scenario and the recently proposed measurement induced transport. The latter one has…