Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp0170795b69h
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Houck, Andrew A | |
dc.contributor.author | Charbonneau, Andrew | |
dc.date.accessioned | 2020-10-02T20:22:12Z | - |
dc.date.available | 2020-10-02T20:22:12Z | - |
dc.date.created | 2020-05-04 | |
dc.date.issued | 2020-10-02 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp0170795b69h | - |
dc.description.abstract | This investigation details the formulation and implementation of a black-box descent optimization algorithm with adaptive scaling and momentum (AdamSPSA) to optimize the generation of a high-fidelity Cross Resonance (CR) gate on two indirectly coupled transmon superconducting qubits in an open quantum system, via the pulse-shaping of control microwave fields for single-qubit control amidst ongoing environmental interactions. Analysis of the computational simulation is presented in the form of quantified gate infidelity and quantum process tomography. The study finds the model successful in reducing initial gate infidelity for both Gaussian and cubic spline paramaterizations by over 30\%. However, final objectives remained insufficient relative to computation-caliber gates, implying a stronger model or additional human aid in situ is still required for suitable outcomes in multi-qubit quantum computation. | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | Black-Box Optimization Techniques with Adaptive Learning for Multi-Qubit Gate Optimization | |
dc.type | Princeton University Senior Theses | |
pu.date.classyear | 2020 | |
pu.department | Physics | |
pu.pdf.coverpage | SeniorThesisCoverPage | |
pu.contributor.authorid | 920090163 | |
Appears in Collections: | Physics, 1936-2020 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CHARBONNEAU-ANDREW-THESIS.pdf | 1.83 MB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.