DeepAI AI Chat
Log In Sign Up

Quantum routing with fast reversals

by   Aniruddha Bapat, et al.

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n, we show that there exists a constant ϵ≈ 0.034 such that the quantum routing time is at most (1-ϵ)n, whereas any swap-based protocol needs at least time n-1. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k ≤ n qubits and give algorithms with quantum routing time at most n/3 + O(k^2) on paths and at most 2r/3 + O(k^2) on general graphs with radius r.


page 1

page 2

page 3

page 4


Opportunistic Routing in Quantum Networks

Unlike classical routing algorithms, quantum routing algorithms make use...

Algorithmic Theory of Qubit Routing

The qubit routing problem, also known as the swap minimization problem, ...

Advantages and limitations of quantum routing

The Swap gate is a ubiquitous tool for moving information on quantum har...

Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks

While it is known that unconditionally secure position-based cryptograph...

A stack-vector routing protocol for automatic tunneling

In a network, a tunnel is a part of a path where a protocol is encapsula...

Routing Protocols for Quantum Networks: Overview and Challenges

Over the past 50 years, conventional network routing design has undergon...

Circuit Transformations for Quantum Architectures

Quantum computer architectures impose restrictions on qubit interactions...