Workshop paper
Reports on the 2015 AAAI Workshop Series
Stefano V. Albrecht, J. Christopher Beck, et al.
AAAI 2015
Quantum circuit compilation (QCC) is an important problem in the emerging field of quantum computing. The problem has a strong relevance to combinatorial search, as solving approaches recently published include constraint programming and temporal planning. In this paper, we focus on a complexity analysis of quantum circuit compilation. We formulate a makespan optimization problem based on QCC, and prove that the problem is NP-complete. To the best of our knowledge, this is the first study on the theoretical complexity of QCC.
Stefano V. Albrecht, J. Christopher Beck, et al.
AAAI 2015
Daniel Fišer, Daniel Gnad, et al.
IJCAI 2021
Carlos Hernández Ulloa, Adi Botea, et al.
IJCAI 2017
Adi Botea, Jussi Rintanen, et al.
IEEE Transactions on Smart Grid