Planning for Compilation of a Quantum Algorithm for Graph Coloring

02/23/2020
by   Minh Do, et al.
0

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 temporal planning is an attractive approach for part of this compilationtask, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to the MaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOA for Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we apply a planning approach to qubit initialization. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds, and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring. These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2017

Compiling Quantum Circuits to Realistic Hardware Architectures using Temporal Planners

To run quantum algorithms on emerging gate-model quantum hardware, quant...
research
03/19/2018

Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation

Recently, the makespan-minimization problem of compiling a general class...
research
07/18/2023

No distributed quantum advantage for approximate graph coloring

We give an almost complete characterization of the hardness of c-colorin...
research
09/15/2021

Short Quantum Circuits in Reinforcement Learning Policies for the Vehicle Routing Problem

Quantum computing and machine learning have potential for symbiosis. How...
research
08/29/2019

Practical implementation of a quantum backtracking algorithm

In previous work, Montanaro presented a method to obtain quantum speedup...
research
07/29/2022

Domain-Specific Quantum Architecture Optimization

With the steady progress in quantum computing over recent years, roadmap...

Please sign up or login with your details

Forgot password? Click here to reset