Related papers: Subspace State Transfer in Coined Quantum Walks
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…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals. Perfect state transfer occurs between…
We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer…
Transport phenomena play a crucial role in modern physics and applied sciences. Examples include the dissipation of energy across a large system, the distribution of quantum information in optical networks, and the timely modeling of…
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…
We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph $G$ has perfect state transfer if and only if its quotient $G/\pi$, under any equitable partition $\pi$, has perfect state transfer, we…
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…
In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
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 consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
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…
For any graph $X$ with the adjacency matrix $A$, the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}_X(t)=\mathrm{e}^{itA}$. We say that there is perfect state transfer…