Related papers: Pair state transfer in tensor product and double c…
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples…
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 study transfer of single photon in an one-dimensional finite Glauber-Fock cavity array whose coupling strengths satisfy a square root law. The evolved state in the array can be mapped to an upper truncated coherent state if the cavities…
In contrast to discrete-variable teleportation, a quantum state is imperfectly transferred from a sender to a remote receiver in a continuous-variable setting. We recall the ingenious scheme proposed by Braunstein and Kimble for teleporting…
In quantum communication, quantum state transfer from one location to another in a quantum network plays a prominent role, where the impact of noise could be crucial. The idea of state transfer can be fruitfully associated with quantum walk…
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…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
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…
We study state transfer in quantum walk on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$, the Frucht-Harary corona product $G…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
Graph states are a class of important multiparty entangled states, of which bell pairs are the special case. Realizing a robust and fast distribution of arbitrary graph states in the downstream layer of the quantum network can be essential…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
We find a protocol transmitting K quantum states crossly in the quantum networks with K pair sender-receiver and one bottleneck channels only with sharing quantum correlations between senders. In these networks senders want to multi cast…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for…
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 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…