Finding Optimal Implementations of Non-native CNOT Gates using SAT
TimeWednesday, December 8th6:00pm - 7:00pm PST
LocationLevel 2 - Lobby
DescriptionQuantum computer architectures place restrictions on the availability of quantum gates. Thus, a given quantum circuit usually needs to be transformed to satisfy these restrictions. Existing transformation approaches tend to induce a significant overhead to enable the realization of CNOT gates that are not natively available. In this work, we propose a method to find optimal implementations of non-native CNOTs, i.e. using the minimal number of native CNOT and Hadamard gates, by using a Boolean Satisfiability (SAT) formulation. As confirmed by experimental results, this approach scales considerably well and enables us to determine significantly improved realizations of non-native CNOT gates.