Related papers: Quantum state transfer on the complete bipartite g…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
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…
Quantum state transfer between different sites is a significant problem for quantum networks and quantum computers. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we…
We study a transport phenomenon in certain coined quantum walks where a subspace of states localized at a vertex gets transferred to another vertex. We first develop characterizations for perfect and pretty good subspace state transfer…
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…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
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…
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Phys. A: Math. Theor. 55, 265303 (2022)) on universality of…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
A continuous-time quantum walk on a graph evolves according to the unitary operator $e^{-iAt}$, where $A$ is the adjacency matrix of the graph. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node…
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 perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. In particular, we focus on states associated to vertices of a graph. We call such states vertex type states. Perfect state transfer…
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…
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…