Quantum Circuit Transformation Based on Tabu Search
arXiv:2104.05214
Abstract
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.
References in corpus (9)
- Elementary gates for quantum computation
- A quantum memory with near-millisecond coherence in circuit QED
- Resource-Aware Quantum Programming with General Recursion and Quantum Control
- Decompositions of general quantum gates
- Timing and resource-aware mapping of quantum circuits to superconducting processors
- Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
- On the qubit routing problem
- Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
- Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design