Related papers: Laplacian quantum walks on blow-up graphs
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…
In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on $n$ vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths;…
In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…
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…
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD,…
In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use Chebyshev polynomials to analyze PGST between such states.…
This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…
We provide a characterization of perfect state transfer in a quantum walk whose Hamiltonian is given by the normalized Laplacian. We discuss a connection between classical random walks and quantum walks only present in this model, and we…
The quantum Perfect State Transfer (PST) is a fundamental tool of quantum communication in a network. It is not easy to achieve in practice. The original idea of PST depends on the fundamentals of the continuous-time quantum walk. A path…
The total graph of a graph $G$, denoted $\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\mathcal{T}(G)$ are adjacent if the corresponding…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for…
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$,…
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix corresponding to $G$ is defined by $H(t):=\exp{\left(itA\right)}$, $t\in\Rl$. The graph $G$ is said to have perfect state transfer (PST) from a vertex $u$ to another vertex…
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…
We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider…
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…