Related papers: Pretty good plus state transfer in cycles
We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
The occurrence of fractional revival in quantum spin chains is examined. Analytic models where this phenomenon can be exhibited in exact solutions are provided. It is explained that spin chains with fractional revival can be obtained by…
When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with perfect accuracy. Here, we study how sensitive perfect state…
We consider the statistical inference problem of recovering an unknown perfect matching, hidden in a weighted random graph, by exploiting the information arising from the use of two different distributions for the weights on the edges…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent…
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…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
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…
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…
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…
This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian…
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…
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…
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;…
Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer from $u$ to $v$ occurs if there is a…