Emergence of Universal Randomness in Quantum Many-body Dynamics

Published on ● Video Link: https://www.youtube.com/watch?v=zLLxAvX6qWU



Duration: 44:13
888 views
0


Soonwon Choi (MIT)
https://simons.berkeley.edu/talks/soonwon-choi-mit-2024-04-23
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Certain ensembles of random unitaries or states – those forming approximate designs – provide useful tools in quantum information theory, enabling a wide range of applications from the analysis of the circuit complexity to the development of benchmarking protocols. In this talk, we report an unexpected discovery inspired by modern quantum simulation experiments: natural quantum many-body dynamics give rise to pure state ensembles with universal statistical properties. Specifically, we consider two types of ensembles: (i) the projected ensemble is formed by random pure states for a subsystem obtained by performing projective measurement on its complement, and (ii) the temporal ensemble is obtained by global quantum states evolved under ergodic Hamiltonian for different time durations. In both cases, the ensembles display universal statistical properties, a phenomenon we dub deep thermalization and Hilbert-space ergodicity, respectively. The special case of infinite effective temperature corresponds to the emergence of approximate state designs. We discuss a number of analytic and numerical results supporting our claim as well as how to observe and utilize the universal properties in modern experiments. These findings allow us to generalize the linear-cross entropy benchmark (XEB) to analog quantum simulators, to develop further applications such as parameter estimation and noise characterization and could establish quantifiable connections between random matrix theory and realistic ergodic quantum many-body dynamics.




Other Videos By Simons Institute for the Theory of Computing


2024-04-30An Overview of Quantum Algorithms
2024-04-30Certifying almost all quantum states with few single-qubit measurements
2024-04-30Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time
2024-04-30A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography
2024-04-30The Virtues of the Quantum Approximate Optimization Algorithm
2024-04-30Continuous-time quantum walks for MAX-CUT are hot
2024-04-30Circuit Conspiracies
2024-04-30Analog quantum machine learning for near-term hardware
2024-04-30Hardware-efficient quantum computing using qudits
2024-04-30Probing the limits of classical computing with arbitrarily connected quantum circuits
2024-04-30Emergence of Universal Randomness in Quantum Many-body Dynamics
2024-04-30Exploring the quantum computing frontier with reconfigurable atom arrays
2024-04-30On Scrambling Times of Quantum Systems, Including Black Holes
2024-04-30From randomized benchmarking to cycle error reconstruction
2024-04-30How to fault-tolerantly realize any quantum circuit with local operations
2024-04-30Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
2024-04-30QEC demonstrations leveraging dynamic circuits
2024-04-30Scheduling syndrome measurement circuits
2024-04-30Halving the cost of surface codes by running error correction at the logical level
2024-04-30A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing
2024-04-30Quantum neural networks



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
Soonwon Choi