[Colloquium] Andrew Litteken Dissertation Defense/Feb 28, 2023

[Megan Woodward]

This is an announcement of Andrew Litteken's Dissertation Defense.
===============================================
Candidate: Andrew Litteken

Date: Tuesday, February 28, 2023

Time:  3 pm CST

Remote Location:  https://uchicago.zoom.us/j/91440786037?pwd=T2pQY25JbGlYUDBzRHFpMWZsTDdtZz09

Location: JCL 298

Title: Adapting Compilation Strategies for Architecture-Specific Features for Quantum Computing

Abstract: Quantum Computing is in an era of growing pains. Quantum algorithms become more tuned to the computational capabilities of near-term quantum devices, and the need for compilation techniques that fully utilize the architecture while avoiding potential pitfalls are a necessity. Many different types quantum devices are being developed each with its own advantages and unique features It is unclear which architecture is dominant, and all are in active development. Some problems, such as limited connectivity, imperfect gate execution, and lower coherence times are shared across architectures, and mapping, routing and communication algorithms have been developed to circumvent and avoid these issues. But, each architecture has its own set of specific problems to overcome. It is not simply the case that a single compilation pipeline or set of algorithms will be able to make the best use of each of these architectures. This work proposes an exploration into adapting a general quantum compiler algorithm to several different architectures.
This thesis will focus on two main architectures, Neutral Atom and Superconducting qu- dit devices. Neutral Atom architectures have additional flexibility in routing qubits beyond nearest neighbor connectivity, while incurring some serialization cost due to increasingly large “areas of restruction”. But, we are still able to take advantage of these more flexible interactions through careful mapping and routing. Additionally, we can craft strategies that make use of these features to circumvent Neutral Atom Architectures’ biggest execution downfall: atom loss. Superconducting devices have natural extensibility to extra computa- tional states beyond the traditional |0⟩ and |1⟩ used in classical computing and most quantum computation. These extra states can be used to reduce the number of operations, but at the cost of slower operations and decreased stability of the computational units. Once again, we can adapt an existing base algorithm to mix-and-match qubit-only, mixed-radix, and higher- radix operations to develop efficient program that make use less resources and increase the chances of successful quantum computation.

Advisors: Fred Chong

Committee Members: Hank Hoffmann, Fred Chong, and Robert Rand




-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20230215/b9c1f4b1/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: andrew-litteken-dissertation.pdf
Type: application/pdf
Size: 5170766 bytes
Desc: andrew-litteken-dissertation.pdf
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20230215/b9c1f4b1/attachment-0001.pdf>