Physics and complexity in a growing quantum world

Thomas Schuster uses quantum-information dynamics to study complexity in increasingly coherent experimental systems. A classical polynomial-time algorithm for circuits with uncorrected noise establishes limits on their possible quantum advantage. A second result shows that universal random-matrix behaviour can emerge exponentially faster than previously expected in local circuits and time evolution, with implications for benchmarking, cryptographic protocols and fundamental physics.