Related papers: A high-fidelity quantum state transfer algorithm o…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
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…
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…
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…
This paper presents a deterministic search algorithm on complete bipartite graphs. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time quantum walk operator, which is a generalization of…
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…
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We introduce the phase quantum walk (PQW), a discrete-time quantum walk in which…
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 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…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
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…
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…
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…
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…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
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…
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 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…
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…