Related papers: Simple Quantum Coins Enable Pretty Good State Tran…
Quantum walks (QWs) describe particles evolving coherently on a lattice. The internal degree of freedom corresponds to a Hilbert space, called coin system. We consider QWs on Cayley graphs of some group $G$. In the literature,…
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momentum of ultracold rubidium atoms (the walk space) and two internal atomic states (the "coin" degree of freedom). Our scheme is highly…
We introduce an elementary quantum system consisting of a set of spins on a graph and a particle hopping between its nodes. The quantum state is build sequentially, applying a unitary transformation that couples neighboring spins and, at a…
The quadratic unitary Cayley graph $\mathcal{G}_{\mathbb{Z}_n}$ has vertex set $\mathbb{Z}_n: =\{0,1, \ldots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if and only if $u - v$ or $v-u$ is a square of some units in $\mathbb{Z}_n$.…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
We analyze the strengths and limitations of steered discrete time quantum walks in generating quantum states of bipartite quantum systems comprising of a qubit coupled to a qudit system. We demonstrate that not all quantum states in the…
We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…
In a recent paper it has been shown how to create a quantum state related to the prime number sequence using Grover's algorithm. Moreover, its multiqubit entanglement was analyzed. In the present work, we compare the multiqubit entanglement…
Spin-1 systems, in comparison to spin-1/2 systems, offer a better security for encoding and transfer of quantum information, primarily due to their larger Hilbert spaces. Superconducting artificial atoms possess multiple energy-levels,…
Quantum state transfer is one of the basic tasks in quantum information processing. We here propose a theoretical approach to realize arbitrary entangled state transfer through a qubit chain, which is a class of extended…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
In this letter we propose a superadiabatic protocol where quantum state transfer can be achieved with arbitrarily high accuracy and minimal control across long spin chains with an odd number of spins. The quantum state transfer protocol…
We examine the role of quantum error correction (QEC) in achieving pretty good quantum state transfer over a class of $1$-d spin Hamiltonians. Recasting the problem of state transfer as one of information transmission over an underlying…
High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbors…
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell…
Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions…
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive…
There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for…