Related papers: Quantum state transfer on the complete bipartite g…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be…
We characterize perfect state transfer on real-weighted graphs of the Johnson scheme $\mathcal{J}(n,k)$. Given $\mathcal{J}(n,k)=\{A_1, A_2, \cdots, A_k\}$ and $A(X) = w_0A_0 + \cdots + w_m A_m$, we show, using classical number theory…
The issue of quantum states' transfer -- in particular, for so-called Perfect State Transfer (PST) -- in the networks represented by the spin chains seems to be one of the major concerns in quantum computing. Especially, in the context of…
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,…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We experimentally demonstrate the transfer of an unknown single-qubit state from Alice to Bob via a two-step discrete-time quantum random walk on a cycle with four vertices on a four-qubit nuclear magnetic resonance quantum processor. The…
A programmable quantum networks model is used in this paper for development of methods of control of a quantum state transport. These methods may be applied for a wide variety of patterns of controlled state transmission and spreading in…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We establish the theory for pretty good state transfer in discrete-time quantum walks. For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph; more…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
One spin excitation states are involved in the transmission of quantum states and entanglement through a quantum spin chain, the localization properties of these states are crucial to achieve the transfer of information from one extreme of…
We present a perfect state transfer protocol via a qubit chain with the evolution governed by the $xx$ Hamiltonian. In contrast to the recent protocol announced in [Phys. Rev. Lett. {\bf 101}, 230502 (2008)], our method does not demand any…
We propose a simple scheme for the quantum teleportation of both bipartite and multipartite entangled coherent states with the successful probability 1/2. The scheme is based on only linear optical devices such as beam splitters and phase…
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…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
We exploit a ferromagnetic chain of interacting $d$-level ($d>2$) particles for arbitrary perfect transfer of quantum states with $(d-1)$ levels. The presence of one extra degree of freedom in the Hilbert space of particles, which is not…
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…
Chains of transmon qubits are considered promising systems to implement different quantum information tasks. In particular as channels that perform high-quality quantum state transfer. We study how changing the interaction strength between…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…