Event
Ph.D. Research Proposal: Arda Aydin
Monday, August 31, 2026
5:00 p.m.
AVW 1146
Souad Nejjar
301 405 8135
snejjar@umd.edu
ANNOUNCEMENT: Ph.D. Research Proposal Exam
Name: Arda Aydin
Committee:
Professor Alexander Barg (Chair)
Professor Prakash Narayan
Professor Saikat Guha
Date/time: August 31, 2026 at 5:00 PM
Location: AVW 1146
Title: Advancing Fault-Tolerant Quantum Computing: From Symmetric Error-Correcting Spaces to Near-Term Finite-Length Quantum LDPC Codes
Abstract: Quantum error correction is essential for the realization of fault-tolerant quantum computing. Because a definitive winner in the race toward scalable quantum hardware has not yet been determined, quantum error correction codes compatible with various physical platforms are actively under investigation. This proposal presents several novel code constructions, ranging from those residing in symmetric code spaces, which are suitable for bosonic quantum systems, to near-term, finite-length quantum LDPC codes adapted to hardware architectures such as trapped ions and neutral atoms.
The first part of this completed research established theoretical frameworks for correcting both standard Pauli errors and the noise introduced by molecular platforms Specifically, we constructed permutationally invariant codes that correct quantum deletions and spontaneous decay, alongside a generalized family of absorption-emission codes. Building upon this, we introduced a geometric framework utilizing Tverberg's theorem and SU(q) representations to interconvert codes and logical gates across symmetric spaces, yielding efficient finite-length codes with near-linear distance scaling.
The second part focused on designing low-overhead quantum low-density parity-check (LDPC) codes promising for near-term devices. We introduced Cyclic Hypergraph Product (HGP) codes, utilizing global symmetries to outperform previously optimized HGP codes by up to three orders of magnitude in logical error rate. Additionally, by generalizing two-block group algebra constructions, we constructed Coset-based quantum LDPC codes that perform competitively with state-of-the-art bivariate bicycle codes under standard circuit-level noise.
Building on this completed work, the future research will focus on investigating the logical operators of the newly constructed coset-based quantum LDPC codes. Utilizing this, the proposed direction is to establish bounds on the distances of sequences of these codes. Finally, we plan to investigate the physical layout and qubit connectivity requirements necessary to implement these constructions on specific quantum hardware architectures.
