Related papers: Quantum routing of information using chiral quantu…
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…
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…
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…
Quantum transport across discrete structures is a relevant topic of solid state physics and quantum information science, which can be suitably studied in the context of continuous-time quantum walks. The addition of phases degrees of…
We exploit controlled breaking of time-reversal symmetry to realize coherent routing of quantum information in spin networks. The key component of our scheme is a spin triangle whose chirality is determined by the quantum state of a control…
Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum…
Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…
We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path…
In superconducting quantum circuits (SQCs), chiral routing quantum information is often realized with the ferrite circulators, which are usually bulky, lossy and require strong magnetic fields. To overcome those problems, we propose a novel…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
We investigate novel transport properties of chiral continuous-time quantum walks (CTQWs) on graphs. By employing a gauge transformation, we demonstrate that CTQWs on chiral chains are equivalent to those on non-chiral chains, but with…
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…
In purely coherent transport on finite networks, destructive interference can significantly suppress transfer probabilities, which can only reach high values through careful fine-tuning of the evolution time or tailored initial-state…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
We study the routing of quantum information in qubit chains. This task is achieved by suitably chosen time-dependent local fields acting on the qubits. Employing the physics of coherent destruction of tunneling, we demonstrate that a…