Related papers: Quantum Pair State Transfer on Isomorphic Branches
Quantum state transfer (QST) describes the coherent passage of quantum information from one node in a network to another. Experiments on QST span a diverse set of platforms and currently report transport across up to tens of nodes in times…
The dynamical behaviour of the quantum state of different quantum spin chains, with designed site dependent interaction strengths, is analyzed when the initial state belongs to the one excitation subspace. It is shown that the inhomogeneous…
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…
Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also…
Heisenberg-type spin models in the limit of a low number of excitations are useful tools to study basic mechanisms in strongly correlated and magnetic systems. Many of these mechanisms can be experimentally tested using ultracold atoms.…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
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…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control.…
We study the transfer of quantum information through a Heisenberg spin-1 chain prepared in its ground state. We measure the efficiency of such a quantum channel {\em via} the fidelity of retrieving an arbitrarily prepared state and {\em…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
Considering the two-photon exchange interaction between n coupled cavities each of them containing a two level atom, the atomic and photonic state transfer is investigated. In fact, n atom-cavity systems are considered to be distributed on…
A multi-branch quantum circuit is considered from the viewpoint of coherent electron or wave transport. Starting with the closed system, we give analytical conditions for the appearance of two isolated localized states out of the energy…
This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…
We consider graphs with two cut vertices joined by a path with one or two edges, and prove that there can be no quantum perfect state transfer between these vertices, unless the graph has no other vertex. We achieve this result by applying…
Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of…
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…