- 1906.10955v1
Final published version, 1.87 MB, PDF document

Available under license: None

Research output: Contribution to Journal/Magazine › Journal article

Published

In: arxiv.org, 26.06.2019.

Research output: Contribution to Journal/Magazine › Journal article

Pelofske, E, Hahn, G & Djidjev, H 2019, 'Optimizing the spin reversal transform on the D-Wave 2000Q', *arxiv.org*.

Pelofske, E., Hahn, G., & Djidjev, H. (2019). Optimizing the spin reversal transform on the D-Wave 2000Q. *arxiv.org*.

Pelofske E, Hahn G, Djidjev H. Optimizing the spin reversal transform on the D-Wave 2000Q. arxiv.org. 2019 Jun 26.

@article{99a71028a92e47cd8ab19b29f1c0c785,

title = "Optimizing the spin reversal transform on the D-Wave 2000Q",

abstract = " Commercial quantum annealers from D-Wave Systems make it possible to obtain approximate solutions of high quality for certain NP-hard problems in nearly constant time. Before solving a problem on D-Wave, several preprocessing methods can be applied, one of them being the so-called spin reversal or gauge transform. The spin reversal transform flips the sign of selected variables and coefficients of the Ising or QUBO (quadratic unconstrained binary optimization) representation of the problem that D-Wave minimizes. The spin reversal transform leaves the ground state of the Ising model invariant, but can average out the biases induced through analog and systematic errors on the device, thus improving the quality of the solution that D-Wave returns. This work investigates the effectiveness of the spin reversal transform for D-Wave 2000Q. We consider two important NP-hard problems, the Maximum Clique and the Minimum Vertex Cover problems, and show on a variety of input problem graphs that using the spin reversal transform can yield substantial improvements in solution quality. In contrast to the native spin reversal built into D-Wave, we consider more general ways to reverse individual spins and we investigate the dependence on the problem type, on the spin reversal probability, and possible advantages of carrying out reversals on the qubit instead of the chain level. Most importantly, for a given individual problem, we use our findings to optimize the spin reversal transform using a genetic optimization algorithm. ",

keywords = "quant-ph",

author = "Elijah Pelofske and Georg Hahn and Hristo Djidjev",

year = "2019",

month = jun,

day = "26",

language = "Undefined/Unknown",

journal = "arxiv.org",

}

TY - JOUR

T1 - Optimizing the spin reversal transform on the D-Wave 2000Q

AU - Pelofske, Elijah

AU - Hahn, Georg

AU - Djidjev, Hristo

PY - 2019/6/26

Y1 - 2019/6/26

N2 - Commercial quantum annealers from D-Wave Systems make it possible to obtain approximate solutions of high quality for certain NP-hard problems in nearly constant time. Before solving a problem on D-Wave, several preprocessing methods can be applied, one of them being the so-called spin reversal or gauge transform. The spin reversal transform flips the sign of selected variables and coefficients of the Ising or QUBO (quadratic unconstrained binary optimization) representation of the problem that D-Wave minimizes. The spin reversal transform leaves the ground state of the Ising model invariant, but can average out the biases induced through analog and systematic errors on the device, thus improving the quality of the solution that D-Wave returns. This work investigates the effectiveness of the spin reversal transform for D-Wave 2000Q. We consider two important NP-hard problems, the Maximum Clique and the Minimum Vertex Cover problems, and show on a variety of input problem graphs that using the spin reversal transform can yield substantial improvements in solution quality. In contrast to the native spin reversal built into D-Wave, we consider more general ways to reverse individual spins and we investigate the dependence on the problem type, on the spin reversal probability, and possible advantages of carrying out reversals on the qubit instead of the chain level. Most importantly, for a given individual problem, we use our findings to optimize the spin reversal transform using a genetic optimization algorithm.

AB - Commercial quantum annealers from D-Wave Systems make it possible to obtain approximate solutions of high quality for certain NP-hard problems in nearly constant time. Before solving a problem on D-Wave, several preprocessing methods can be applied, one of them being the so-called spin reversal or gauge transform. The spin reversal transform flips the sign of selected variables and coefficients of the Ising or QUBO (quadratic unconstrained binary optimization) representation of the problem that D-Wave minimizes. The spin reversal transform leaves the ground state of the Ising model invariant, but can average out the biases induced through analog and systematic errors on the device, thus improving the quality of the solution that D-Wave returns. This work investigates the effectiveness of the spin reversal transform for D-Wave 2000Q. We consider two important NP-hard problems, the Maximum Clique and the Minimum Vertex Cover problems, and show on a variety of input problem graphs that using the spin reversal transform can yield substantial improvements in solution quality. In contrast to the native spin reversal built into D-Wave, we consider more general ways to reverse individual spins and we investigate the dependence on the problem type, on the spin reversal probability, and possible advantages of carrying out reversals on the qubit instead of the chain level. Most importantly, for a given individual problem, we use our findings to optimize the spin reversal transform using a genetic optimization algorithm.

KW - quant-ph

M3 - Journal article

JO - arxiv.org

JF - arxiv.org

ER -