期刊
2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
卷 -, 期 -, 页码 974-981出版社
IEEE
DOI: 10.1109/cec.2019.8790000
关键词
Iterative Heuristic; Rollout; Quantum Circuit Compilation; Scheduling
资金
- Capability Systems Centre, University of New South Wales, Canberra
This study investigates the makespan minimization problem that arises when compiling a general class of quantum algorithms into near-term quantum hardware. The problem is referred to as quantum circuit compilation problem (QCCP). Two new heuristics are proposed for solving the problem. Firstly, a rollout based sequential decision making approach is investigated. This heuristic decides on which operation to schedule next based on the makespan projection given by a guiding priority rule. Secondly, a stochastic version of rollout heuristic is proposed which iteratively switches between rollout and a simple priority rule to explore the search space. The two proposed heuristics are able to show improvement in makespan across a range of instance sizes and characteristics.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据