期刊
QUANTUM INFORMATION PROCESSING
卷 15, 期 1, 页码 495-508出版社
SPRINGER
DOI: 10.1007/s11128-015-1150-6
关键词
Graph minor; Clique minor; Chimera; Graph embedding; Adiabatic quantum computing; Quantum annealing
资金
- Mitacs Accelerate program
The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a Chimera graph CM, N, L. In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph. We define a combinatorial class of native clique minors in Chimera graphs with vertex images of uniform, near minimal size and provide a polynomial-time algorithm that finds a maximum native clique minor in a given induced subgraph of a Chimera graph. These minors allow improvement over recent work and have immediate practical applications in the field of quantum annealing.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据