Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

Details Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

2010-01-18

arxiv.org/abs/1001.3116v2

Quantum Information Processing: Volume 10, Issue 3 (2011), Page 343

Physics

Quantum Physics

10 pages, 5 figures

Scientific paper

10.1007/s11128-010-0200-3

In [Choi08], 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.

Affiliated with

Also associated with

No associations

Rating

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661482