Colloquia IGFAE

Quantum chaos and the complexity of time evolution

Abstract: I will describe new ideas relating quantum chaos to the complexity of time evolution.  One approach treats physical time evolution as a quantum computation, and bounds the smallest quantum circuit that can simulate this evolution.  The second approach quantifies how ergodically and rapidly a quantum state explores the accessible part of the system’s Hilbert space.  I will illustrate how these measures separate integrable and chaotic quantum systems by considering examples including particles on group manifolds, spin chains, quantum billiards, and Random Matrix Theory.  I will end by describing an application of these methods to a conjecture that geometrizes complexity in quantum gravity.

Quantum Computing for Particle Physics: beyond theoretical boundaries

Abstract: High‑energy colliders such as the Large Hadron Collider (LHC) at CERN are inherently quantum machines, and so in the spirit of Richard Feynman’s original vision, natural candidates as testbeds for applications of Quantum Computing. Although a fully fledged quantum event generator for collider scattering remains a long‑term goal, there is growing interest in the particle physics community in exploiting recent advances in Quantum Computing.

Promising directions include Quantum Machine Learning for collider data analysis, faster and more precise evaluation of intricate multiloop Feynman integrals, quantum‑enhanced approaches to jet clustering and jet evolution, tracking, parton‑shower simulations, and many other emerging applications. In this colloquium, I will review key Quantum Computing applications in Particle Physics, with emphasis on theoretical predictions at high perturbative orders, and will discuss about future potential developments, particularly in the critical transition from the NISQ era to Fault-Tolerant Quantum Computing.