  The goal of quantum circuit transformation is to map a logical circuit to a
physical device by inserting additional gates as few as possible in an
acceptable amount of time. We present an effective approach called TSA to
construct the mapping. It consists of two key steps: one makes use of a
combined subgraph isomorphism and completion to initialize some candidate
mappings, the other dynamically modifies the mappings by using tabu
search-based adjustment. Our experiments show that, compared with
state-of-the-art methods GA, SABRE and FiDLS proposed in the literature, TSA
can generate mappings with a smaller number of additional gates and it has a
better scalability for large-scale circuits.
