Related papers: Perfect quantum state transfer with randomly coupl…
Based on shortcuts to adiabaticity and quantum Zeno dynamics, we present a protocol to implement quantum state transfer (QST) in a quantum spin-1/2 chain. In the protocol, the complex Hamiltonian of an $N$-site system is simplified, and a…
We construct the exact solution for a family of one-half spin chains explicitly. The spin chains Hamiltonian corresponds to an isotropic Heisenberg Hamiltonian, with staggered exchange couplings that take only two different values. We work…
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on…
The transfer of information from one part of a quantum system to another is fundamental to the understanding and design of quantum information processing devices. In the realm of discrete systems such as spin chains, inhomogeneous networks…
We propose a multiple-range quantum communication channel to realize coherent two-way quantum state transport with high fidelity. In our scheme, an information carrier (a qubit) and its remote partner are both adiabatically coupled to the…
We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions…
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…
We introduce an analytical $XX$ spin chain with asymmetrical transport properties. It has an even number $N+1$ of sites labeled by $n=0,\cdots N$. It does not exhibit perfect state transfer (PST) from end-to-end but rather from the first…
Finding minimal time and establishing the structure of the corresponding optimal controls which can transfer a given initial state of a quantum system into a given target state is a key problem of quantum control. In this work, this problem…
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…
It is shown that effective quantum-state and entanglement transfer can be obtained by inducing a coherent dynamics in quantum wires with homogeneous intrawire interactions. This goal is accomplished by tuning the coupling between the wire…
We demonstrate that a translation invariant chain of interacting quantum systems can be used for high efficiency transfer of quantum entanglement and the generation of multi-particle entanglement over large distances and between arbitrary…
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…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes…
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…
For any graph $X$ with the adjacency matrix $A$, the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}_X(t)=\mathrm{e}^{itA}$. We say that there is perfect state transfer…
We demonstrate that the quantum communication between two parties can be significantly improved if the receiver is allowed to store the received signals in a quantum memory before decoding them. In the limit of an infinite memory, the…
A scheme is proposed for simultaneous intraportation of many unknown quantum states within a quantum computing network. It is shown that our scheme, much different from the teleportation in the strict sense, can be very similar to the…
The problem of the reliable transfer of entanglement from one pure bipartite quantum state to another using local operations is analyzed. It is shown that in the case of qubits the amount that can be transferred is restricted to the…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…