Related papers: Quantum routing in planar graph using perfect stat…
Quantum information processing protocols are efficiently implemented on spin-$\frac{1}{2}$ networks. A quantum communication protocol generally involves a certain number of parties having local access to a subset of a larger system, whose…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
We investigate quantum communication between the sites of a spin-ring with twisted boundary conditions. Such boundary conditions can be achieved by a flux through the ring. We find that a non-zero twist can improve communication through…
Linear chains of spins acting as quantum wires are a promising approach to achieve scalable quantum information processors. Nuclear spins in apatite crystals provide an ideal test-bed for the experimental study of quantum information…
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 construct commuting transfer matrices for models describing the interaction between a single quantum spin and a single bosonic mode using the quantum inverse scattering framework. The transfer matrices are obtained from certain…
It has been recently suggested that the dynamics of a quantum spin system may provide a natural mechanism for transporting quantum information. We show that one dimensional rings of qubits with fixed (time-independent) interactions,…
It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Transport of quantum information in linear spin chains has been the subject of much theoretical work. Experimental studies by nuclear spin systems in solid-state by NMR (a natural implementation of such models) is complicated since the…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is…
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…
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…
Quantum state transfer between different sites is a significant problem for quantum networks and quantum computers. By selecting quantum walks with two coins as the basic model and two coin spaces as the communication carriers, we…
We propose and analyze a scheme for conditional state transfer in a Heisenberg $XXZ$ spin chain which realizes a quantum spin transistor. In our scheme, the absence or presence of a control spin excitation in the central gate part of the…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
We show how to make quantum networks, both standard and entanglement-based, genuine quantum by providing them with the possibility of handling superposed tasks and superposed addressing. This extension of their functionality relies on a…
A uniformly coupled double quantum Hamiltonian for a spin chain has recently been implemented experimentally. We propose a method for the determination of initial quantum states that will provide perfect or near-perfect state transmission…