Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
نویسندگان
چکیده
منابع مشابه
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
In [6], 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 constra...
متن کاملMinor-embedding in adiabatic quantum computation: I. The parameter setting problem
We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph G can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of G in the quantum hardware graph U . There are two components to this reduction: embedding and parameter setting. The embedding problem is to find a minor-embedding...
متن کاملAdiabatic quantum programming: minor embedding with hard faults
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Thesemethods ext...
متن کاملA universal planar graph under the minor relation
We construct an in nite planar graph that contains every planar graph as a minor.
متن کاملGraph Minor Theory László
A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski’s characterization of planar graphs, and a far-reaching generalization of this, conjectured by Wagner: If a class of graphs is minor-closed (i.e., it is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2010
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-010-0200-3