We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design.
- Authors
Choi, Vicky
- Abstract
In Choi (Quantum Inf Process, 7:193-209, ), 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 $${\mathcal{F}}$$ of graphs, a (host) graph U is called $${\mathcal{F}}$$-minor-universal if for each graph G in $${\mathcal{F}, U}$$ contains a minor-embedding of G. The problem for designing a $${{\mathcal{F}}}$$-minor-universal hardware graph U in which $${{\mathcal{F}}}$$ consists of a family of sparse graphs (e.g., bounded degree graphs) is open.
- Subjects
EMBEDDED computer systems; QUANTUM computers; QUANTUM graph theory; COMPUTER algorithms; COMPUTER input-output equipment; COMPUTER systems; QUANTUM theory
- Publication
Quantum Information Processing, 2011, Vol 10, Issue 3, p343
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-010-0200-3