Related papers: State Transfer in Complex Quantum Walks
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 propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube we determine a sub-hypercube that contains the pair of vertices as antipodal vertices. Then a…
New exactly solvable one-dimensional XX spin chain models that exhibit perfect state transfer are defined. These models have inhomogeneous couplings and magnetic fields determined from the three-term recurrence relations satisfied by the…
In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…
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 examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples…
We demonstrate that perfect state transfer can be achieved in an optical waveguide lattice governed by a Hamiltonian with modulated nearest-neighbor couplings. In particular, we report the condition that the evolution Hamiltonian should…
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…
We demonstrate mesoscopic transport through quantum states in quasi-1D lattices maintaining the combination of parity and time-reversal symmetries by controlling energy gain and loss. We investigate the phase diagram of the non-Hermitian…
We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices, bridging two developing fields of research in quantum information and spectral graph theory. We display results and simulations which…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
We study perfect state transfer and multiple state transfer in oriented normal Cayley graphs. We construct examples in a variety of groups, ranging from abelian to nonsolvable, and establish some general restrictions and nonexistence…
We consider an inhomogeneous XX spin chain which interpolates between the Krawtchouk one with perfect state transfer and the homogeneous XX chain. This model can be exploited in order to perform state transfer of a qubit with sufficiently…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another.…
The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group $D_n$. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph…