期刊
QUANTUM INFORMATION PROCESSING
卷 16, 期 4, 页码 -出版社
SPRINGER
DOI: 10.1007/s11128-016-1513-7
关键词
Minor embedding; Adiabatic quantum computing; Quantum annealing; Clique minor; Graph theory
资金
- US Department of Defense
- Computational Research and Development Programs at Oak Ridge National Laboratory
- UT-Battelle
- LLC [DE-AC0500OR22725]
- US Department of Energy
Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph K-N,K-N has a MSC of N minors, from which KN+1 is identified as the largest clique minor of KN, N. The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据