Parallel Token Swapping for Qubit Routing

Abstract

In this paper we study a combinatorial reconfiguration problem that involves finding an optimal sequence of swaps to move an initial configuration of tokens that are placed on the vertices of a graph to a final desired one. This problem arises as a crucial step in reducing the depth of a quantum circuit when compiling a quantum algorithm. We provide the first known constant factor approximation algorithms for the parallel token swapping problem on graph topologies that are commonly found in modern quantum computers, including cycle graphs, subdivided star graphs, and grid graphs. We also study the so-called stretch factor of a natural lower bound to the problem, which has been shown to be useful when designing heuristics for the qubit routing problem. Finally, we study the colored version of this reconfiguration problem where some tokens share the same color and are considered indistinguishable.

Figures (4)

• Figure 1: Orientation of Cycle Graphs
• Figure 2: Qubit Routing on a complete graph using two matchings.
• Figure 3: The partitioning of the edge set $E$ into $F_2, A$ and $B$ in ladder graphs. $F_1 = A\cup B$.
• Figure 4: Simulating the routing from $F_2$ using the three matchings $A, B$ and $A$.

Theorems & Definitions (60)

• Theorem 1
• Theorem 2
• Theorem 3
• Theorem 4
• Theorem 5
• Theorem 6
• Remark 7
• Definition 8: Lower Bound
• Definition 9: Stretch Factor
• Theorem \ref{thm:hardness}