A stipend scholarship to support PhD students who are undertaking research within School of Physics, Faculty of Science at the University of Sydney.

Two (2) Full time, 3 years fixed term opportunities. Located at the Sydney Mathematical Research Institute (SMRI) Opportunity to contribute to research focused on pure or applied mathematics or statis...

Join a thriving Faculty of Engineering at a University ranked amongst the world’s best teaching and research institutions Located in the heart of Sydney’s bustling inner west quarter, close to beaches...

The lack of an energy barrier in stabilizer Hamiltonians is well known to be an indication of short thermalisation times; and serves as a simple criteria to rule out self-correction. Its applicability...

We present a new perspective on the $p$-string condensation procedure for constructing 3+1D fracton phases by implementing this process via the gauging of higher-form symmetries. Specifically, we show...

YouTube video by YITP Quantum Error Correction Workshop

In the context of quantum physics, the term "duality" refers to transformations that link apparently distinct physical theories, often unveiling hidden symmetries. Some recent studies have been aimed ...

In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conventional approaches based on surface codes. Performing fault-tolerant logical computation on QLDPC memory, however, has been a long standing challenge in theory and in practice. In this work, we propose a new primitive, which we call an $\textit{extractor system}$, that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation. In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle, consisting of $O(d)$ physical syndrome measurement cycles, without rearranging qubit connectivity. We further propose a fixed-connectivity, LDPC architecture built by connecting many extractor-augmented computational (EAC) blocks with bridge systems. When combined with any user-defined source of high fidelity $|T\rangle$ states, our architecture can implement universal quantum circuits via parallel logical measurements, such that all single-block Clifford gates are compiled away. The size of an extractor on an $n$ qubit code is $\tilde{O}(n)$, where the precise overhead has immense room for practical optimizations.

Our PhD Scholarship program offers students funding to work alongside some of the world’s leading quantum researchers and gain industry-ready skills.

The surface code is a two-dimensional stabiliser code with parameters $[[n,1,\Theta(\sqrt{n})]]$. To this day, no stabiliser code with growing distance is know to live in less than two dimensions. In ...

We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new connection between 3D codes and 2D non-Abelian topological phases. We prove a threshold theorem for our protocols under local stochastic circuit noise using a just-in-time decoder to correct the non-Abelian code.

We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilize...

8:00 am – 11:00 am, Friday March 21, Session MAR-W11, Anaheim Convention Center, 155 (Level 1)

In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conve...