期刊
出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3149526.3149530
关键词
quantum computing; optimization; approximation algorithms
资金
- NASA [NNX12AK33A]
- NASA Academic Mission Services [NNA16BD14C]
- NASA Space Technology Research Fellowship
- NASA Advanced Exploration Systems program
- NASA Ames Research Center
Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据