Return to search

A Study Of The Performance Of D-Wave Quantum Computers Using Spanning Trees

The performances of two D-Wave 2 machines (476 and 496 qubits) and of a 1097-qubit D-Wave 2X were investigated. Each chip has a Chimera interaction graph G. Problem input consists of values for the fields hj and for the two-qubit interactions Ji,j of an Ising spin-glass problem formulated on G. Output is returned in terms of a spin configuration {sj}, with sj = +1 or -1. We generated random spanning trees (RSTs) uniformly distributed over all spanning trees of G. On the 476-qubit D-Wave 2, RSTs were generated on the full chip with Ji,j = -1 and hj = 0 and solved one thousand times. The distribution of solution energies and the average magnetization of each qubit were determined. On both the 476- and 1097-qubit machines, four identical spanning trees were generated on each quadrant of the chip. The statistical independence of the these regions was investigated.

Identiferoai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-1301
Date04 May 2018
CreatorsHall, John Spencer
PublisherScholars Junction
Source SetsMississippi State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceTheses and Dissertations

Page generated in 0.0018 seconds