<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
</head>
<body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">
This is an announcement of Joshua Viszlai's MS Presentation<br class="">
===============================================<br class="">
Candidate: Joshua Viszlai<br class="">
<br class="">
Date: Wednesday, February 28, 2024<br class="">
<br class="">
Time: 9:30 am CST<br class="">
<br class="">
Location: JCL 390<br class="">
<br class="">
Title: Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead Fault-Tolerance<br class="">
<br class="">
Abstract: Despite the necessity of fault-tolerant quantum systems built on error correcting codes, many popular codes, such as the surface code, have prohibitively large overheads. This has spurred significant interest in quantum LDPC codes which can reduce
this overhead by an order of magnitude. Unfortunately, this reduction comes at the cost of many long-range interactions. The difficulty in implementing these long range interactions raises questions about the practical viability of quantum LDPC codes.<br class="">
<br class="">
In this work we identify quantum LDPC codes that can be used in practice by carefully matching their features with underlying hardware. We target a specific family, known as generalized- bicycle codes, which have the favorable property of repeated check structure.
We find this property can be exploited by quantum computers made from atom arrays, enabling an efficient implementation. Using numerical simulations, we evaluate the performance of generalized-bicycle codes in atom arrays and find comparable logical error
rates to surface codes, but with an order of magnitude lower qubit overhead.<br class="">
<br class="">
We then quantify the utility of this implementation in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a recently proposed mixed architecture where
data is stored in qLDPC memory but is loaded to surface codes for computation. We treat the mixed architecture as a simple memory hierarchy and analyze the dependence of performance on program structure and compilation. Overall, for most programs of interest
we find the mixed architecture leads to reduced costs compared to a standard, surface code only architecture. Additionally, we point out important compiler optimizations that emphasize qubit reuse and perform data prefetching to further improve the performance
of the mixed architecture.<br class="">
<br class="">
Advisors: Fred Chong<br class="">
<br class="">
Committee Members: Fred Chong, Hannes Bernien, and Robert Rand<br class="">
<div class="">
<div dir="auto" style="caret-color: rgb(0, 0, 0); color: rgb(0, 0, 0); letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: none; word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">
<div dir="auto" style="caret-color: rgb(0, 0, 0); color: rgb(0, 0, 0); letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: none; word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">
<div dir="auto" style="caret-color: rgb(0, 0, 0); color: rgb(0, 0, 0); letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: none; word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">
<br class="Apple-interchange-newline">
</div>
<br class="Apple-interchange-newline">
</div>
<br class="Apple-interchange-newline">
</div>
<br class="Apple-interchange-newline">
<br class="Apple-interchange-newline">
</div>
<br class="">
</body>
</html>