Topological stabilizer models on continuous variables
Abstract: In [1] we constructed a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of boson condensation -- we start from a parent stabilizer code based on an R gauge theory and condense various bosonic excitations.
Topological stabilizer models on continuous variables
In [1] we constructed a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of boson condensation -- we start from a parent stabilizer code based on an R gauge theory and condense various bosonic excitations. This produces a large class of topological CV stabilizer codes, including ones that are characterized by the anyon theories of U(1)2n×U(1)−2m Chern-Simons theories, for arbitrary pairs of positive integers (n,m).
Conditional lower bounds for algorithms with pre-processed advice
Abstract: 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.
Universal Adapters between quantum LDPC codes
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.
Permutation-invariant quantum error correction codes: from theory to practice
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.*
Two principle-based formulations of quantum theory
Abstract: I'll give theorems characterizing finite-dimensional quantum theory's framework of
Conditional lower bounds for algorithms with pre-processed advice
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.
Two principle-based formulations of quantum theory
I'll give theorems characterizing finite-dimensional quantum theory's framework of
Entanglement in dual-unitary quantum circuits with impurities
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.
Entanglement in dual-unitary quantum circuits with impurities
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.