COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER
| dc.contributor.author | Snow-Kropla, Elliot | |
| dc.contributor.copyright-release | Not Applicable | en_US |
| dc.contributor.degree | Master of Science | en_US |
| dc.contributor.department | Department of Physics & Atmospheric Science | en_US |
| dc.contributor.ethics-approval | Not Applicable | en_US |
| dc.contributor.external-examiner | n/a | en_US |
| dc.contributor.graduate-coordinator | Dr. Kevin Hewitt | en_US |
| dc.contributor.manuscripts | Not Applicable | en_US |
| dc.contributor.thesis-reader | Dr. Daniel Labrie | en_US |
| dc.contributor.thesis-reader | Dr. Scott Chapman | en_US |
| dc.contributor.thesis-supervisor | Dr. Jordan Kyriakidis | en_US |
| dc.date.accessioned | 2014-08-14T17:45:52Z | |
| dc.date.available | 2014-08-14T17:45:52Z | |
| dc.date.defence | 2014-08-08 | |
| dc.date.issued | 2014-08-14 | |
| dc.description.abstract | A method for compiling programs for adiabatic quantum computers is described, and the resulting programs evaluated on a physically implemented adiabatic quantum machine. These results are used to characterize the performance of the machine. The AQC machine is found to perform well on some problems with linear scaling with problem size for some instances, but it performs poorly on others and is unable to solve a 6-variable satisfiability problem at all. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10222/53780 | |
| dc.language.iso | en | en_US |
| dc.subject | Physics | en_US |
| dc.subject | Quantum Computing | en_US |
| dc.title | COMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER | en_US |