Related papers: Perfect State Transfer in Two and Three Dimensiona…
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…
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…
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…
We show how two many-body, generally mixed, quantum states can be swapped via collective, all-to-all interactions. Specifically, we present an experimentally relevant implementation for quantum dots that enables coherent exchange of quantum…
Quantum teleportation provides a way to transmit unknown quantum states from one location to another. In the quantum world, multilevel systems which enable high-dimensional systems are more prevalent. Therefore, to completely rebuild the…
Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a…
We theoretically investigate electron spin operations driven by applied electric fields in a semiconductor double quantum dot (DQD). Our model describes a DQD formed in semiconductor nanowire with longitudinal potential modulated by local…
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 investigate quantum state transfer in XY spin chains and propose a recursive procedure to construct the nonuniform couplings of these chains with arbitrary length to achieve perfect state transfer(PST). We show that this method is…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
We consider transfer of single and multi-qubit states on a quasi-1D lattice, where the time evolutions involved in the state transfer protocol are generated by only 1D Hamiltonians. We use the quasi-1D isotropic Heisenberg model under a…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
In various physical implementations of quantum information processing, qubits are realized in a Lambda type system configuration as two stable lower energy levels coupled indirectly via an unstable higher energy level, that is, in…
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…
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…
The transfer of quantum information between different locations is key to many quantum information processing tasks. Whereas, the transfer of a single qubit state has been extensively investigated, the transfer of a many-body system…
A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent…
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…
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 propose a strategy for perfect state transfer in spin chains based on the use of an unmodulated coupling Hamiltonian whose coefficients are explicitly time dependent. We show that, if specific and non-demanding conditions are satisfied…