QuICS Special Seminar

Abstract: Error-correction is key to building a quantum computer. This includes both storage of quantum information as well as computing on it. Quantum low- density parity check (LDPC) codes offer a route to build these devices with low space overhead. The next question is - how do we fault-tolerantly com- pute on these codes?  Existing proposals (Cohen et al. [2110.10794], Cross et al. [2407.18393]) rely on ancilla systems appended to the original LDPC code.

Abstract: Permutation-invariant quantum error correction codes that are invariant under any permutation of the underlying particles. These codes could have potential applications in quantum sensors and quantum memories. Here I will review the field of permutation-invariant codes, from code constructions to applications.

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*

Abstract: I'll give theorems characterizing finite-dimensional quantum theory's framework of 

Unlike the traditional study of algorithms which attempts to solve a certain task using minimal space and time resources, I will discuss data structures to solve certain algorithmic tasks after an initial pre-processing phase. The interest here is to study the tradeoffs between the resources such as the space and time required to perform the algorithmic task when asked a query; and the resources in the pre-processing phase such as the time required to prepare the data structure or its size.

I'll give theorems characterizing finite-dimensional quantum theory's framework of 

Abstract: Universal behaviors of nonequilibrium quantum many-body systems may be usefully captured by the dynamics of quantum information measures. Notably, the dynamics of bipartite entanglement entropy can distinguish integrable quantum systems from chaotic ones. The two most successful effective theories describing the evolution of entanglement from a low-entangled initial state are the quasiparticle picture and the membrane picture, which provide distinct predictions for integrable and chaotic systems, respectively.

Universal behaviors of nonequilibrium quantum many-body systems may be usefully captured by the dynamics of quantum information measures. Notably, the dynamics of bipartite entanglement entropy can distinguish integrable quantum systems from chaotic ones. The two most successful effective theories describing the evolution of entanglement from a low-entangled initial state are the quasiparticle picture and the membrane picture, which provide distinct predictions for integrable and chaotic systems, respectively.

Error-correction is key to building a quantum computer. This includes both storage of quantum information as well as computing on it. Quantum low- density parity check (LDPC) codes offer a route to build these devices with low space overhead. The next question is - how do we fault-tolerantly com- pute on these codes?  Existing proposals (Cohen et al. [2110.10794], Cross et al. [2407.18393]) rely on ancilla systems appended to the original LDPC code.

Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to achieve a provable superpolynomial quantum advantage (under some widely accepted complexity conjectures) that is robust to noise with minimal error correction requirements. We choose a class of sampling problems with commuting gates known as sparse IQP (Instantaneous Quantum Polynomial-time) circuits and we ensure its fault-tolerant implementation by introducing the tetrahelix code.

Permutation-invariant quantum error correction codes that are invariant under any permutation of the underlying particles. These codes could have potential applications in quantum sensors and quantum memories. Here I will review the field of permutation-invariant codes, from code constructions to applications.

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*