  The goal of quantum circuit transformation is to construct mappings from
logical quantum circuits to physical ones in an acceptable amount of time, and
in the meantime to introduce as few auxiliary gates as possible. We present an
effective approach to constructing the mappings. It consists of two key steps:
one makes use of a combined subgraph isomorphism and complement (CSIC) to
initialize a mapping, the other dynamically adjusts the mapping by using Tabu
search-based adjustment (TSA). Our experiments show that, compared with the
very recent method wghtgraph considered in the literature, CSIC can save 22.43%
of auxiliary gates and reduce the depth of output circuits by 8.46% on average
in the initialization of the mapping, and TSA has a better scalability than
many state-of-the-art algorithms for adjusting mappings.
