Related papers: Perfect quantum state transfer using Hadamard diag…
Quantum state transfer, first introduced by Bose in 2003, is an important physical phenomenon in quantum networks, which plays a vital role in quantum communication and quantum computing. In 2004, Christandl et al. proposed the concept of…
We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…
Pure states correspond to one-dimensional subspaces of $\mathbb{C}^n$ represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian…
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
We consider quantum state transfer relative to the Laplacian matrix of a graph. Let $N(u)$ denote the set of all neighbors of a vertex $u$ in a graph $G$. A pair of vertices $u$ and $v$ are called twin vertices of $G$ provided…
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
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…
Twin vertices in simple unweighted graphs are vertices that have the same neighbours and, in the case of weighted graphs with possible loops, the corresponding incident edges have equal weights. In this paper, we explore the role of twin…
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…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
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…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
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…
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…
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…
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one dimensional cases, such as 1d spin chains. We…
The study of perfect state transfer on graphs has attracted a great deal of attention during the past ten years because of its applications to quantum information processing and quantum computation. Perfect state transfer is understood to…
Superconducting quantum circuits, fabricated with multiple layers, are proposed to implement perfect quantum state transfer between nodes of a hypercube network. For tunable devices such as the phase qubit, each node can transmit quantum…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
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…