Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 5 figures, submitted

Scientific paper

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 $G^{emb}$ of a graph $G$ in $U$, which is a subgraph of $U$ such that $G$ can be obtained from $G^{emb}$ by contracting edges. The parameter setting problem is to determine the corresponding parameters, qubit biases and coupler strengths, of the embedded Ising Hamiltonian. In this paper, we focus on the parameter setting problem. As an example, we demonstrate the embedded Ising Hamiltonian for solving the maximum independent set (MIS) problem via adiabatic quantum computation (AQC) using an Ising spin-1/2 system. We close by discussing several related algorithmic problems that need to be investigated in order to facilitate the design of adiabatic algorithms and AQC architectures.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem 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: I. The Parameter Setting Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-578503

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.