Variational Algorithms and Resources for Near-Term Quantum Simulation

dc.contributor.advisorJordan, Stephen Pen_US
dc.contributor.advisorSau, Jayen_US
dc.contributor.authorSewell, Troy Jacoben_US
dc.contributor.departmentPhysicsen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2023-10-07T05:43:12Z
dc.date.available2023-10-07T05:43:12Z
dc.date.issued2023en_US
dc.description.abstractThe difficultly of efficiently simulating quantum many-body systems was one of the first motivations for developing quantum computers and may also be one of the first applications to find practical computational advantage on real quantum hardware. With the relatively recent advent of publicly available quantum technologies, we have now entered the era of noisy intermediate-scale quantum (NISQ) computing. The capabilities of these technologies are evolving rapidly, and with them the computational affordances to which we have access. The time is now ripe to test the capabilities of existing quantum hardware and leverage them to the best of our ability toward achieving a practical quantum computational advantage. In this dissertation, we address these aims by benchmarking a class of variational multi-scale quantum circuits for state preparation which are locally robust against noise. We demonstrate the advantages of these multi-scale circuits compared to a purely local circuit ansatz using the critical transverse-field Ising model to optimize circuit parameters, numerically test the noise resilience of observables and customized error mitigation techniques using a local gate noise model, and demonstrate the robustness of local subregion preparation on an existing ion-trap quantum computer. We then show how the ground state optimized circuit can be simply extended to an ansatz for thermal state preparation using the separation of energy scales afforded by the multi-scale circuit structure. Additionally, we evaluate the quantum resources needed for some quantum simulation tasks. We estimate the gate complexity of the site-by-site algorithm for fault-tolerant ground state preparation, which we extend to the case of degenerate Hamiltonians. Using matrix product states we evaluate the non-stabilizer quantum resources needed to represent thermalized subregions of a chaotic Potts model, which we use to address the feasibility for classical simulation of quantum hydrodynamics.en_US
dc.identifierhttps://doi.org/10.13016/dspace/hagp-bswx
dc.identifier.urihttp://hdl.handle.net/1903/30862
dc.language.isoenen_US
dc.subject.pqcontrolledQuantum physicsen_US
dc.titleVariational Algorithms and Resources for Near-Term Quantum Simulationen_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Sewell_umd_0117E_23713.pdf
Size:
8.1 MB
Format:
Adobe Portable Document Format