Accession Number : AD1011225

Title :   Compiling Planning into Quantum Optimization Problems: A Comparative Study

Descriptive Note : Conference Proceedings


Personal Author(s) : O'Gorman,Bryan ; Rieffel,Eleanor G ; Do,Minh ; Venturelli,Davide ; Frank,Jeremy

Full Text :

Report Date : 07 Jun 2015

Pagination or Media Count : 10

Abstract : One approach to solving planning problems is to compile them to another problem for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances encoded as Quadratic Unconstrained Binary Optimization (QUBO). Early quantum annealers are now available, and more sophisticated quantum annealers will likely be built over the next decades. Specific quantum annealing hardware implementations have specific constraints, restricting the types of QUBOs each can take as input. In this paper, we introduce the planning community to the key steps involved in compiling planning problems to quantum annealing hardware: a hardware-independent step, mapping, and a hardware-dependent step, embedding. After describing two approaches to mapping general planning problems to QUBO, we provide preliminary results from running an early quantum annealer on a parameterized family of hard planning problems. The results show that different mappings can lead to a substantial difference in performance, even when many superficial features of the resulting instances are similar. We also provide some insights gained from this early study, and suggest directions for future work.

Descriptors :   optimization , annealing , quantum computing , algorithms , coding , coefficients , embedding , histograms

Distribution Statement : APPROVED FOR PUBLIC RELEASE