Related papers: Quantum routing in planar graph using perfect stat…

Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to…

Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…

Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…

We study a quantum state transfer between spins interacting with an arbitrary network of spins coupled by uniform XX interactions. It is shown that in such a system under fairly general conditions, we can expect a nearly perfect transfer of…

We study the routing of quantum information in parallel on multi-dimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits using Josephson junctions and…

A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…

We address the problem of routing quantum and classical information from one sender to many possible receivers in a network. By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete…

The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of…

Routing classical and quantum information is a fundamental task for quantum information technologies and processes. Here, we consider information encoded in the position of a quantum walker on a graph, and design an optimal structure to…

A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…

A programmable quantum networks model is used in this paper for development of methods of control of a quantum state transport. These methods may be applied for a wide variety of patterns of controlled state transmission and spreading in…

This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…

Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…

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…

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.…

Large-scale communication networks, such as the internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication…

A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…

We study a quantum state transfer between two qubits interacting with the ends of a quantum wire consisting of linearly arranged spins coupled by an excitation conserving, time-independent Hamiltonian. We show that if we control the…

We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one.…