221 citations · 564 across the 8 of their papers we have counts for
8 papers
Planning for Compilation of a Quantum Algorithm for Graph Coloring
Minh Do, Zhihui Wang, Bryan O'Gorman +3
The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temp…
Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
Kyle E. C. Booth, Minh Do, J. Christopher Beck +3
Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The resear…
Compiling quantum circuits to realistic hardware architectures using temporal planners
Davide Venturelli, Minh Do, Eleanor Rieffel +1
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with…
A case study in programming a quantum annealer for hard operational planning problems
Eleanor G. Rieffel, Davide Venturelli, Bryan O'Gorman +3
We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the per…
On-line Planning and Scheduling: An Application to Controlling Modular Printers
Wheeler Ruml, Minh Binh Do, Rong Zhou +1
We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain…
SAPA: A Multi-objective Metric Temporal Planner
M. Do, S. Kambhampati
SAPA is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of h…