Machine learns quantum complexity

Dongsu Bak

doi:10.1007/s40042-025-01529-w

Return

Machine learns quantum complexity

2025-11-01

PRE

DOI：10.1007/s40042-025-01529-w

Original

Original request for help

Save

Abstract

En 中文

We study how a machine based on deep learning algorithms learns Krylov spread complexity in quantum systems with NxN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N \times N$$\end{document} random Hamiltonians drawn from the Gaussian unitary ensemble. Using thermofield double states as initial conditions, we demonstrate that a convolutional neural network-based algorithm successfully learns the Krylov spread complexity across all timescales, including the late-time plateaus where states appear nearly featureless and random. Performance strongly depends on the basis choice, performing well with the energy eigenbasis or the Krylov basis but failing in the original basis of the random Hamiltonian. The algorithm also effectively distinguishes temperature-dependent features of thermofield double states. Furthermore, we show that the system time variable of state predicted by deep learning is an irrelevant quantity, reinforcing that the Krylov spread complexity well captures the essential features of the quantum state, even at late times.

Keywords:

Quantum complexity

Matrix model

Deep learning