A study of the performance of D-Wave quantum computers using spanning trees

A study of the performance of D-Wave quantum computers using spanning trees

Show other versions (1)

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 <i>G</i>. Problem input consists of values for the fields <i>h<sub>j</sub></i> and for the two-qubit interacti...

Full description

Bibliographic Details
Main Author: Hall, John Spencer
Other Authors: Mark A. Novotny
Format: Others
Language:en
Published: MSSTATE 2018
Subjects:
Physics and Astronomy
Online Access:http://sun.library.msstate.edu/ETD-db/theses/available/etd-03232018-182649/
id ndltd-MSSTATE-oai-library.msstate.edu-etd-03232018-182649
record_format oai_dc
spelling ndltd-MSSTATE-oai-library.msstate.edu-etd-03232018-1826492019-05-15T18:44:00Z A study of the performance of D-Wave quantum computers using spanning trees Hall, John Spencer Physics and Astronomy 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 <i>G</i>. Problem input consists of values for the fields <i>h<sub>j</sub></i> and for the two-qubit interactions <i>J<sub>i,j</sub></i> of an Ising spin-glass problem formulated on <i>G</i>. Output is returned in terms of a spin configuration {<i>s<sub>j</sub></i>}, with <i>s<sub>j</sub></i> = +1 or -1. We generated random spanning trees (RSTs) uniformly distributed over all spanning trees of <i>G</i>. On the 476-qubit D-Wave 2, RSTs were generated on the full chip with <i>J<sub>i,j</sub></i> = -1 and <i>h<sub>j</sub></i> = 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. Mark A. Novotny Hyeona Lim R. Torsten Clay MSSTATE 2018-05-07 text application/pdf http://sun.library.msstate.edu/ETD-db/theses/available/etd-03232018-182649/ http://sun.library.msstate.edu/ETD-db/theses/available/etd-03232018-182649/ en unrestricted I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, Dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to Mississippi State University Libraries or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, Dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, Dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, Dissertation, or project report.
collection NDLTD
language en
format Others
sources NDLTD
topic Physics and Astronomy
spellingShingle Physics and Astronomy
Hall, John Spencer
A study of the performance of D-Wave quantum computers using spanning trees
description 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 <i>G</i>. Problem input consists of values for the fields <i>h<sub>j</sub></i> and for the two-qubit interactions <i>J<sub>i,j</sub></i> of an Ising spin-glass problem formulated on <i>G</i>. Output is returned in terms of a spin configuration {<i>s<sub>j</sub></i>}, with <i>s<sub>j</sub></i> = +1 or -1. We generated random spanning trees (RSTs) uniformly distributed over all spanning trees of <i>G</i>. On the 476-qubit D-Wave 2, RSTs were generated on the full chip with <i>J<sub>i,j</sub></i> = -1 and <i>h<sub>j</sub></i> = 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.
author2 Mark A. Novotny
author_facet Mark A. Novotny
Hall, John Spencer
author Hall, John Spencer
author_sort Hall, John Spencer
title A study of the performance of D-Wave quantum computers using spanning trees
title_short A study of the performance of D-Wave quantum computers using spanning trees
title_full A study of the performance of D-Wave quantum computers using spanning trees
title_fullStr A study of the performance of D-Wave quantum computers using spanning trees
title_full_unstemmed A study of the performance of D-Wave quantum computers using spanning trees
title_sort study of the performance of d-wave quantum computers using spanning trees
publisher MSSTATE
publishDate 2018
url http://sun.library.msstate.edu/ETD-db/theses/available/etd-03232018-182649/
work_keys_str_mv AT halljohnspencer astudyoftheperformanceofdwavequantumcomputersusingspanningtrees
AT halljohnspencer studyoftheperformanceofdwavequantumcomputersusingspanningtrees
_version_ 1719086069518958592

Similar Items