Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation

TL;DR

This paper presents algorithms that improve quantum circuit mapping on NISQ computers by combining gate transformation and commutation rules, resulting in more efficient mappings with potentially higher accuracy.

Contribution

It introduces new algorithms that utilize both gate transformation and commutation rules for quantum circuit mapping, enhancing previous methods.

Findings

Algorithms with combined rules outperform previous best algorithms.

More rules lead to better circuit mappings.

Experimental results confirm improved mapping quality.

Abstract

This paper addresses quantum circuit mapping for Noisy Intermediate-Scale Quantum (NISQ) computers. Since NISQ computers constraint two-qubit operations on limited couplings, an input circuit must be transformed into an equivalent output circuit obeying the constraints. The transformation often requires additional gates that can affect the accuracy of running the circuit. Based upon a previous work of quantum circuit mapping that leverages gate commutation rules, this paper shows algorithms that utilize both transformation and commutation rules. Experiments on a standard benchmark dataset confirm the algorithms with more rules can find even better circuit mappings compared with the previously-known best algorithms.