Related papers: State Transfer on Paths with Weighted Loops
We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer…
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…
We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the…
We prove that almost-linear-time high-fidelity state transfer is achievable in a quantum spin chain using loop weights at the second and second-to-last nodes. We provide specific parameter values, and using a careful analysis of the…
We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…
We consider the state transfer properties of continuous time quantum walks on trees of diameter 4. We characterize all pairs of strongly cospectral vertices in trees of diameter 4, finding that they fall into pairs of three different types.…
The ability to transfer quantum information from one location to another with high fidelity is of central importance to quantum information science. Unfortunately for the simplest system of a uniform chain (a spin chain or a particle in a…
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;…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
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…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that the graph $G$ admits perfect state transfer between the verteices $u$ and $v$ at…
High fidelity state transfer is an important ingredient of distributed quantum information processing. We present and analyse results on perfect and quasi-perfect state transfer with linear spin chains incorporating non-uniform on-site…
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 state transfer protocols are a major toolkit in many quantum information processing tasks, from quantum key distribution to quantum computation. To assess performance of a such a protocol, one often relies on the average fidelity…
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…
It is shown that by switching a specific time-dependent interaction between a harmonic oscillator and a transmission line (a waveguide, an optical fiber, etc.) the quantum state of the oscillator can be transferred into that of another…
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…
We experimentally demonstrate continuous-variable quantum teleportation beyond the no-cloning limit. We teleport a coherent state and achieve the fidelity of 0.70$\pm$0.02 that surpasses the no-cloning limit of 2/3. Surpassing the limit is…