Related papers: Perfect quantum state transfer on diamond fractal …
We study the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. Some years ago it was discovered that when the spin chain data (the nearest neighbour interaction strengths…
In this paper, we analyze state transfer in quantum walks by using combinatorial methods. We generalize perfect state transfer in two-reflection discrete-time quantum walks to a notion that we call 'peak state transfer'; we define peak…
Following the prescription of Ref. \cite{PST} in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary $d$-level quantum state (qudit) over antipodes of more…
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…
Spin chains have been proposed as quantum wires in many quantum information processing architectures. Coherent transmission of quantum information over short distances is enabled by their internal dynamics, which drives the transport of…
Perfect state transfer and fractional revival can be used to move information between pairs of vertices in a quantum network. While perfect state transfer has received a lot of attention, fractional revival is newer and less studied. One…
A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…
We investigate the quantum state transfer in a chain of particles satisfying q-deformed oscillators algebra. This general algebraic setting includes the spin chain and the bosonic chain as limiting cases. We study conditions for perfect…
Although a complete picture of the full evolution of complex quantum systems would certainly be the most desirable goal, for particular Quantum Information Processing schemes such an analysis is not necessary. When quantum correlations…
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…
In a recent work (arXiv:2207.01954), we showed that a uniformly coupled chain could be symmetrically extended by engineered spin chains in such a way that we could choose part of the spectrum of the overall system. When combined with an…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
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 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…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
The study of perfect state transfer on graphs has attracted a great deal of attention during the past ten years because of its applications to quantum information processing and quantum computation. Perfect state transfer is understood to…
In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is…