Related papers: Arbitrary perfect state transfer in $d$-level spin…
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…
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…
Quantum spin chains may be used to transfer quantum states between elements of a quantum information processing device. A scheme discovered recently \cite{BFR+12} was shown to have favorable transfer properties for ingle-qubit states even…
To transport high-quality quantum state between two distant qubits through one-dimensional spin chains, the perfect state transfer (PST) method serves as the first choice, due to its natively perfect transfer fidelity that is independent of…
We investigate the quality of quantum state transfer through a uniformly coupled antiferromagnetic spin chain in a multi-excitation subspace. The fidelity of state transfer using multi-excitation channels is found to compare well with…
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…
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…
Designing a good transfer channel for arbitrary quantum states in spin chains implies optimizing a cost function, usually the averaged fidelity of transmission. The fidelity of transmission measures how much the transferred state resembles…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
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…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…
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…
We study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices.…
Quantum state transfer is investigated beyond the nearest-neighbour coupling scheme in long spin-$\frac{1}{2}$ linear chains. Exploiting the properties of the next-nearest neighbour Hamiltonian's dispersion relation, it is shown that with…
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 propose a quantum-state transfer protocol in a spin chain that requires only the control of the spins at the ends of the quantum wire. The protocol is to a large extent insensitive to inhomogeneity caused by local magnetic fields and…
Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
A perfect quantum state transfer(QST) has been shown in an engineered spin chain with "always-on interaction". Here, we consider a more realistic problem for such a protocol, the quantum decoherence induced by a spatially distributed…
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of…