Physics

Classical chaotic systems exhibit exponential divergence of initially infinitesimally close trajectories, which is characterized by the Lyapunov exponent. This sensitivity to initial conditions is popularly known as the  "butterfly effect." Of great recent interest has been to understand how/if the butterfly effect and Lyapunov exponents generalize to quantum mechanics, where the notion of a trajectory does not exist. In this talk, I will introduce the measure of quantum chaoticity  – a so-called out-of-time-ordered four-point correlator (whose semiclassical limit reproduces classical Lyapunov growth), and use it to describe quantum chaotic dynamics and its eventual disappearance in the standard models of classical and quantum chaos – Bunimovich stadium billiard and standard map or kicked rotor [1]. I will describe our recent results on the quantum Lyapunov exponent in these single-particle models as well as results in interacting many-body systems, such as disordered metals [2]. The latter many-body model exhibits an interaction-induced transition from quantum chaotic to non-chaotic dynamics, which may manifest itself in a sharp change of the distribution of energy levels from Wigner-Dyson to Poisson statistics. I will conclude by formulating a many-body analogue of the Bohigas-Giannoni-Schmit conjecture.
References:
[1] "Lyapunov exponent and out-of-time-ordered correlator's growth rate in a chaotic system,"  E. Rozenbaum, S. Ganeshan, and V. Galitski, Physical Review Letters 118, 086801 (2017)
[2] "Non-linear sigma model approach to many-body quantum chaos," Y. Liao and and V. Galitski, arXiv:1807.09799

Recently there have been several proposals of low-energy precision experiments that can search for new particles, new forces, and the Dark Matter of the Universe in a way that is complementary to collider searches. In this talk, I will present some examples involving atomic clocks, nuclear magnetic resonance, and astrophysical black holes accessible to LIGO.

Simplicial complexes naturally describe discrete topological spaces. When their links are assigned a length they describe discrete geometries. As such simplicial complexes have been widely used in quantum gravity approaches that involve a discretization of spacetime. Recently they are becoming increasingly popular to describe complex interacting systems such a brain networks or social networks. In this talk we present non-equilibrium statistical mechanics approaches to model large simplicial complexes. We propose the simplicial complex model of Network Geometry with Flavor (NGF), we explore the hyperbolic nature of its emergent geometry and their relation with Tree Tensor Networks. Finally we reveal the rich interplay between Network Geometry with Flavor and dynamics. We investigate the percolation properties of NGF using the renormalization group finding KTP and discontinuous phase transitions depending on the dimensionality simplex. We also comment on the synchronization properties of NGF and the emergence of frustrated synchronization.

We propose to generalise classical maximum likelihood learning to density matrices. As the objective function, we propose a quantum likelihood that is related to the cross entropy between density matrices. We apply this learning criterion to the quantum Boltzmann machine (QBM), previously proposed by Amin et al. We demonstrate for the first time learning a quantum Hamiltonian from quantum statistics using this approach. For the anti-ferromagnetic Heisenberg and XYZ model we recover the true ground state wave function and Hamiltonian. The second contribution is to apply quantum learning to learn from classical data. Quantum learning uses in addition to the classical statistics also quantum statistics for learning. These statistics may violate the Bell inequality, as in the quantum case. Maximizing the quantum likelihood yields results that are significantly more accurate than the classical maximum likelihood approach in several cases. We give an example how the QBM can learn a strongly non-linear problem such as the parity problem. The solution shows entanglement, quantified by the entanglement entropy.

Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning inspired approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap Tr(rho*sigma) between two quantum states rho and sigma. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to rho=sigma, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate alphabets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error - compared to the Swap Test - on these computers.