Search Talks

In 2008 Masahiro Hotta proposed a protocol for transporting energy between two localized observers A and B without any energy propagating from A to B. When this protocol is applied to the vacuum state of a quantum field, the local energy density in the field achieves negative values, violating energy conditions

We will explore the protocol of quantum energy teleportation and show how quantum information techniques can be used to activate thermodynamically passive states. We will review the first experiment showcasing the local activation of ground state energy (carried out in 2022), and we will discuss the potential of this relativistic quantum information protocol to create exotic distributions of stress-energy density in a quantum field theory, and how spacetime might react to them.

Zoom link:  https://pitp.zoom.us/j/98393523926?pwd=LzI4N1UyLzR4QVVGcENEbjBycjJwUT09

Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage. Here we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian. For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error. In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb–Robinson bound. Our results use cluster expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence. This has important physical consequences besides our efficient algorithms. In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.

Joint work with Dominik S. Wild (arXiv:2210.11490)

Zoom link:  https://pitp.zoom.us/j/97166113711?pwd=UEg4NnJlQkkxQXFnN2xXYTBxS001Zz09

We identify the microstates of the non–supersymmetric, asymptotically flat 2$d$ black hole in the dual $c=1$ matrix quantum mechanics (MQM). We calculate the partition function of the theory using Hamiltonian methods and reproduce one of two conflicting results found by Kazakov and Tseytlin. We find the entropy by counting states and the energy by approximately solving the Schrodinger equation. The dominant contribution to the partition function in the double-scaling limit is a novel bound state that can be considered an explicit dual of the black hole microstates. This bound state is long-lived and evaporates slowly, exactly like a black hole in asymptotically flat space.

Based on arXiv:2210.11493

Zoom link:  https://pitp.zoom.us/j/96045839335?pwd=S3NXQ2ZsdUlaSWpIVHoxTk11NUxtdz09

The coordinate functions on a Poisson variety are log-canonical if the Poisson bracket of two coordinate functions equals a constant times the product of these functions. We consider the symplectic groupoid of unipotent upper-triangular matrices equipped with canonical Poisson bracket. We described a system of log-canonical coordinates and the corresponding cluster structure. As a bonus, we discovered a system of log-canonical coordinates on Teichmueller space of closed genus 2 surfaces. This is joint work with L. Chekhov.

Zoom link:  https://pitp.zoom.us/j/94716952708?pwd=R2RiQWRpcHFMYlJLMlB0UjlPVGZkQT09

In recent years, machine learning has been successfully used to identify phase transitions and classify phases of matter in a data-driven manner. Neural network (NN)-based approaches are particularly appealing due to the ability of NNs to learn arbitrary functions. However, the larger an NN, the more computational resources are needed to train it, and the more difficult it is to understand its decision making. Thus, we still understand little about the working principle of such machine learning approaches, when they fail or succeed, and how they differ from traditional approaches. In this talk, I will present analytical expressions for the optimal predictions of three popular NN-based methods for detecting phase transitions that rely on solving classification and regression tasks using supervised learning at their core. These predictions are optimal in the sense that they minimize the target loss function. Therefore, in practice, optimal predictive models are well approximated by high-capacity predictive models, such as large NNs after ideal training. I will show that the analytical expressions we have derived provide a deeper understanding of a variety of previous NN-based studies and enable a more efficient numerical routine for detecting phase transitions from data.

Zoom Link: https://pitp.zoom.us/j/91642481966?pwd=alkrWEFFcFBvRlJEbDRBZWV3MFFDUT09