Talks

"Optimal fault tolerant error correction thresholds for CCS codes are traditionally obtained via mappings to classical statistical mechanics models, for example the 2d random bond Ising model for the 1d repetition code subject to bit-flip noise and faulty measurements. Here, we revisit the 1d repetition code, and develop an exact “stabilizer expansion” of the full time evolving density matrix under repeated rounds of (incoherent and coherent) noise and faulty stabilizer measurements. This expansion enables computation of the coherent information, indicating whether encoded information is retained under the noisy dynamics, and generates a dual representation of the (replicated) 2d random bond Ising model. However, in the fully generic case with both coherent noise and weak measurements, the stabilizer expansion breaks down (as does the canonical 2d random bond Ising model mapping). If the measurement results are thrown away all encoded information is lost at long times, but the evolution towards the trivial steady state reveals a signature of a quantum transition between an over and under damped regime. Implications for generic noisy dynamics in other CCS codes will be mentioned, including open issues."

We develop a Machine-Learning Renormalization Group (MLRG) algorithm to explore and analyze many-body lattice models in statistical physics. Using the representation learning capability of generative modeling, MLRG automatically learns the optimal renormalization group (RG) transformations from self-generated spin configurations and formulates RG equations without human supervision. The algorithm does not focus on simulating any particular lattice model but broadly explores all possible models compatible with the internal and lattice symmetries given the on-site symmetry representation. It can uncover the RG monotone that governs the RG flow, assuming a strong form of the $c$-theorem. This enables several downstream tasks, including unsupervised classification of phases, automatic location of phase transitions or critical points, controlled estimation of critical exponents, and operator scaling dimensions. We demonstrate the MLRG method in two-dimensional lattice models with Ising symmetry and show that the algorithm correctly identifies and characterizes the Ising criticality.

---

Zoom link

Asymptotically safe quantum gravity might provide a unified description of the fundamental dynamics of quantum gravity and matter. The realization of asymptotic safety, i.e., of scale symmetry at high energies, constraints the possible interactions and dynamics of a system. In this talk, I will first introduce the scenario of asymptotic safety for gravity with matter, and explain how it can be explored using functional methods. I will then emphasize, how the constraints on the microscopic dynamics of matter arising from quantum scale symmetry can turn into constraints on the gravitational dynamics, both by exploring the asymptotically safe fixed-point structure, and by exploring resulting infrared physics.

---

Zoom link

Given a semisimple group G and a smooth projective curve X over an algebraically closed field of arbitrary characteristic, let Bun_G(X) denote the moduli space of principal G-bundles over X. For a bundle P without infinitesimal symmetries, we describe the n^th order divided-power infinitesimal jet spaces of Bun_G(X) at P for each n. The description is in terms of differential forms on X^n with logarithmic singularities along the diagonals. Furthermore, we show the pullback of these differential forms to the Fulton-Macpherson compactification space is an isomorphism, thus illustrating a connection between infinitesimal jet spaces of Bun_G(X) and the Lie operad.

---

Zoom link 

Presented in collaboration with Navigating Quantum and AI Career Trajectories: A Beginner’s Mini-Course on Computational Methods and their Applications

---

Deeptech or science-based innovations often spend more than a decade percolating within academic and government labs before their value is recognized (Park et al., 2022). This development lag time prior to venture formation is only partly due to technological development hurdles. Because science-based inventions are often generic in nature (Maine & Garnsey, 2006), meaning that they have broad applicability across many different markets, the problem of identifying a first application requires the confluence of deep technical understanding with expert knowledge of the practice of commercialization. This process of technology-market matching is a critical aspect of the translation of science-based research out of the lab (Pokrajak 2021, Gruber and Tal, 2017; Thomas et al, 2020, Maine et al, 2015) and is often delayed by a lack of capacity to identify, prioritize and protect market opportunities. Typically, deeptech innovations can take 10-15 years of development, and tens (or even hundreds) of millions of dollars of investment to de-risk before a first commercial application (Maine & Seegopaul, 2016). Academics seeking to commercialize such inventions face the daunting challenge of competing for investment dollars in markets that are ill suited to the uncertainty and timescales of deep tech development. The time-money uncertainty challenge faced by science-based innovators is compounded by the fact that most of the scientists and engineers with the world-leading technical skills required to develop science-based inventions, lack innovation skills training, and so cannot navigate the complexities of early and pre-commercialization development critical to venture success. Some researchers, having developed a mix of technical and business expertise, have demonstrated a long-term ability to serially spin out successful ventures (Thomas et al., 2020). Entrepreneurial capabilities, which can be learned, enable scientistentrepreneurs to play formative roles in commercialising lab-based scientific inventions through the formation of well-endowed university spin-offs. (Park et al, 2022; 2024). Commercialization postdocs, when supported by well designed training, stipends, and de-risking supports, can lead the mobilization of fundamental research along multiple commercialization pathways. Recommendations are provided for scholars, practitioners, and policymakers to more effectively commercialise deeptech inventions.

---

Zoom link

 

Topological phases of matter offer a promising platform for quantum computation and quantum error correction. Nevertheless, unlike its counterpart in pure states, descriptions of topological order in mixed states remain relatively under-explored. We will give various definitions for replica topological order in mixed states. Similar to the replica trick, our definitions also involve n copies of density matrix of the mixed state. Within this framework, we categorize topological orders in mixed states as either quantum, classical, or trivial, depending on the type of information they encode.

For the case of the toric code model in the presence of decoherence, we associate for each phase a quantum channel and describes the structure of the code space. We show that in the quantum-topological phase, there exists a postselection-based error correction protocol that recovers the quantum information, while in the classical-topological phase, the quantum information has decohere and cannot be fully recovered. We accomplish this by describing the mixed state as a projected entangled pairs state (PEPS) and identifying the symmetry-protected topological order of its boundary state to the bulk topology.

---

Zoom link