Related papers: Perfect chiral quantum routing
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…
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this context, the notion of quantum hitting time is very important,…
Quantum computers have the potential to outperform classical computers, but are currently limited in their capabilities. One such limitation is the restricted connectivity between qubits, as captured by the hardware's coupling graph. This…
We introduce a scheme for perfect routing of quantum states and entanglement in regular cavity QED networks. The couplings between the cavities are quasi-uniform and each cavity is doped with a two-level atom. Quasi-uniform couplings leads…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
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…
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 present a stack model for breaking down the complexity of entanglement-based quantum networks. More specifically, we focus on the structures and architectures of quantum networks and not on concrete physical implementations of network…
This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access…
Testing graph completeness is a critical problem in computer science and network theory. Leveraging quantum computation, we present an efficient algorithm using the Szegedy quantum walk and quantum phase estimation (QPE). Our algorithm,…
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to…
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…
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…
We address continuous-time quantum walks on graphs, and discuss whether and how quantum-limited measurements on the walker may extract information on the tunnelling amplitude between the nodes of the graphs. For a few remarkable families of…
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…
Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous,…