Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
复制标题
DOI：
10.1007/s11128-010-0200-3
复制
发表时间：
2011-06-01
影响因子：
2.5
通讯作者：
Choi, Vicky
中科院分区：
文献类型：
--
作者：
Choi, Vicky
在Choi（量子INF过程，7：193-209，2008）中，我们介绍了绝热量子优化的次要插入概念。量子硬件图U中图G的次要插入是U的子图，因此可以通过收缩边缘从其获得G。在本文中，我们描述了交织在一起的绝热量子体系结构设计问题，即构建一个满足所有已知物理约束的硬件图U，同时允许有效的小型插入算法。我们说明了一个最佳的完整刻画硬件图。给定图形f，如果对于f中的每个图G，则称为f-minor universal，则u包含G。 （稀疏）F由稀疏图（例如，有界度图）组成的F型。
In Choi (Quantum Inf Process, 7:193-209, 2008), we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such that G can be obtained from it by contracting edges. In this paper, we describe the intertwined adiabatic quantum architecture design problem, which is to construct a hardware graph U that satisfies all known physical constraints and, at the same time, permits an efficient minor-embedding algorithm. We illustrate an optimal complete-graph-minor hardware graph. Given a family F of graphs, a (host) graph U is called F-minor-universal if for each graph G in F, U contains a minor-embedding of G. The problem for designing a F-minor-universal hardware graph U(sparse) in which F consists of a family of sparse graphs (e.g., bounded degree graphs) is open.