Related papers: Perfect quantum state transfer in weighted paths w…
A recent numerical study of short chains found near-perfect quantum state transfer between the boundary sites of a spin-1/2 XX chain if a sufficiently strong magnetic field acts on these sites. We show that the phenomenon is based on a pair…
In recent years, significant progress has been made in the field of state transfer in spin chains, with the aim of achieving perfect state transfer for quantum information processing applications. Previous research has mainly focused on…
Quantum walks generated by the adjacency matrix or the Laplacian are known to exhibit low transfer fidelity on general graphs. In this paper, we study continuous-time quantum walks governed by the generalized Laplacian operator L_k = A+kD,…
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10],…
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…
We study a continous-time quantum walk on a path graph. In this paper, we show that, for any odd prime $p$ and positive integer $t$, the path on $2^t p - 1$ vertices admits pretty good state transfer between vertices $a$ and $n+1-a$ for…
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…
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…
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…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
We present several protocols for reliable quantum state transfer through a spin chain. We use a simple two-spin encoding to achieve a remarkably high fidelity transfer for an arbitrary quantum state. The fidelity of the transfer also…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
Connections between the 1-excitation dynamics of spin lattices and quantum walks on graphs will be surveyed. Attention will be paid to perfect state transfer (PST) and fractional revival (FR) as well as to the role played by orthogonal…
We demonstrate that perfect state transfer can be achieved using an engineered spin chain and clean local end-chain operations, without requiring the initialization of the state of the medium nor fine tuning of control-pulses. This…
We consider a coupled-cavity array, where each cavity interacts with an atom under the rotating-wave approximation. For a staggered pattern of inter-cavity couplings, a pair of field normal modes each bi-localized at the two array ends…
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…
In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
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…